Exam B scans and final grades available
|Exam B scans and final grades are available online.|
The final grades were calculated according to the following formulae:
ExamBwithHW = ExamB*0.85+HW_AVG*0.15;
finalB = ExamBwithHW < 54? min(54 , ExamBwithHW ) : ExamBwithHW + 12;
Appeals should be sent electronically directly to David (exam scan + the content of the appeal), no later than 31/10.
Wishing you a fruitful semester and good luck with the rest of your studies,
|פורסם ב- 17/10/2010, 13:45:52 Created on 17/10/2010, 13:45:52 Создано 17/10/2010, 13:45:52 تم النشر ب- 17/10/2010, 13:45:52|
Reception Hour Before Moed B
|I will hold a reception hour before the moed B on Tuesday, 18:00, in my office (Taub 207).|
|פורסם ב- 3/10/2010, 18:04:05 Created on 3/10/2010, 18:04:05 Создано 3/10/2010, 18:04:05 تم النشر ب- 3/10/2010, 18:04:05|
Final Grade factor
|To clarify, the final grade was calculated according to the following formula:|
ExamAwithHW = ExamA*0.85+HW_AVG*0.15;
finalA = ExamA < 50? min(54 , ExamAwithHW ) : ExamAwithHW + 12;
Note that according to the syllabus, a grade below 55 in the exam would result in a failing grade in the course, whereas according to the above formula a grade below 50 would result in a failing grade.
|פורסם ב- 27/9/2010, 23:35:52 Created on 27/9/2010, 23:35:52 Создано 27/9/2010, 23:35:52 تم النشر ب- 27/9/2010, 23:35:52|
Exam A scans and final grades
|Exam scans can now be found online, as can your final grades, under "FinalA" in the grades system.|
Appeals should be sent electronically directly to me (exam scan + the content of the appeal), no later than 11/10. If you plan to take the Moed B but plan to appeal, you are advised to do so quickly and specify in your mail that you are taking the Moed B, so your appeal can be processed quickly.
Good luck in the rest of your exams and Hag Sameach,
|פורסם ב- 27/9/2010, 19:35:22 Created on 27/9/2010, 19:35:22 Создано 27/9/2010, 19:35:22 تم النشر ب- 27/9/2010, 19:35:22|
One more reception hour before the exam
|As discussed in class, David will hold a reception hour on Monday, between 14:00-15:00.|
A classroom for the reception hour is yet to be decided and, unless announced otherwise, it will take place in David's office (Taub 207).
Good Luck on Tuesday,
|עדכון אחרון ב- 11/9/2010, 21:13:02 Last updated on 11/9/2010, 21:13:02 Последняя модификация 11/9/2010, 21:13:02 تمت الحتلنة الأخيرة ب- 11/9/2010, 21:13:02|
Correction to reference page
|The reference pages (דף לבחינה) had a small error: if g:V->N is a topological ordering of G=(V,E), then if (i,j)\in E then g(i)<g(j), and not if and only if, as was stated. |
The pages were corrected and can be found under Course Material.
Well done to Ido for noticing the error.
|עדכון אחרון ב- 8/9/2010, 10:15:30 Last updated on 8/9/2010, 10:15:30 Последняя модификация 8/9/2010, 10:15:30 تمت الحتلنة الأخيرة ب- 8/9/2010, 10:15:30|
Assignment 6 Published
|The sixth (and last) assignment for this semester has been published and can be found under "Assignments".|
Due date: 15/09/2010.
Please note: the submission for this assignment will be electronic, and not to David's cell.
We remind students who have not gotten a passing grade for at least 4 assignments that doing so is a necessary condition for passing the course, and urge them to take this into account.
|עדכון אחרון ב- 6/9/2010, 21:10:03 Last updated on 6/9/2010, 21:10:03 Последняя модификация 6/9/2010, 21:10:03 تمت الحتلنة الأخيرة ب- 6/9/2010, 21:10:03|
Assignment 4 grades available
|Please read the remarks carefully to avoid losing unnecessary points in future assignments and the exam.|
|עדכון אחרון ב- 6/9/2010, 21:09:41 Last updated on 6/9/2010, 21:09:41 Последняя модификация 6/9/2010, 21:09:41 تمت الحتلنة الأخيرة ب- 6/9/2010, 21:09:41|
Preparation for the Exam lesson
|The lesson tomorrow will Take place in Taub 4.|
|פורסם ב- 6/9/2010, 15:43:13 Created on 6/9/2010, 15:43:13 Создано 6/9/2010, 15:43:13 تم النشر ب- 6/9/2010, 15:43:13|
|The front page of the Moed A along with the reference pages ("dapei ezer") that will be given during the exam can now be found under "Course Material".|
We suggest you read them carefully now, to save time during the exam.
|עדכון אחרון ב- 6/9/2010, 09:21:43 Last updated on 6/9/2010, 09:21:43 Последняя модификация 6/9/2010, 09:21:43 تمت الحتلنة الأخيرة ب- 6/9/2010, 09:21:43|
Clarification concerning question 2 of assignment 5
|In the above question, e is the only edge with odd capacity.|
|פורסם ב- 2/9/2010, 18:45:04 Created on 2/9/2010, 18:45:04 Создано 2/9/2010, 18:45:04 تم النشر ب- 2/9/2010, 18:45:04|
Some more announcements
|Assuming your mail's spam detectors still allow you to receive mail from the course website..|
Here's a recap of announcements made in class today:
1) As the first exam will take place before the due date of the 6th assignment, we will not consider the best 5 assignments' average to be your HW grade, but the best 4 assignments' grades' average.
2) To prepare for the studying period, we will have an extra lesson on Tuesday, 07/09, 17:00-19:00 (classroom will be announced later).
During this extra lesson, David will solve (or at least give the general direction to solve) an exam.
3) Another reception hour will take place on the 13th (a day before the exam), as will reception hours of the Spring Semester's course. We encourage you to attend at least one of these.
|פורסם ב- 30/8/2010, 20:27:26 Created on 30/8/2010, 20:27:26 Создано 30/8/2010, 20:27:26 تم النشر ب- 30/8/2010, 20:27:26|
Hint for question 5 of assignment 4
|We urge you to notice the fact any cut with infinite-capacity edge(s) is not a minimum cut (assuming there exists a finite-capacity cut).|
Use this to force only particular cuts to be minimum cuts.
|פורסם ב- 30/8/2010, 20:18:43 Created on 30/8/2010, 20:18:43 Создано 30/8/2010, 20:18:43 تم النشر ب- 30/8/2010, 20:18:43|
Assignment 5 Published
|The fifth assignment for this semester has been published and can be found under "Assignments".|
Due date: 08/09/2010. Note that a second assignment will be published on 06/09/2010.
Please note: the submission for this assignment will be electronic, and not to David's cell.
|פורסם ב- 30/8/2010, 20:15:24 Created on 30/8/2010, 20:15:24 Создано 30/8/2010, 20:15:24 تم النشر ب- 30/8/2010, 20:15:24|
Clarification and correction to question 4 of assignment 4
|Here are to corrections and clarification regarding question 4 in the 4th assignment:|
- The change proposed by Tzvi is to add *the absolute value* of the arc with the smallest negative weight (obviously adding a negative value to all edge weights would not even make the weight function non-negative).
- In section c, you are asked to modify Johnson's algorithm, as seen in class, to be able to recognize negative-weight cycles in the graph (in which case the algorithm may terminate with some error message of your choice).
|פורסם ב- 29/8/2010, 23:17:47 Created on 29/8/2010, 23:17:47 Создано 29/8/2010, 23:17:47 تم النشر ب- 29/8/2010, 23:17:47|
Assignment 4 Published
|The fourth assignment for this semester has been published and can be found under "Assignments".|
Due date: 01/09/2010. Note that a second assignment will be published on 30/08/2010.
|עדכון אחרון ב- 23/8/2010, 22:26:37 Last updated on 23/8/2010, 22:26:37 Последняя модификация 23/8/2010, 22:26:37 تمت الحتلنة الأخيرة ب- 23/8/2010, 22:26:37|
Assignment 2 grades available
|Please read the remarks carefully to avoid losing unnecessary points in future assignments|
|עדכון אחרון ב- 23/8/2010, 22:22:50 Last updated on 23/8/2010, 22:22:50 Последняя модификация 23/8/2010, 22:22:50 تمت الحتلنة الأخيرة ب- 23/8/2010, 22:22:50|
Lecture slides added to the course site
|Basic max flow lecture slides are now online, and can be found under Lectures/Max Flow - Basic Lecture.|
|עדכון אחרון ב- 22/8/2010, 22:35:46 Last updated on 22/8/2010, 22:35:46 Последняя модификация 22/8/2010, 22:35:46 تمت الحتلنة الأخيرة ب- 22/8/2010, 22:35:46|
Correction to Assignment 3, question 5
|In question 5 of assignment 3, the graph was stated to have no cycles, making the question trivial. The graph can, of course, have cycles.|
A corrected assignment 3 was uploaded.
|פורסם ב- 18/8/2010, 18:38:56 Created on 18/8/2010, 18:38:56 Создано 18/8/2010, 18:38:56 تم النشر ب- 18/8/2010, 18:38:56|
Assignment 3 Published
|The third assignment for this semester has been published and can be found under "Assignments".|
Due date: 25/08/2010. Note that a second assignment will be published on 23/08/2010.
|עדכון אחרון ב- 16/8/2010, 18:58:32 Last updated on 16/8/2010, 18:58:32 Последняя модификация 16/8/2010, 18:58:32 تمت الحتلنة الأخيرة ب- 16/8/2010, 18:58:32|
Assignment 1 grades available
|As discussed in class, a 9 point factor was given for the assignment.|
Please read the remarks carefully to avoid losing unnecessary points in future assignments
|פורסם ב- 16/8/2010, 18:57:51 Created on 16/8/2010, 18:57:51 Создано 16/8/2010, 18:57:51 تم النشر ب- 16/8/2010, 18:57:51|
Bonus for assignment 1
|A loophole was found in the phrasing of question 5 in assignment 1.|
To keep the question interesting enough for there to be room to learn from, a 5 point bonus will be given to the students who solve question 5 assuming they get the graph in adjacency matrix representation.
|פורסם ב- 9/8/2010, 19:21:30 Created on 9/8/2010, 19:21:30 Создано 9/8/2010, 19:21:30 تم النشر ب- 9/8/2010, 19:21:30|
Assignment 2 Published
|The second assignment for this semester has been published and can be found under "Assignments".|
Due date: 18/08/2010. Note that a second assignment will be published on 16/08/2010.
|פורסם ב- 9/8/2010, 19:08:35 Created on 9/8/2010, 19:08:35 Создано 9/8/2010, 19:08:35 تم النشر ب- 9/8/2010, 19:08:35|
HW 1 FAQ opened
|An important question has been asked about question 5 and graph representations in general. This is a great excuse to open an FAQ for assignment 1. |
During the semester, FAQ regarding the different assignments will be posted, so please visit the FAQ regularly.
|פורסם ב- 8/8/2010, 11:49:40 Created on 8/8/2010, 11:49:40 Создано 8/8/2010, 11:49:40 تم النشر ب- 8/8/2010, 11:49:40|
|This is to remind you that the lectures on Wednesday, 11/08 and 18/08 will be 3 hours long - from 13:30-16:30. Both will be in Taub 6, as usual.|
|עדכון אחרון ב- 5/8/2010, 21:32:36 Last updated on 5/8/2010, 21:32:36 Последняя модификация 5/8/2010, 21:32:36 تمت الحتلنة الأخيرة ب- 5/8/2010, 21:32:36|
Assignment 1 Published
|The first assignment for this semester has been published and can be found under "Assignments". |
Due date: 11/08/2010. Note that a second assignment will be published on 09/08/2010.
|עדכון אחרון ב- 2/8/2010, 18:58:55 Last updated on 2/8/2010, 18:58:55 Последняя модификация 2/8/2010, 18:58:55 تمت الحتلنة الأخيرة ب- 2/8/2010, 18:58:55|
Self Reading for tomorrow and e-mail test
|This is a reminder that you are asked to go over the first recitation's pages 8-11 for tomorrow. As said in class, I will hold an extra 30 minutes reception after class tomorrow to go over related questions.|
Also, if you told me about problems receiving e-mails from the course website and still did not receive this message, please contact me.
|עדכון אחרון ב- 30/7/2010, 12:49:40 Last updated on 30/7/2010, 12:49:40 Последняя модификация 30/7/2010, 12:49:40 تمت الحتلنة الأخيرة ب- 30/7/2010, 12:49:40|
Recommended reading before the first lesson
|To freshen up on some graph theory definitions, which we will use throughout the course, you are asked to read the file on graph theory definitions before the first lessons, this Monday. The file is in the Course Material section under Other Materials|
Regards and good luck with your exams,
|עדכון אחרון ב- 27/7/2010, 08:47:23 Last updated on 27/7/2010, 08:47:23 Последняя модификация 27/7/2010, 08:47:23 تمت الحتلنة الأخيرة ب- 27/7/2010, 08:47:23|
Classes cancelled on Wednesday 21/07
|The first lecture and first tutorial, originally planned for this Wednesday, are canceled, and will be complemented during the semester.|
Good luck with your exams,
|פורסם ב- 18/7/2010, 09:21:11 Created on 18/7/2010, 09:21:11 Создано 18/7/2010, 09:21:11 تم النشر ب- 18/7/2010, 09:21:11|
Algorithms 1 (234247) - Welcome !
|Welcome to the Algorithms 1 course.|
All information about the course can be found on the site (staff, tutorials, syllabus and homework). The first 3 tutorials are already online and the rest of the tutorials will be uploaded soon.
If you did not receive this e-mail to your account, please register to the course mailing list (through the "Auto-Update" link), as the announcements made in the course site are binding.
We wish you a good semester !
Algorithms 1 course staff.
|עדכון אחרון ב- 15/7/2010, 11:05:46 Last updated on 15/7/2010, 11:05:46 Последняя модификация 15/7/2010, 11:05:46 تمت الحتلنة الأخيرة ب- 15/7/2010, 11:05:46|