Date |
Day |
Lecture |
Topics |
Labs |
1/3/18 |
Wed |
1 |
Introduction to 162 and C |
Lab 0 out |
1/5/18 |
Fri |
2 |
Recursion |
|
1/8/18 |
Mon |
3 |
Arrays |
|
1/10/18 |
Wed |
4 |
Pointers I |
|
1/12/18 |
Fri |
5 |
Pointers II |
Lab 0 due, Lab
1 out |
1/15/18 |
Mon |
Holiday |
MLK |
|
1/17/18 |
Wed |
6 |
Common C Bugs |
|
1/19/18 |
Fri |
7 |
Dictionaries and Trees; 4.1-4.3 |
Lab 1 due, Lab
2 out |
1/22/18 |
Mon |
8 |
AVL Trees; 4.4. |
|
1/24/18 |
Wed |
9 |
Hashing I; 5.1-5.2. |
|
1/26/18 |
Fri |
10 |
Hashing II; 5.3-5.6. |
|
1/29/18 |
Mon |
11 |
Disjoint Sets and the UNION-FIND ADT; 8.1-8.3. |
|
1/31/18 |
Wed |
12 |
Implementing the UNION-FIND ADT; 8.4-8.5; 8.7. |
|
2/2/18 |
Fri |
13 |
UNION-FIND (conclusion) |
Lab 2 due, Lab
3 out |
2/5/18 |
Mon |
14 |
Priority Queues and Binary Heaps; 6.1-6.4. |
|
2/7/18 |
Wed |
15 |
Introduction to Graphs; 9.1. |
|
2/9/18 |
Fri |
Holiday |
College Break |
|
2/12/18 |
Mon |
Exam 1 |
|
|
2/14/18 |
Wed |
16 |
Topological Sorting, Graph Traversal; 9.2. |
|
2/16/18 |
Fri |
17 |
Minimum Spanning Trees with Kruskal's Algorithm; 9.5. |
Lab 3 due, Lab
4 out |
2/19/18 |
Mon |
18 |
Finding Shortest Paths in a Graph with Dijkstra's Algorithm; 9.3. |
|
2/21/18 |
Wed |
19 |
Comparison Sorting; 7.1-7.6. |
|
2/23/18 |
Fri |
20 |
Beyond Comparison Sorting; 7.11. |
|
2/26/18 |
Mon |
21 |
Algorithm Design Paradigms; 10.1, 10.1.1. |
|
2/28/18 |
Wed |
22 |
Divide-and-Conquer and the FFT. 10.2, 10.2.1. |
|
3/2/18 |
Fri |
23 |
Future of computing |
Lab 4 due |
3/5/18 |
Mon |
24 |
C++ |
|
3/7/18 |
Wed |
Exam 2 |
|
|
|
|
|