Welcome to CIS 068 !

1
Welcome to CIS 068 !
Software Design Data Structures In JAVA
Instructor Rolf Lakaemper Peer Teacher Aubrey
Jones TA Michael Broscius
2
Introduction

• Who are we ?
• Whats this course about ?

3
Who are we ?
Rolf Lakaemper

• PhD in applied mathematics in Hamburg,
  Germany
• Assistant professor at CIS since 2003
• Research topic Image Processing
• lt2003 Software Development Director of
  different companies (Computer Games, Voice
  Video over IP)

4
Who are we ?
Aubrey Jones Peer Teacher Michael Broscius, TA
5
Topics of CIS 068

• Software Theory
• A look at modern techniques of industrial
  software development
• Software Practice
• Consolidation of Object-Oriented Programming
  (OOP) techniques in JAVA
• Software Analysis
• Fundamental data structures, algorithms and
  their performance

6
Software Theory

• Software Engineering and OOD

Different views of software
The software lifecycle
Diagrams, Use Cases,...
7
Software Theory

• Correctness

• Syntax errors

print (hello world

• Runtime errors

ERROR ! Division by zero error at 0000ff03f4
(-gt00f43aa7) af 000 bc 3ef4 hl 988f de 45db

• Logical Errors

M0..255aü n i M gt n1 i M
8
Software Theory

• Principles of OOP
• Inheritance, class hierarchies,
  polymorphism,abstract and interface classes,

abstract class
interface1
interface2
class1
class2
class1_1
9
Software Practice

• OOP in JAVA

GUIs
10
Software Practice

• OOP in JAVA Recursion

11
Software Practice

• We will use JAVA as an example for a modern,
  object oriented language.
• The topics of this class are not (too) JAVA
  specific, although all programming is done in
  JAVA.

12
Software Analysis

• Fundamental Algorithms
• Sorting Bubble-, Insertion-, Merge-, Quicksort

A,H,D,O,P,C,C,J
A,C,C,D,H,J,O,P
O(n log n)
Efficiency
13
Software Analysis

• Fundamental Datastructures

Stacks
Queues
Trees
14
Textbook

• Course will be close to this book
• Koffman Wolfgang Objects, Abstraction, Data
  Structures and Design using JAVA, Version 5.0
• (Wiley, 2005)

15
Class Schedule

• Class meets
• Monday 240 430, Tuttleman TL 1A
• Wednesday 240 330, Tuttleman TL 1A
• Friday 240 430, Wachman Hall 104
• Monday classes will include a Mini Quiz
• Friday will be in the lab where you will do a
  programming exercise designed to reinforce the
  weeks topic.

16
Exams and Quizes

• There will be weekly quizzes given on Monday.
  These will count 10 of your grade (in total).
• Therell be extra points during class, counting
  as Mini Quizzes
• There will be one mid-term examination 20
• There will be a final examination 30
• Lab assignment grades will count 40

17
Lab Assignments

• There will be weekly lab assignments.
• The labs will count 40 of your final grade.
• Lab will start Friday, Jan.20th

18
Lab Grades

• Labs will be graded as follows
• On time max.10
• Late, max 6
• The TA, Peer Teacher and Instructor are here to
  help you. Do not wait until the last minute if
  you are stuck !

19
Policy on Cheating

• Programming must be learned by doing it !
• Copying another students program deprives you of
  that learning opportunity.
• If a lab assignment is found to be a copy, both
  students will receive a 10 for that assignment.
• If more than one program is found to be a copy,
  the students involved will receive an F for the
  course.

20
Any Questions ?

• Rolf Lakaemper
• Office Room 308, Wachman Hall
• E-mail lakamper_at_temple.edu
• Phone [phone]
• Office Hours
• Wednesday after class, 345 5pm
• Or just come in whenever.
• All this can be found on my website
• http//knight.cis.temple.edu/lakaemper