Another HW3 update!
Sorry for the inconvenience, but Q2 still contained a problem, I fixed it, so make sure you're working with the most updated version.
Ohad's Reception hour time is changed
This week (15.6), Ohad's reception hour will move from 12:30 (before the tutorial) to 14:30 (after the tutorial).
There was a typo in the phrasing of Farkas lemma in Q4 (instead of y^tA>=0 there was y^tA=0). The file has been updated, thanks to Michael for pointing it out.
HW3 is online!
|Due date is Thursday 22.6.17 at 23:59. Please submit either electronically or to Ohad's Mail box at the 5th floor.|
HW2 submission is postponed!
The submission of HW2 is postponed from tomorrow (1.6) to Sunday(4.6). The change is due to some of you that asked for your checked HW1 before the submission of HW2 (Ohad will return HW1 at class).
Lecture instead of tutorial
Today's (11.5 13:30-14:30) tutorial will be replaced by an additional lecture.
Ohad's reception hour is also cancelled today.
HW2 is online!
|Due date is June 1st, at 23:59. |
Submission is in Pairs, and you can submit either electronic copy or hard copy to Ohad's box at the 5th floor [in both cases make sure that you have a copy of your homework].
Complementary Lecture instead of tutorial
Tomorrow tutorial is canceled and instead there will be a complementary lecture (13:30-14:30) by Seffi in addition to the regular lecture time.
In question 2, there has been a mistake in the phrasing of the question. In each part, you should find an infinite non-trivial family of graphs Gn that apply the inequality as equality. I.e. For each n, Gn has Omega(n) vertices and Omega(n) edges.
Lecture instead of tutorial (again)
Tomorrow (20/4), there will be a lecture instead of the tutorial (13:30-14:30) in addition to the morning lecture.
HW1 is online!
|Due date by 27.4, submission in pairs.|
Submission could be either electronic or hard copy to Ohad's cell on the 5th floor.
Guest Lecture and more...
This week (6/4) there will be a guest lecture by Gilad Kutiel. The lecture topic will be Edmonds algorithm for finding maximum matchings.
The lecture will take place at Taub 6 as usual at 10:30-11:30.
Instead of the second part of the lecture, there will be an additional tutorial, which means that there will be two hours of tutorial this week (11:30-12:30, 13:30-14:30).
In addition, the first assignment is expected to be published by the end of the week, and the is expected to be due two weeks after Passover vacation.
Have a good day,
Lecture instead of tutorial
Seffi will hold another lecture hour, tomorrow (30/3) at 13:30-14:30 instead of the tutorial.
Welcome to Algorithms 2!
|Next week (23/3) Tutorial will be a review for the last part of Algorithms 1 course, so it will take place in 10:30 instead of 13:30. The lecture will take place right after- 11:30-13:30.|
If you have any problem attending to the second hour (12:30-13:30) please contact Ohad and we will try to come up with a solution.
Next week the tutorial will take place as usual at 13:30, and the lecture at 10:30-12:30.
Tutorial 1 has already been uploaded under 'Course Materials'.