| WK | Theory Readings |
Algorithms Discrete Math |
Programming (subject & readings) |
Lab |
| 0 | Cor: Chap 1 | Algorithms in Computing | Linked Lists
CP: Chap 4(p. 151 - 163) |
Lab1: |
| 1 |
Cor: Sect 10.2
Rosen: Chap 1 |
Linked Lists Introduction to Discrete Math |
Programming with Sorted Linked Lists
CP: Chap 4 (p. 163 - 186) Horstman Chap 19 |
Lab2: |
| 2 | Cor: Sect 31.7 Rosen: Chap 1 |
Encryption Logic and Proofs |
Variations of the Linked List
CP: Chap 4 (p. 186-200) |
Lab 3: |
| 3 | Cor: Chap 4 Rosen: Chap 2.1-2.3 CP: p. 231-234 |
Recurrences Introduction to Set Theory Math Induction |
Recursion & Math Induction
CP: Chap 5 |
Lab 4: Inventory problem |
| 4 | Cor: Sect 10.1 Rosen: Chap 2.4-2.7 |
Stacks & Queues Cardinality of Sets |
Using the Collection Framework Stacks & Queues CP: Chapt 6 & 7 |
Lab 5: 8 Queens problem Carrano code |
| 5 | Cor: Chap 3 Rosen: Chap 3.1-3.3 |
Growth of Functions Relations |
Inheritance & Dynamic binding
CP: Chap 8 |
Lab 6: Queue problem |
| 6 | Cor: Chap 2 Rosen: Chap 3.4-3.6 |
Analyzing Execution Times Functions |
Efficiency of Algorithms
CP: Chap 9 (p. 384-413 |
|
| 7 | Cor: Chap 7 Rosen: Chap 4.1-4.4 |
Divide & Conquer(2) Combinatorics |
Sorting Algorithms
CP: Chap 9 |
Lab 7: SortDetective |
| 8 | Cor: Chap 15 |
Midterm Exam Dynamic Programming |
Unix
CP: Chap 10 |
|
| Spring Break | ||||
| 9 | Cor: Chap 5.3 Rosen: Chap 5.1-5.3 |
Randomized Algorithms Heaps & Heapsort |
Tables, Heaps, & Priority Queues
CP: Chap 11 |
|
| 10 | Cor: Chap 13 |
Red Black Trees & AA trees |
Balanced Search Trees
CP: Chap 12 (p. 541-578) |
|
| 11 | Cor: Chap 11 Rosen: Chap 6.1-6.4 |
Hash tables Graph Theory (2) |
Hashing
CP: Chap 12 (p. 578-597) |
|
| 12 | 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) |
|
| 13 | Cor: Sect 24.2-3 Cor: Chap 25 Rosen: Chap 7 |
Single Source Shortest Path Floyd & Warshall's algorithms(4) |
Shortest Paths Circuits CP: Chap 13 (p. 633-642) |
|
| 14 | Cor: Chap 34 | NP-Completeness Final Exam |