Course Schedule

Weekday Regular Schedule

Group Type Hours Location Lecturer
01 Lecture Tue 16-19 Dan David 001 Ron/Amos
02 Lecture Sun 12-15 Dan David 001 Ron/Amos
03 Recitation Wed 17-18 Ornstein 111 Alon
04 Recitation Thu 09-10 Schreiber 008 Ophir
05 Recitation Thu 10-11 Shenkar 204 Ophir
06 Recitation Thu 11-12 Shenkar 204 Alon
07 Recitation Thu 13-14 Schreiber 007 Ophir

Tentative schedule

Week # Starts on Lecture Topics Book Ch. Recitation Topics Notes
1 12.03 Eulerian cycles and paths
2 19.03 BFS (R) CLRS 22.1-2 Bipartite graphs and BFS
3 26.03 DFS (A) CLRS 22.3 | DFS and bi-connected components
4 02.04 DFS applications (A) CLRS 22.4-5
5 23.04 MSTs (R) CLRS 23 ( + 21.1-2) MSTs
6 30.04 Dynamic programming (R) CLRS 15 + KT 6 Dynamic programming
7 07.05 Bellman-Ford (A) CLRS 24.0-2,5 Bellman-Ford
8 14.05 Dijkstra (A) CLRS 24.3 Dijkstra
9 21.05 All pairs shortest paths (A) CLRS 25 All pairs shortest paths
10 28.05 Linear Programming 1 (R) CLRS 29 Linear programming
11 04.06 Linear Programming 2 (R) CLRS 29 Linear programming
12 11.06 Network flow 1 (R) CLRS 26.1-2 Flow
13 18.06 Network flow 2 (A) CLRS 26.2-3 More network flow
14 25.06 Network flow 3 (A) T 8.2-3 Hall's theorem and Advanced network flow

(R) classes will be taught by Ron
(A) classes will be taught by Amos

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 Type
Tuesday 2.5 Lecture
Tuesday 30.5 Lecture
Sunday 25.6 Lecture

Make up Classes

Day Date Time Location Type
Friday 28.4 09:00 - 12:00 דאך 005 Lecture
Friday 26.5 09:00 - 12:00 דן דוד 001 Lecture
Friday 23.6 09:00 - 12:00 דאך 005 Lecture
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License