Mailing Lists @ mit.edu

- Entire Class:

6.006-students - Faculty:

6.006-faculty - Staff:

6.006-staff - TAs:

6.006-tas

People Involved

Phone: 253-9643

Office: 32-G694

Office hours by appointment

Phone: 253-5949

Office: 32-G644

Office hours by appointment

Teaching Assistant

Office Hours: Wednesday,

3-4pm and 7-8pm @ 24-321

Or by appointment

Teaching Assistant

Office Hours: Wednesday,

4-6pm @ 32-G5 Lounge

Or by appointment

Teaching Assistant

Office hours by appointment only

Teaching Assistant

Office hours by appointment only

Teaching Assistant

Office: 32-G604

Office Hours: Wednesday,

1:30-2:30pm @ 32-G5 lounge

Or by appointment

Teaching Assistant

Office Hours: Tuesday,

5-8pm at 32-G5 lounge

Or by appointment

Teaching Assistant

Office Hours: TBA,

5-7pm at 32-G5 lounge

Or by appointment

Announcements

April 24th: Problem set 4 fully graded.

April 24th: Problem set 6 solution template is up.

April 20th: Problem set 6 posted and solutions to problem set 5 are also up. Solution templates will be up shortly, in case you are so desperately eager to start solving your last 6.006 problem set!

April 19th: QUIZ 2 will be held on Wednesday April 25th from 7.30pm to 9.30pm. If your last name is alphabetically smaller or equal to "Mayne" (i.e. if it is in the range "A" through "Mayne"), you will take the exam in Room 34-101. Otherwise you will take the exam in Room 32-123. To avoid unfortunate imbalances in the number of students in the two rooms, we introduce the penalty of zero score, if you fail to comply with this partition. Sorry!

April 7th: Problem set 5 is now up, and we have also posted solutions to problem set 4.

March 30th: Solutions to problem set 3 posted.

March 27th: Problem set 4 updated. We clarified some parts of the true/false question that people thought it was confusing.

March 22nd: For those of you eager to work more on 6.006, we are attending your avid request. Problem set 4 is posted, and it is due on April 4th. Have a nice spring break! :-)

March 19th: Solutions to quiz 1 are up. Please take a look at it!

March 11th: Solutions for problem set 2 are up. Please read it before the quiz!

March 9th: Solution templates are up. Submission system will be up in a few days.

March 8th: Problem set 3 is up. Solution templates will be up soon (and by soon I mean I don't have a precise time, but it will not take long :-) ).

March 8th: QUIZ 1 will be held on Wednesday March 14th from 7.30pm to 9.30pm. If your last name is alphabetically smaller or equal to "Mayne" (i.e. if it is in the range "A" through "Mayne"), you will take the exam in Room 34-101. Otherwise you will take the exam in Room 32-123. To avoid unfortunate imbalances in the number of students in the two rooms, we introduce the penalty of zero score, if you fail to comply with this partition. Sorry!

March 2nd: New version of problem set 2 posted (we fixed a minor typo). Notice the room changes in Rafael's and Henrique's recitations. Their recitations are now being held at 36-155.The course information page was updated to reflect the changes.

Feb 28th: Solutions to problem set 1 posted. New version of problem set 2 posted (we fixed a minor issue on problem 1).

Feb 24th: If you did not receive any message from me today (at around 5pm) through the mailing list 6.006-students, please send me an email so that I can add you to the list. And if you haven't signed up to piazza, please do so ASAP! :-) Enjoy your weekend!

Feb 24th: Problem set 2 is out. It is due on March 7th. The submission server is still not working (in case you are really on top of your work) for this problem set, but it will be soon. Enjoy this pset, this one will be lots of fun! :-)

Feb 23rd: If you want to read and study through recitation notes, we strongly recommend you to look at last year's recitation notes, which can be found here:

http://courses.csail.mit.edu/6.006/spring11/notes.shtml

http://courses.csail.mit.edu/6.006/spring11/notes.shtml

Feb 23rd: Here is some code for an (unbalanced) binary search tree. The actual methods are implemented recursively in the BSTNode class; the BST class is just a small wrapper around the node.

http://dl.dropbox.com/u/3941980/bst.py

http://dl.dropbox.com/u/3941980/bst.py

Feb 12th: Problem set 1 question 4 updated. (a new version of the pset has been posted in the place of the original one, with the fix to problem 4 in it) Notice that the definition of peak is the same as the one that we gave to you in lecture. A peak is an element that is greater than or equal to its neighbors.

Feb 10th: RECITATION ROOM CHANGE. The 12pm and 1pm recitations moved to room 34-302.

Feb 9th: Homework 1 is posted. Please take a look at the solution template given to you. We know it is a python file, and you should put your answers there. We will not use LaTeX for this problem set. Note that you should submit your solutions online at: https://alg.csail.mit.edu

Feb 7th: Please register on the homework submission webpage: https://alg.csail.mit.edu (same as https://sec.csail.mit.edu/)