The final will be cumulative. You may bring three sheets of notes (8.5x11 or A4, both sides).

Please fill out the underground guide evaluations: sixweb.mit.edu.

Problem Set 6 is due Thursday May 8 at 11:59PM. See the Problem Sets page. PS6 has more coding parts than previous problem sets, so we suggest you get started early.

The quiz will cover Lectures 10 through 17, including sorting (but not heaps), search, and shortest paths.

You may bring one sheet of notes (8.5x11 or A4, both sides).

Practice Question (from previous 6.006 exams) are available on the Quizzes page.

Wednesday recitation will be devoted to quiz review.

Problem Set 5 is due Thursday April 24 at 11:59PM. See the Problem Sets page. We recommend starting PS5 before the Quiz 2, because shortest paths will be covered on the quiz.

Problem Set 4 is due Thursday April 10 at 11:59PM. See the Problem Sets page. Note: PS4 was originally scheduled to be due two days earlier, but we pushed it back.

Enjoy Spring Break!

The quiz will cover everything through March 7, including heaps.

You may bring one sheet of notes (8.5x11 or A4, both sides).

Practice Question (from previous 6.006 exams) are available on the Quizzes page. Unfortunately we didn't have any appropriate BST questions, but everything else through this week is well-covered in the packet.

Wednesday recitation will be devoted to quiz review.

Problem Set 3 is due Thursday March 20 at 11:59PM. See the Problem Sets page. We recommend at least thinking about the problems involving heaps, because heaps are covered on the Quiz. Specifically, that would be the exercises from chapter 6, and problems 1 and 2a.

Problem set 2 again can be submitted at six.zergling.net

There was a bug in problem 3d. The problem said to use linear probing, assuming simple uniform hashing. This makes the problem hard. Instead, the probem should say "assume uniform hashing". The PDF has been corrected on the Problem Sets page.

Problem Set 2 is due Thursday March 6 at 11:59PM. See the Problem Sets page for the PDF, LaTeX template, and code. We recommend starting early. You should be able to problem 1 now.

Until we move our submission website onto an MIT server, problem sets can be submitted at: six.zergling.net

Starting next week (Thursday, because Tuesday is a Monday), lecture will be in 32-141.

Problem Set 1 is due Thursday February 21 at 11:59PM. See the Problem Sets page for the PDF, LaTeX template, and code.

Recitations are Wednesday and Friday at 10AM, 11AM (in 36-153) and 2PM, 3PM (in 36-144). If you have not received an e-mail with your recitation assignment, please e-mail the course staff.

The required textbook for 6.006 is Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein. Recitation assignments will be e-mailed out Tuesday afternoon (Feb 5) after the first lecture. Please ignore recitation assignments given out by the registrar.