Course Schedule

Weekday Regular Schedule

Group Type Hours Location Lecturer
01 Lecture Tue 15-18 Dach 005 Rani
02 Recitation Wed 15-16 Schreiber 008 Alon/Ophir
03 Recitation Thu 12-13 Shenkar 222 Alon/Ophir
04 Recitation Thu 14-15 Shenkar 104 Alon/Ophir
05 Recitation Thu 15-16 Schreiber 008 Alon/Ophir

Course Outline

Week # Starts on Lecture Topics Book Ch. Recitation Topics Notes
1 22.10 Introduction, BFS CLRS 22.1-2 Eulerian cycles and paths
2 29.10 DFS CLRS 22.3 Bipartite graphs and BFS
3 5.11 DFS applications CLRS 22.4-5 DFS and bi-connected components
4 12.11 MSTs CLRS 23 (+ 21.1-2) MSTs
5 19.11 Dijkstra CLRS 24.3 Dijkstra
6 26.11 Bellman-Ford CLRS 24.0-2,5 Bellman-Ford
7 3.12 Dynamic programming CLRS 15 + KT 6 Dynamic programming
8 10.12 All pairs shortest paths CLRS 25 All pairs shortest paths
9 17.12 Linear Programming 1 CLRS 29 Linear programming
10 24.12 Linear Programming 2 CLRS 29 Linear programming
11 31.12 Network flow 1 CLRS 26.1-2 Flow
12 7.1 Network flow 2 CLRS 26.2-3 More network flow
13 14.1 Network flow 3 T 8.2-3 Hall's theorem and Advanced network flow

CLRS refers to the 2nd (English) edition of the book "Introduction to Algorithms" by Cormen, Leiserson, Rivest, and Stein.
T refers to "Data Structures and Network Algorithms" by Tarjan.
KT refers to "Algorithm Design", by J. Kleinberg and E. Tardos.

The material taught in class is not necessarily identical to the material in the book.

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License