Reading Assignments

From S. Dasgupta, C. Papadimitriou, U. Vazirani's, Algorithms

• Reading for Weeks of August 25th and September 1st: Importance of Efficient Algorithms and Algorithm Analysis, Review of Big-O Notation (Chapter 0), Arithmetic Operations (Section 1.1), Mergesort (Section 2.2, 2.3)
• Reading for Week of September 8th: Integer Multiplication, Finding Medians, Matrix Multiplication, Fast Fourier Transform (Sections 2.1, 2.4, 2.5, 2.6)
• Reading for Week of September 15th: Data Structures for Greedy Algorithms, Binary Heaps, Paths in Graphs, Breadth-First Search, Dijkstra's algorithm, Disjoint Set Data Structure, Minimum Spanning Trees (Sections 4.1-4.5, 5.1)
• Reading for Week of September 22nd: 0-1 Knapsack, Edit Distance, Matrix-Chain Multiplication, Shortest paths in DAG's (Sections 6.1-6.6)
• Reading for Week of October 3rd: Ford-Fulkerson Algorithm for finding a maximum flow in a network (Section 7.2)
• Reading for Week October 27th: Search Problems, NP-Complete Problems (8.1, 8.2)