Technion - Israel Institute of Technology  
234247 - Algorithms 1
  Spring 2012 EnglishRussianHebrewArabic  
Announcements

Complementary tutorial today - room
The complementary tutorial for Alex's group will be given today (15.5), 16:30-17:30, at Taub 201.


Course staff.
Created on 15/5/2012, 08:17:14  
Small correction in recitation 8 slides
The last slide of recitation 8 has been corrected.
Please make sure you print out the updated version.

The two tutorial groups who have already seen this tutorial will see the updated slide next week again.
We apologize for the extra work on your end.


Course staff.
Created on 14/5/2012, 17:14:07  
HW4 published
The fourth homework assignment on shortest paths and greedy algorithms (part 1) has been published.
The assignment may appear longer than usual on first sight (6 questions), but it was actually written this way to make it simpler. Honestly.
Following the announcement on HW3, we recommend partying during the student festival.

Starting next week, the workshops will focus on HW4.


Course staff.
Created on 14/5/2012, 00:04:18  
Tuesday's recitation and workshop this upcoming week
This week there is a missing Tuesday, due to the student festival and the Technion calender (Tuesday is "Matkonet" Thursday).
Since we cancelled a tutorial before Independence Day, we are giving a complementary tutorial this week for Tuesday's group.

The complementary tutorial will be given on Tuesday (15.5), 16:30-17:30.
The room will be announced beforehand.

The workshop scheduled for Tuesday will take place as usual (14:30-16:30, Taub 601).


Course staff.
Created on 12/5/2012, 23:37:08  
Correction in recitation 6 (Important)
The solution to the second question given in recitation 6 was slightly incorrect.
Please read the following explanation:

In question 2 of recitation 6, we were given a graph G=(V,E), a weight function w:E->R and an MST of the graph T.
The question dealt with a new weight function w':E->R, in which the weights of the b heaviest edges (denoted by B) have been increased.

Our first claim was that there exists a sorted order w(e_1) <= ... <= w(e_m) of the edges, such that running Kruskal on it gives us T.
The incorrect claim was that the group B was the last b edges of the sorted order.
Since edge weights could have been equal, it was possible that edges in B would have appeared elsewhere in the sorted order.

To make as few changes as possible to the existing solution, we have added an additional assumption that w:E->R gives different weights to edges.
Given this, we can assume that the edges in B are the last m edges in the sorted order matching T.

Please go over the corrected solution before solving the third HW assignment.
We sincerely apologize for giving out the incorrect solution and thank those who pointed out this mistake.


Course staff.
Created on 3/5/2012, 16:28:49  
HW3 published
The third homework assignment on Minimum Spanning Trees (MST) has been published.
We recommend you complete it before the student festival (17.5).
Starting next week, the workshops will focus on HW3.


Course staff.
Created on 29/4/2012, 12:37:55  
Today's workshop - room
The workshop today (Monday 14:30-16:30) will be held in Taub 601.


Course staff.
Last updated on 23/4/2012, 07:28:42  
Next week's lessons and workshops
In order to keep the tutorials synchronized with the lectures, all of the recitations next week are cancelled.
These recitations will be completed later on during the semester.

We will hold two workshops next week:
- Sunday 16:30-18:30 (Taub 601)
- Monday 14:30-16:30 (room will be announced next week).

These workshops are additional DFS tutorials, as some of you asked us to give.
Specifically, the workshops during the week after next week (29/4 - 3/5) will also be on DFS.

The next homework assignment on MSTs will be published next week, for those who would like to work on it sooner.


Course staff.
Created on 20/4/2012, 14:11:41  
Today's lecture - room change
The lecture today (12:30-14:30) will take place at Ulman 707.
We apologize for the sudden announcement, we were equally surprised.


Course staff.
Created on 16/4/2012, 10:47:31  
Change of class: Thursdays tutorial group
Starting this week (19.4), Ran's recitation on Thursdays (09:30-10:20) will take place in Taub 4.


Course staff.
Created on 15/4/2012, 15:00:51  
Change of class: Monday's tutorial group
Jonathan's tutorial on Monday will be given at Ulman 309 for the rest of the semester.


Course staff.
Created on 15/4/2012, 14:39:31  
HW2 published
We have uploaded the second homework assignment on DFS and Strongly Connected Components, for those of you who would like to work on it during the vacation.
For those who are concerned about the rest of their vacation, you can ignore this announcement until next week.
The workshops between 15/4 - 27/4 (the two weeks after the Passover vacation) will be dedicated to this assignment, so you will have plenty of time to complete it once the vacation ends.


Enjoy *
Course staff.



( * ... solving the homework assignment. What, you really thought we meant enjoy the vacation? :P )
Last updated on 8/4/2012, 12:56:29  
Wednesday change of classrooms
Due to a faculty event taking place this Wednesday (4/4) inside the Taub building, the following classes have been moved to a different location:
- Lecture (14:30-16:30) - Ulman 503
- Tutorial (16:30-17:30) - Ulman 307
- Workshop (17:30-19:30) - Taub 401


Course staff.
Created on 2/4/2012, 12:30:24  
HW1 FAQ
We've opened a FAQ section for the first homework assignment.
The recommended completion date for the assignment is 5.4.2012 (instead of 1.4 as previously stated).

To clarify, next week's workshops will refer to HW1 and will be identical to last week's workshops.


Course staff.
Created on 29/3/2012, 18:02:03  
One-time change of hours of Sunday's workshop
Jonathan's workshop this Sunday (25.3) will take place during the hours of 14:30-16:30 (instead of 16:30-18:30 as usual) at Taub 601.


Course staff.
Created on 23/3/2012, 16:10:05  
Change of class: Wednesday's tutorial group
Starting next week (28.3), Omri's recitation on Wednesdays (16:30-17:30) will take place in Taub 4.


Course staff.
Created on 21/3/2012, 16:33:01  
List of workshops in Algorithms
We have published workshop hours ("Sadna'ot"), which will be dedicated to the homework assignments.
You can find them under the "Staff" button on the left. For your convenience, we give this list of workshops here:
- Jonathan: Sunday 16:30-18:30, Taub 601
- Ran: Monday 18:00-20:00, Taub 701
- Alex: Tuesday 14:30-16:30, Taub 601
- Omri: Wednesday 17:30-19:30, Taub 4


The workshops will start next week and change on a 2-week basis.
For example, all 8 workshops given by us in the following 2 weeks (starting this Sunday) will all be identical and refer to the first homework assignment.
Thus, you should make sure to attend one workshop in the next 2 weeks.


Every workshop will be divided into 3 parts:
1. Individual questions (~40 minutes): You will be able to ask us individual questions regarding the assignment.
The purpose of this part is for you to receive personal assistance regarding the assignment, and to allow you to continue thinking after we give you hints and directions.

2. Class solutions (~40 minutes): In this part, all of the participating students along with the teaching assistant will discuss the questions and solution approaches.
The purpose of this part is to give you the tools needed to understand the homework assignment and its solution.

3. Individual proofs (~40 minuts): In the final part, you will be able to choose one (or more) claims needed in order to prove the correctness of one of your algorithms, write it down and receive instant feedback from us.
We will give you remarks on-the-spot on the correctness of your proof. This section is also individual.


Try to solve the assignment before attending a relevant workshop.


Good luck,
Course staff.
Created on 21/3/2012, 16:30:25  
HW1 published
The first homework assignment is now available on the website.
We remind you that homework assignments in this course are not mandatory. However, we highly recommend solving them fully, as they play a very important part in understanding the material.
We note that ~15% of the final exam will consist of a question from the homework assignments, if all of our motivational speeches up to now weren't enough.


Course staff.
Created on 21/3/2012, 16:29:02  
New tutorial class
An additional tutorial class has been opened.
This tutorial will be held on Sundays 13:30-14:30, and will be given by Ran at Taub 3.


Course staff.
Created on 10/3/2012, 18:54:26  
Welcome to Algorithms 1! (234247)
This is the first mail from the Algorithms 1 course staff.
Each student registered to the course should have received this email. If you haven't, you are either unregistered or do not appear on the mailing list.
To add yourself to the mailing list, use the "Auto Update" button on the menu to the left.

Information regarding the course can be found under the "Syllabus" tab.
Please read the course Syllabus file, as it contains important guidelines and instructions.
A full course schedule will be uploaded soon.

Under the "Course Material" tab you can find recitation summaries and the slides we will use throughout the course.
We highly recommend printing these slides and coming with them to class.

Both lectures and recitations will be held starting this week.


Wishing you all a good semester,
Course staff.
Last updated on 10/3/2012, 18:52:56