Course Schedule

Weekday Regular Schedule

Group Type Hours Location Lecturer
01 Lecture Sun 12-15 Naftali 110 Amos
02 Lecture Tue 16-19 Dan David 001 Ron
03 Recitation Wed 17-18 Ornstein 111 Ophir
04 Recitation Thu 09-10 Shenkar 204 Ophir
05 Recitation Thu 10-11 Shenkar 204 Ophir
06 Recitation Thu 11-12 Kaplun 118 Tal
06 Recitation Thu 13-14 Holzblat 007 Tal

Course Outline

Week # Starts on Lecture Topics Book Ch. Recitation Topics Notes
1 4/3 Introduction, BFS CLRS 22.1-2 Eulerian cycles and paths
2 11/3 DFS CLRS 22.3 Bipartite graphs and BFS
3 18/3 DFS applications CLRS 22.4-5 DFS and bi-connected components No lectures or recitations next week.
4 8/4 MSTs CLRS 23 (+ 21.1-2) MSTs
5 15/4 Dynamic programming CLRS 15 + KT 6 Dynamic programming Makeup recitation on Friday 20/04 – all groups. Tuesday class will end at 18, students who wish not to miss any material should attend the Sunday class.
6 22/4 Bellman-Ford CLRS 24.0-2,5 Bellman-Ford
7 29/4 Dijkstra CLRS 24.3 Dijkstra
8 6/5 APSP CLRS 25 APSP
9 13/5 Linear Programming 1 CLRS 29 Linear programming Friday – 18/05, makeup lecture for Sunday group.
10 20/5 Linear Programming 2 CLRS 29 Linear programming No lecture on Sunday (20/05).
11 27/5 Network flow 1 CLRS 26.1-2 Flow Yom HaStudent on Thursday – no classes after 12. Students of the cancelled recitation are requested to come to one of the other recitations.
12 3/6 Network flow 2 (MFMC, EK) CLRS 26.2-3 More network flow
13 10/6 Network flow 3 (Dinic) 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