| WK |
Theory Readings
|
Algorithms
Discrete Math |
Programming
(subject & readings)
|
Lab |
0
1/15 |
Cor: Chap 1 |
Algorithms in Computing |
Linked Lists
CP: Chap 4(p. 151 - 163) |
Lab1 |
1
1/22 |
Cor: Sect 10.2
Hag: Chap 1 |
Linked Lists
Introduction to Discrete Math |
Programming with Sorted Linked Lists
CP: Chap 4 (p. 163 - 186) |
Lab2
|
2
1/29 |
Cor: Sect 31.7
Hag: Chap 2 |
Encryption
Logic and
Proofs |
Variations of the Linked List
CP: Chap 4 (p. 186-200) |
Lab 3
|
3
2/5 |
Cor: Chap 4
Hag: Chap 3
CP: p. 231-234 |
Recurrences
Introduction to Set Theory
Math Induction |
Recursion & Math Induction
CP: Chap 5 |
Lab 4 |
4
2/12 |
Cor: Sect 10.1
Hag: Chap 4 |
Stacks & Queues
Cardinality of Sets |
Using the Collection Framework
Stacks & Queues
CP: Chapt 6 & 7 |
Lab 5:
Inventory
problem |
5
2/19 |
Cor: Chap 3
Hag: Chap 4 |
Growth of Functions
Relations |
Inheritance & Dynamic binding
CP: Chap 8 |
Inv. prob. cont. |
6
2/26 |
Cor: Chap 2
Hag: Chap 5 |
Analyzing Execution Times
Functions |
Efficiency of Algorithms
CP: Chap 9 (p. 384-413 |
Lab 6:
8 Queens problem
Carrano code |
7
3/2 |
Cor: Chap 7
Hag: Chap 6 |
Divide & Conquer(2)
Combinatorics |
Sorting Algorithms
CP: Chap 9 |
8 queens cont. |
8
3/11 |
Cor: Chap 15 |
Midterm Exam
Dynamic Programming
|
Unix
CP: Chap 10 |
Lab 7: Queue problem |
|
Spring Break |
|
|
|
9
3/25 |
Cor: Chap 5.3
Cor: Chap 6 |
Randomized Algorithms
Heaps & Heapsort |
Tables, Heaps, & Priority Queues
CP: Chap 11 |
queues cont. |
10
4/1 |
Cor: Chap 13
|
Red Black Trees & AA trees
|
Balanced Search Trees
CP: Chap 12 (p. 541-578) |
Lab 8:
SortDetective |
11
4/8 |
Cor: Chap 11
Hag: Chap 7 |
Hash tables
Graph Theory (2) |
Hashing
CP: Chap 12 (p. 578-597) |
S.D. cont. |
12
4/15 |
Cor: Sect 22.1-22.3
Cor: Chapt 16 & 23 |
Elementary Graph Algorithms
Minimum Spanning Trees
Greedy Algorithms (4) |
Graph Traversals
Spanning Trees
CP: Chap 13 (p. 611-633) |
Lab 9:
C++ |
13
4/22 |
Cor: Sect 24.2-3
Cor: Chap 25
Hag: Chap 8 |
Single Source Shortest Path
Floyd & Warshall's algorithms(4)
|
Shortest Paths
Circuits
CP: Chap 13 (p. 633-642) |
Lab 9, cont. |
14
4/29 |
Cor: Chap 34 |
NP-Completeness
Final Exam |
|
|