|
| ![]() |
| Course»Course 6»Spring 2005»6.046/18.410»Homepage |
|
6.046/18.410 Intro to AlgorithmsSpring 2005 Instructors: Charles E Leiserson, Ronald L Rivest TAs: Kunal Agrawal, Jeremy T Fineman, Dah-Yoh Lim, Sudipta Sengupta
Lecture:
MW 9.30-11 A.M.
(32-123)
Information: Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. AnnouncementsQuiz 2 BugIn question 1, replace "out-degree" with "degree" in line 2.Announced on 25 April 2005 7:26 p.m. by Kunal Agrawal Quiz 2 BugProblem 1: Static graph representation:The last word in the 1st paragraph should be "smallest" and not "largest"; "that is, if you sort the vertices adjacent to $v$, then $u$ is the $i$th smallest." Announced on 25 April 2005 11:12 a.m. by Kunal Agrawal Take Home ExamThe Take home exam goes out on Monday 4/25/2005 and covers all the material covered until Friday 4/22/2005. Attendence om Monday 4/25/2005 is Mandatory.Announced on 21 April 2005 6:14 p.m. by Kunal Agrawal Office Hours ChangeAdditional Office Hours:Monday 2/21, 2-4PM, 32-G 7th floor lounge (Kunal) Tuesday 2/22, 4:30-6:30PM, 32-G 7th floor lounge (Jeremy) Cancelled Office Hours Wednesday 2/23, 7-9PM (Jeremy) Thursday 2/24, 6-8PM (Kunal) Announced on 20 February 2005 1:43 p.m. by Jeremy Fineman Recitation Assignments MadeRecitation Assignments have already been made via email. If you haven't received it yet, email dylimATmit.Announced on 03 February 2005 11:37 a.m. by Dah-Yoh Lim
|
![]() |