Lecture Dates |
Book Sections |
Comments |
08-27, 08-29 |
1.1, 2.1, 2.2 |
|
09-03, 09-05 |
2.2, 2.4, 5.1, 5.2 |
These sections from Chapter 2 give a *very* loose overview of the
topic. We are quite a bit more rigorous in class. If you are interested in
seeing this topic developed carefully and rigorously, I suggest Ch. 9 of
Concrete Mathematics by Graham, Knuth, and Patashnik. |
09-10, 09-12 |
5.3, 5.4 |
We will be covering the Master Thorem
[wiki]
in class, so please read about it beforehand. |
09-17, 09-19 |
5.4, 5.5 |
|
09-24, 09-26 |
6.1, 6.2 |
|
10-01, 10-03 |
6.2, 6.3 |
Exam 1 is scheduled for 10-01. |
10-08, 10-10 |
6.3, 6.4 |
We'll also be covering the matrix chain multiplication problem
[wiki]. |
10-17 |
3.1, 3.2 |
Prof. Zhong will be leading this lecture. |
10-22, 10-24 |
3.2, 3.4, 3.5 |
You may want to read about directed acyclic graphs on Wikipedia
[wiki]. |
10-29, 10-31 |
3.4, 3.5, 3.6 |
|
11-05, 11-07 |
4.4, 4.5 |
Dijkstra's algorithm is quite famous. You can read more about it on
Wikipedia
[wiki]. |
11-12, 11-14 |
4.5 |
Exam 2 is on 11-12. Here are some good additional resources on the
Minimum Spanning Tree problem and Prim's and Kruskal's algorithms:
[wiki]
[wiki]
[wiki]. |
11-19, 11-21 |
4.6, 4.1 |
Exam 2 will be handed back on 11-19. Please be aware that 11-20 is the
last day to drop. |
11-26 |
4.1, 4.2 |
|
12-03, 12-05 |
4.8, 8.1, 8.2 |
Huffman coding
[wiki]
and the complexity classes P
[wiki]
and NP
[wiki]
might be unfamiliar topics, so please read about them before class.
|
12-10, 12-12 |
8.3, 8.4 |
We will go over what material is covered on the final on 12-12, so be
sure to attend class that day. |
12-16 |
|
The final exam will be held 1:30pm – 4pm in our usual classroom. |