Course Schedule

Weekday Regular Schedule

Group Type Hours Location Lecturer
01 Lecture Tue 15-18 Dan David 001 Noga/Rani
02 Recitation Wed 15-16 Kaplun 118 Ophir
03 Recitation Thu 12-13 Shenkar 222 Alon
04 Recitation Thu 14-15 Shenkar 104 Alon
05 Recitation Thu 15-16 Shenkar 105 Ophir

Tentative schedule

Week # Starts on Lecture Topics Book Ch. Recitation Topics Notes
1 1.11 BFS (N) CLRS 22.1-2 Eulerian cycles and paths
2 8.11 DFS (N) CLRS 22.3 | Bipartite graphs and BFS
3 15.11 DFS applications (N) CLRS 22.4-5 DFS and bi-connected components
4 22.11 MSTs (R) CLRS 23 ( + 21.1-2) MSTs
5 29.11 Bellman-Ford (N) CLRS 24.0-2,5 Bellman-Ford
6 6.12 Dijkstra (N) CLRS 24.3 Dijkstra
7 13.12 All pairs shortest paths (N) CLRS 25 All pairs shortest paths
8 20.12 Network flow 1 (R) CLRS 26.1-2 Flow
9 27.12 Network flow 2 (R) CLRS 26.2-3 More network flow
10 3.1 Network flow 3 (R) T 8.2-3 Hall's theorem and Advanced network flow
11 10.1 Linear Programming 1 (N) CLRS 29 Linear programming
12 17.1 Linear Programming 2 (N) CLRS 29 Linear programming
13 24.1 Dynamic programming (N) CLRS 15 + KT 6 Dynamic programming

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.

Cancelled classes — Tentative:

Day Date Time Location Type
Wednesday 4/1 15-16 Recitation
Thursday 5/1 12-13 Recitation
Thursday 5/1 15-16 Recitation

Make up Classes

Day Date Time Location Type
Friday 6/1 9-10 Ornstein 103 Recitation
Friday 6/1 11-12 Ornstein 103 Recitation
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License