Policy
Time and Place
Further Reading
Announcements
Assignments
Solutions
Grades
Links
·
For
your benefit, when working on exercises, it is allowed to consult with each
other, but eventually, each student must write the answers independently and on
his own. Every other option will be considered as plagiarism. Plagiarism (including
not writing individually) will be dealt with severely.
·
All
mail correspondence regarding the recitation must be sent to the course
address, i.e. algorithms1.biu@gmail.com. E-mails sent to
any other address will not be answered.
·
It
is students' responsibility to get updated on the contents of this page. All
information posted on this page is assumed to be acknowledged by the students.
|
Event No. |
Day |
Time |
Place |
Teacher |
|
89-220-01 |
Monday |
16:00 - 19:00 |
403 - 101 |
Prof. Moshe Lewenstein |
|
89-220-02 |
Wednesday |
12:00 - 15:00 |
604 - 102 |
Prof. Moshe Lewenstein |
|
89-220-03 |
Thursday |
12:00 - 14:00 |
105 - 103 |
Neta Barkay |
|
89-220-04 |
Thursday |
16:00 - 18:00 |
105 - 105 |
Tsvi Kopelowitz |
|
89-220-05 |
Wednesday |
15:00 - 17:00 |
105 - 002 |
Neta Barkay |
|
89-220-06 |
Thursday |
18:00 - 20:00 |
105 - 105 |
Tsvi Kopelowitz |
· Prim MST
·
31.1.12
– Hw13 is online.
·
30.1.12
– Please bring ex4-5,8-11 to recitation.
·
26.1.12
– Grades for ex1-7 are online.
·
26.1.12
– The Gomory-Hu example from recitation can be found here (slides 24-35).
Please note that the rest of the slides are not exactly as shown in the recitation.
·
26.1.12
– Hw12 is online.
·
20.1.12
– Hw11 is online.
·
15.1.12
– Reminder: Please bring ex1-9 to the lectures on Monday & Wednesday.
·
12.1.12
– Hw10 is online.
·
5.1.12
– Hw9 is online.
·
30.12.11
– Hw8 is online.
·
27.12.11
– Please bring ex1-4 to class.
·
22.12.11
– Update regarding q.1 HW7: The definition should be: a graph is k-colorable if there is a legal coloring that uses k colors.
·
21.12.11
– Hw7 is online.
·
20.12.11
– The recitations on 21-22/12/11 are canceled. Happy Hanukkah!
·
9.12.11
– Update regarding q.1 HW6: The time complexity of your algorithm should be O(n*(log(n))^2).
·
8.12.11
– Hw6 is online.
·
2.12.11
– Note that when proving optimality of a greedy algorithm, you should prove the greedy choice property and the optimal substructure property.
·
1.12.11
– Hw5 is online.
·
24.11.11
– Hw4 is online.
·
21.11.11
– Important note about exercise 3 - the process for dynamic programming should be done for questions 2, 3, and 4 (not only 2 and 3). The proof needs to be given only for 3 and 4.
·
16.11.11
– Hw3 is online.
·
10.11.11
– The rest of recitation for 89-220-05 will be on Sunday 10/11/11 at 8:00, building 105 room 001.
·
9.11.11
– Hw2 is online.
·
7.11.11
– Recitation for group 89-220-05 will not be on Monday. Please join the other groups on Thursday.
For those who can't, there will be fast recitation on Wednesday at 16:00.
·
6.11.11
– Because of Rabin's memorial day, recitation for group 89-220-05 is canceled.
Students can join other groups, or come to recitation on Monday 14/11/11 in department hours.
·
6.11.11
– Update regarding q.5 HW1: the statement is valid for the case that the array A has a majority-element.
The question remains the same: you still need to determine if there is a majority-element and what is its value.
·
2.11.11
– Hw1 is online. Please read the course policy carefully.
·
27.10.11
– Good luck in the
upcoming semester!
· HW1
· HW2
· HW3
· HW4
· HW5
· HW6
· HW7
· HW8
· HW9
· HW10
· HW11
· HW12
· HW13