||Lecture 14: Divide and
conquer. Introduction to dynamic programming.
Lecture notes 7.
|Sections 5.4 and 6.2.
||Snow day (again!)
Lecture 13: Divide and conquer
Lecture notes 6: divide and conquer
Due: 3/19 end of day.
Lecture 12: Divide and conquer. Master theorem.
Notes on Master Theorem.
||Lecture 11: greedy algorithm;
divide and conquer
Lecture 10: greedy algorithm for Huffman coding (sect. 4.8)
Lecture notes 5: greedy algorithms.
|Chapters 4 and 5.
Due: 2/26 end of day. Note: no extension will be given
because I need to post solution before the exam 1.
||Lecture 9 (make up lecture):
greedy algorithms for coin change, interval scheduling
(sect. 4.1) and scheduling to minimize maximum lateness
Lecture 8: DFS and applications.
Lecture 7: Bipartite graph. DFS.
Lecture notes 4: greedy algorithm.
|Chapters 3 and 4.
Due: 2/19 end of day.
||Lecture 6: Snow day.
Lecture 5: Heap. Graph BFS.
Lecture notes 3. Read Section 3.4 for bipartite graph.
||Lecture 4: Common running
Lecture 3: Asymptotic notations
Lecture notes 2.
Notes on heap (see the end of the second page).
Due: 2/7 end of day.
Lecture 2: Basics of algorithm analysis.
Lecture 1: Basic concepts of algorithms. Stable matching problem: a motivating example.
Lecture notes 1 (from previous offering of this course): please note lecture topics will be similar with previous offering of this course. So I often will re-use the lecture notes.
Chapters 1 and 2 of the textbook.
We discussed insertion sort in the class. Check out these slides which contain detailed explanation on insertion sort.
HW1. Due: 1/29 end of day.
Note: submit electronically to HuskyCT.
||No class (snow day)