6.006 Introduction to Algorithms
Fall 2012
Instructors: Piotr Indyk, Ronald L Rivest
TAs: Elyot Grant, Timothy Peng, Sanja Popovic, Michalis Rossides, Jeffrey Wu
Lecture:
TR11
(54-100)
Office Hours: M2:30-6:00
(24-316)
Office Hours: T4-7
(24-316)
Office Hours: R5-7
(24-310)
Information:
Announcements
Grades for the final are out
Hi everyone,We released the final grades. The average was 119.15 and deviation 27.8. More details are on Piazza.
Thank you all for a great semester and good luck in the future!
- 6.006 staff
Announced on 19 December 2012 5:55 p.m. by Sanja Popovic
Some further Final Exam details
Apologies for another email.Three double-sided 8.5" by 11" cheat sheets will be permitted at the 6.006 final exam. They can be hand-written or typed.
No calculators or programmable devices will be permitted, nor will they be necessary.
As usual, past quizzes can be found here: http://courses.csail.mit.edu/6.006/oldquizzes/
Note that the style of questions as well as the topics covered may be slightly different, and difficult questions on past exams may have appeared easier to students who were exposed to similar in-class examples or problem set questions.
Announced on 14 December 2012 4:43 p.m. by Elyot Grant
6.006 Final Exam Information
Below is some information concerning the 6.006 Final Exam. This is subject to small changes that may occur due to modifications to the exam between now and Monday.Total exam points: ~180 (180 minutes)
True/False: ~30
Multiple Choice: ~10
Short Answer/Fill in the Blank: ~70
Algorithm Design/Problem Solving: ~70
By topic (weighted more heavily toward the material in the later
portion of the course):
Math/recurrences/big O/etc: ~15
Divide and conquer: ~10
Sorting: ~10
Data structures: ~20
Hashing: ~15
Numerics: ~10
Graphs/Shortest Paths: ~45
Dynamic Programming: ~45
Complexity (NP-Completeness, Halting Problem, etc.): ~10
You **WILL** need to read and write both pseudocode and python
code (but we will not test knowledge of any specific python
details).
You **WILL NOT** need to prove that a new problem is NP-complete by
constructing a novel reduction, but you should expect a few short
questions concerning the general theory of NP-completeness and
reductions.
We will not test the following topics:
- cuckoo hashing
- document distance
Announced on 14 December 2012 4:24 p.m. by Elyot Grant
Final Quiz Review Sessions
We're having the first review session today, starting at ~1:05 (15 minutes from now) in 32-144. Today we'll do a few DP problems, then run through quizzes from previous years for which the solutions are unavailable on-line (estimated 2 hours long). If the classroom is unavailable, please check Piazza to see where we have moved.Please stay tuned (both here and on Piazza) for more announcements regarding review sessions this weekend.
Announced on 14 December 2012 12:52 p.m. by Timothy Peng
Quiz 2 solutions posted
Grades should be available on https://alg.csail.mit.edu
Quizzes were returned today in recitation. If you didn't pick yours up, they will be available for pickup next week during recitations.
Announced on 21 November 2012 4:15 p.m. by Michalis Rossides