Computer Science Department

1
Lecture 1

• Computer Science Department
• Northern Illinois University
• De Kalb, IL 60115
• Fall03

2
Todays Outline

• Administrative Stuff
• Overview of CSCI440
• An Assessment Test

3
Course Information

• Text Data Structures Algorithm Analysis in
  Java 2nd edition, by Mark Allen Weiss
• Section 11000 - 1050 AM, MWF, PM253  Professor
  Eugene Sheng
• Section 2   1100 - 1150 AM, MWF, PM253  
  Professor Georgia Brown
• Section 3   330 - 445 PM, TH, PM252 Professor
  Robert Janota

4
Course Policies

• Assignments 40
• 20 penalty for each 24 hour late
• Independent work
• Discussion in General is encouraged
• Grading
• Midterm 25
• Final 35

5
Course Policies

• Percentage of Points received Letter Grade
• 90 A
• 80 - 89 B
• 70 - 79 C
• 60 - 69 D
• 59 below F

6
Course Information

• Course Web Site http//www.cs.niu.edu/sheng/Fall
  03/CSCI440/Info.htm
• All programming assignments are graded on UNIX in
  g

7
What is this Course About?

• To review the fundamental data structures and
  programming techniques learned in CSCI241 240
• To learn more advanced data structures and
  programming techniques and program development
  methodologies
• To evaluate and select data structures and
  algorithms for solving problems efficiently.

8
Data Structures and Algorithms

• Lists, Stacks, Queues
• Heaps
• Binary Search Trees
• AVL Trees
• Hash Tables
• Graphs
• Disjoint Sets

Insert Delete Find Merge Shortest Paths Union
Data Structures
Algorithms
9
Abstract Data Types (ADT)

• Mathematical description of an object and the set
  operations on the object
• ADT provided by the programming language
• Integer, float, long, double, char,
• ADT provided by STL (standard template library)
• string, vector, map, stack, queue
• Programmer created ADT
• Students, courses, rooms,

10
An Example Queue ADT

• Queue operations
• create
• destroy
• enqueue
• dequeue
• is_empty
• Queue property if x is enQed before y is enQed,
  then x will be deQed before y is deQed
• FIFO First In First Out

F E D C B
dequeue
enqueue
G
A
11
Applications of the Q

• Hold jobs for a printer
• Store packets on network routers
• Make waitlists fair
• Breadth first search
• Level-by-level traversal of trees

12
To do list

• The assessment
• Make sure you are able to login onto ux/mp with
  your z number and read emails
• Check out the web page
• Read Chapters 1 and 2 in the book