CS285: Data Structures

[MSOE Logo] Tentative Schedule
Winter 2001-2002
Week Period Topics Reading Assignment Lab
1
11/26-11/30
Lecture 1 Course introduction
Prerequisite assessment
  Electronic submission,
Lab 1: Decryption
Lecture 2 C++ review Pages 1-42.
2
12/3-12/7
Lecture 1 Algorithms: Properties and Analysis Pages 45-56.
Lecture 2 Recursive algorithms
Execution time
Pages 56-84.
3
12/10-12/14
Lecture 1 Exectution time cont... Induction Pages 107-137. Stacks and Queues, (pp. 217-235)
Lab 2: XML/HTML Validator
Lecture 2 Review of STL Container classes Pages 107-182.
4
12/17-12/21
Lecture 1 Mid-term Exam  
Lecture 2 Work on lab 2  
Merry Christmas
5
1/7-1/11
Lecture 1 Generic Algorithms and Templates   Lab 3: Generic Algorithms
Lecture 2 Program Correctness Pages 87-101.
6
1/14-1/18
Lecture 1 Sets and Multisets Pages 263-291. Lab 4: WordSearch
Lecture 2 Sets cont...  
7
1/21-1/25
Lecture 1 Dynamic Data Structures (list) Pages 185-214.
Lecture 2 Catch-up/Review  
8
1/28-2/1
Lecture 1 Hash Tables Pages 407-426. Lab 5: Hash Table Implementation
Lecture 2 Introduction to Trees  
9
2/4-2/8
Lecture 1 Trees: Nonlinear Data Structures Pages 293-307. Lab 6: WordSearch Revisited
Lecture 2 Binary Search Trees  
10
2/11-2/15
Lecture 1 Maps and Multimaps Pages 387-405.
Lecture 2 Catch-up/Review  
11
2/18-2/22
Exam week Final exam    
This page was last updated on November 8, 2001; send comments to Dr. Christopher C. Taylor