Module | Date | Logistics | Preparation | Notes | Assigned | Due | ||||
---|---|---|---|---|---|---|---|---|---|---|
0. Introduction
|
10 |
|
Lecture |
|
|
|||||
50 |
|
Activity | |
|
Activity 0 | Activity 0 | ||||
1. Lists, Queues, & Stacks
|
10 |
|
Lecture |
|
|
|||||
50 |
|
Activity | |
|
Lab 1 | |||||
2. Priority Queues
|
10 |
|
Lecture |
|
|
|||||
50 |
|
Activity | |
|
Lab 2 | |||||
3. Asymptotic Complexity
|
10 |
|
Lecture |
|
|
|||||
50 |
|
Activity | |
|
Homework 3 (pdf) |
|||||
4. Recurrences I
|
10 |
|
Lecture |
|
|
|||||
50 |
|
Activity | |
|
Homework 4 (pdf) |
Lab 1 | ||||
5. Recurrences II
|
10 |
|
Lecture |
|
|
Homework 3 (pdf) |
||||
60 |
|
Exam Review |
|
|
Lab 2 | |||||
75 |
|
Exam | |
|
Homework 4 (pdf) |
|||||
6. Shortest Path
|
10 |
|
Lecture |
|
|
|||||
50 |
|
Activity | |
|
Lab 6 | |||||
7. Sorting
|
10 |
|
Lecture |
|
|
|||||
50 |
|
Activity | |
|
Lab 7 | |||||
8. Hash Tables
|
10 |
|
Lecture |
|
|
|||||
50 |
|
Activity | |
|
Lab 8 | |||||
9. Disjoint Sets
|
10 |
|
Lecture |
|
|
Lab 6 | ||||
50 |
|
Activity | |
|
||||||
10. Traversing Trees & Graphs
|
10 |
|
Lecture |
|
|
Lab 7 | ||||
50 |
|
Activity | |
|
Homework 10 (pdf) |
|||||
11. Balanced Trees
|
10 |
|
Lecture |
|
|
Lab 8
Homework 10 (pdf) |
||||
60 |
|
Exam Review |
|
|
||||||
75 |
|
Exam | |
|