Course Schedule

Schedule

Regular Classes

Group Type Hours Location Lecturer
01 Lecture Tue 15-18 Check Point 001 Rani
02 Recitation Thu 12-13 Ornstein 103 Jad
03 Recitation Thu 14-15 Check Point 002 Tal
04 Recitation Wed 15-16 Dan David 205 Tal
05 Recitation Thu 15-16 Check Point 003 Jad

Cancelled Classes

Day Date Type Reason
Tue 12.11 Lecture Rockets from Gaza strip

Make up Classes

Day Date Time Location Type
Fri 15.11 9-12 Checkpoint 1 Lecture

Outline (Tentative)

Week # Starts on Lecture Topics Book Chapter Recitation Topics Notes
1 27.10 Introduction, Breadth first search CLRS 22.1-2 Eulerian cycles and paths
2 03.11 Depth first search CLRS 22.3 Bipartite graphs and BFS
3 10.11 Applications of DFS CLRS 22.4-5 DFS and bi-connected components
4 17.11 Minimum spanning trees CLRS 23 (+ 21.1-2) MSTs
5 24.11 Dynamic programming CLRS 15 + KT 6 Dynamic programming
6 01.12 Shortest paths 1 (Bellman-Ford) CLRS 24.0-2,5 Bellman-Ford
7 08.12 Shortest paths 2 (Dijkstra, DAGs) CLRS 24.3 Dijkstra
8 15.12 All pairs shortest paths CLRS 25 APSP
9 22.12 Linear Programming 1 (simplex) CLRS 29 Linear programming
10 29.12 Linear Programming 2 (duality) CLRS 29 Linear programming
11 05.01 Network flow 1 CLRS 26.1-2 Flow
12 12.01 Network flow 2 (MFMC, EK) CLRS 26.2-3 More network flow
13 19.01 Network flow 3 (Dinic) T 8.2-3 Hall's theorem and advanced network flow

CLRS refers to the 3rd (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