CS 127, Data Structures                                 Spring 2001,      RWN
A Priori Syllabus                                             1a,         CMC 206
 
 
Day of Term Day of Week Date Topics Readings in Kruse
  1 M   3/26 Intro, Review of C++  Ch. 1
  2 W   28 Arrays  
  3 F   30 ADTs  Ch. 2
  4 M   4/2 Stacks
  5 W   4 Templates  
  6 F   6 Queues  Ch. 3
  7 M   9 Inheritance  
  8 W   11 Singly Linked Lists  Ch. 4
  9 F   13 More General Lists
  10 M   16 Recursion  Ch. 5
  11 W   18 Strings  Ch. 6
  12 F   20 Review  
  13 M   23 Quiz #1 (in class)
  14 W   25 Searching  Ch. 7
  15 F   27 Sorting  Ch. 8
  X M   30 Midterm Break  Ch. 7
  16 W   5/2 Simulation  App. B
  17 F   4 Tables  Ch. 9
  18 M   7 Hashing  
  19 W   9 More Hash  
  20 F   11 Binary Trees  Ch. 10
  21 M   14 BSTs  
  22 W   16 Expression Trees  Ch. 13
  16 F   18 AVL Trees  
  24 M   21 Multi-way Trees, Tries  Ch. 11
  25 W   23 Quiz #2 (take-home due)
  26 F   25 Graphs  Ch. 12
  27 M   28 More Graphs  
  28 W   30 Quiz #3 (in-class)
  29 M   6/4 Projects and Portfolios due
 

What counts?
  50% Exams: 3 Exams @ 16 2/3% each
  50% Problems, Programs, Pop Quizzes, Projects, Portfolios, Participation, Etc.
Attendance: More than two unexcused absences will affect your grade.

Text: Data Structures and Programm Design by Kruse and Ryba

Instructor: Richard W. Nau
            email: rnau
            office: CMC 324
            phone: x4361  (home 663-6159, except 11pm-7am)
 
 


Page maintained by:
R. W. Nau: rnau@carleton.edu
Last Modified: