Assignments are either Homework Assignments or Reading Assignments.
You may pick them up from your account in NYU Classes.
Click HERE to see comments and clarifications on the homework questions (starting from hw5).
We encourage you to read ahead of lectures (you don't have to read the whole chapter, just go as far as you can, in order to mentally prepare for the topics). Usually, only the initial sections of a chapter is needed -- below we give some additional guide. Note that some files are not yet available.
|Topic||Title||File||Reading Assignment||No. Lectures|
|1||Introduction to Algorithmics||l1_BASE.pdf||Read the non-starred sections lightly; focus on Sect. 7||1|
|2||Recurrences||l2_BASE.pdf||Read up to Section 10 (Multiterm Master Theorem)||3|
|3||Balanced Search Trees||l3_BASE.pdf||Read up to Sect. 8 ((a,b)-Trees)||2|
|4||Pure Graph Algorithms||l4_BASE.pdf||Focus on biconnectivity (Para.30) and strong components (Para.38)||2|
|5||The Greedy Approach||l5_BASE.pdf||Focus on Sects.1,2,3,4,5 (Joy Ride, Coin Change, Intervals, Huffman, MST)||2|
|6||Amortization||l6_BASE.pdf||Splay Analysis and Fibonacci heaps||2|
|7||Dynamic Programming||l7_BASE.pdf||Focus on Sects.2,3,4,5,7.||2|
|8||Probabilistic Algorithms||l8_BASE.pdf||Focus on Sects.15-21. (Use rest of chapter for reference)||4|
|9||Hashing||l11_BASE.pdf||Focus on Sects.1,4,5,6 (Highlight is the FKS scheme).||2|
|10||Disjoint Sets||l13_BASE.pdf||Focus on Sects.1 to 4.||2|
|11||Min Cost Paths||l14_BASE.pdf||Read chapter but focus on lecture topics||2|
|X||Guest Lecture||mystery.pdf Δ||1|
|12||NP-Completeness and beyond||l30_BASE.pdf||2|