CPS 100, Spring 1997 Syllabus

For best results you should do the reading below before the class for which it is listed. The material indicated will be covered in the reading and you'll get the most out of each class/lecture/discussion if you've looked over the relevant material.
Reading/Topics
Date Topic Reading
Jan 17 Overview, linked lists, complexity, C++, vectors Astrachan (especially 8,9,11)
Jan 20
Jan 22
Jan 24
Classes, Linked lists
inheritance,overloaded operators
linked structures, big-Oh
Astrachan 12, Weiss 1,2
Weiss 3,4
Astrachan 12, Weiss 5, 6.4
Jan 26
Jan 28
Jan 30
big-Oh, Recursion, Stacks
Stacks, Queues
Expressions, Parsing
Astrachan 10, Weiss 7
Weiss 6.1-6.3, 11.1, 13
Chapter 11
Feb 3
Feb 5
Feb 7
catch up
Searching, Trees
Trees (binary, general)
catch up
Weiss 5.6, 6.5, 6.6
Weiss 17, 18.1, 18.2
Feb 10
Feb 12
Feb 14
C++, Design, Classes
Trees
Balanced Trees

Weiss 18
Weiss 18
Feb 17
Feb 19
Feb 21
Catch up, C++
Review
Test 1

Feb 24
Feb 26
Feb 28
Inheritance, Hashing, Maps
Hashing, Iterators, Patterns
Applications
Weiss 5, 6.7, Astrachan 12E
Chapter 19
catchup
Mar 3
Mar 5
Mar 7
Sorting
Sorting Applications
Lower Bounds
Astrachan 11, Weiss 8.1-8.3
Weiss 8.4-8.6
Weiss 8.7-8.9
Mar 10
Mar 12
Mar 14
Priority Queues
Priority Queues
Huffman Coding
Chapter 20
Chapter 20
Chapter 12
spring break relax a novel
Mar 24
Mar 26
Mar 28
Huffman Coding
Design, C++, Makefiles
catchup
catch up
Mar 31
Apr 2
Apr 4
Graphs
Graph Algorithms
Applications
Chapter 14.1, 14.2
Chapter 14
catch up
Apr 7
Apr 9
Apr 11
review
Test 2
Graphs
catch up
Apr 14
Apr 16
Apr 18
Backtracking
Backtracking
Design
Weiss 10.2
Apr 21
Apr 23
Apr 25
C, C++, Java
Theory and Practice
catch up
outside reading
Apr 28
Apr 30
catch up
all questions answered
catchup

ola@cs.duke.edu
Last modified: Thu Jan 16 22:49:45 EST