[MSOE Logo]

CS-285
Data Structures

Tentative Schedule Fall 2000

Week Period Topics Reading Assignment Lab
1
9/4-9/8
Lecture 1 Course introduction
Prerequisite assessment
  Logging in.
Course Policies.
Lecture notes.
Lecture 2 No class (President's Picnic)  
2
9/11-9/15
Lecture 1 C++ review Pages 1-42. Lab 1: XML Parser
Lecture 2 Algorithms: Properties and Analysis Pages 45-84.
3
9/18-9/22
Lecture 1 Exectution time cont... Induction Pages 107-137.
Lecture 2 Review of STL Container classes Pages 107-182.
4
9/25-9/29
Lecture 1 Stacks and Queues Pages 217-235. Lab 2: XML/HTML Validator
Lecture 2 Generic Algorithms and Templates  
5
10/2-10/6
Lecture 1 Mid-term Exam   Lab 3: Generic Algorithms
Lecture 2 Program Correctness Pages 87-101.
6
10/9-10/13
Lecture 1 Sets and Multisets Pages 263-291. Lab 4: WordSearch
Lecture 2 Design Exercise  
7
10/16-10/20
Lecture 1 Dynamic Data Structures (list) Pages 185-214.
Lecture 2 Catch-up/Review  
8
10/23-10/27
Lecture 1 Hash Tables Pages 407-426. Lab 5: Hash Table Implementation
Lecture 2 Introduction to Trees  
9
10/30-11/3
Lecture 1 Trees: Nonlinear Data Structures Pages 293-307. Lab 6: WordSearch Revisited
Lecture 2 Design Exercise  
10
11/6-11/10
Lecture 1 Maps and Multimaps Pages 387-405.
Lecture 2 Design Exercise  
11
11/13-11/17
Exam week Final exam    
This page was last updated on August 28, 2000; send comments to Dr. Christopher C. Taylor