[MSOE Logo]

CS-285
Data Structures

Tentative Schedule Winter 1999-2000

Week Period Topics Reading Assignment Lab
1
11/29-12/3
Lecture 1 Course introduction
Prerequisite assessment
  Logging in.
Electronic submission.
Lecture notes.
Lecture 2 C++ review Pages 1-42.
2
12/6-12/10
Lecture 1 Algorithms: Properties and Analysis Pages 45-56. Spell Checker
-- list
Lecture 2 Recursive algorithms
Execution time
Pages 56-84.
3
12/13-12/17
Lecture 1 Exectution time cont... Induction Pages 107-137.
Lecture 2 Review of STL Container classes Pages 107-182.
Merry Christmas
4
1/3-1/7
Lecture 1 Dynamic Data Structures (list) Pages 185-214. list Implementation
Lecture 2 Catch-up/Review  
5
1/10-1/14
Lecture 1 Program Correctness Pages 87-101.
Lecture 2 Mid-term Exam  
6
1/17-1/21
Lecture 1 Generic Algorithms and Templates   Generic Algorithm
Implementation
Lecture 2 Stacks and Queues Pages 217-235.
7
1/24-1/28
Lecture 1 Sets and Multisets Pages 263-291. Spell Checker -- set
Lecture 2 Design Exercise  
8
1/31-2/4
Lecture 1 Hash Tables Pages 407-426. Hash Table Implementation
Lecture 2 Introduction to Trees  
9
2/7-2/11
Lecture 1 Trees: Nonlinear Data Structures Pages 293-307. Spell Checker -- hash
Lecture 2 Design Exercise  
10
2/14-2/18
Lecture 1 Maps and Multimaps Pages 387-405. Spell Checker Comparisons
Lecture 2 Design Exercise  
11
2/21-2/25
Exam week Final exam    
This page was last updated on February 23, 2000; send comments to Dr. Christopher C. Taylor