Readings - Readings .com!..,%

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Readings  Help support MIT OpenCourseWare by shopping at!  MIT OpenCourseWare offers direct links to to purchase the books cited in this course.  Click on the book titles and purchase the book  from, and MIT OpenCourseWare will receive up to 10% of all purchases you make. Your support will enable MIT to continue offering open access to MIT courses. The table below provides information on the course's reading assignments, which are taken from the course textbook: Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford  Stein.  Introduction to Algorithms . 2nd ed. Cambridge, MA:  MIT Press . ISBN: 0262032937. In addition to the assigned course readings, see the list of  useful references  for the course below. SES # TOPICS READINGS L1 Administrivia Introduction Analysis of Algorithms, Insertion Sort, Mergesort Chapters 1-2 R1 Correctness of Algorithms Horner's rule L2 Asymptotic Notation Recurrences Substitution, Master Method Chapters 3-4, excluding section 4.4 L3 Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication Sections 28.2 and 30.1 R2 Recurrences, Sloppiness L4 Quicksort, Randomized Algorithms Sections 5.1-5.3 Chapter 7 R3 Heapsort, Dynamic Sets, Priority Queues Chapter 6 L5 Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort Sections 8.1-8.3 L6 Order Statistics, Median Chapter 9 R4 Applications of Median Bucketsort Section 8.4 L7 Hashing, Hash Functions Sections 11.1-11.3 L8 Universal Hashing, Perfect Hashing Section 11.5 R5 Quiz 1 Review Q1 Quiz 1, In-class R6 Binary Search Trees, Tree Walks Sections 12.1-12.3 L9 Relation of BSTs to Quicksort Analysis of Random BST Section 12.4 L10 Red-black Trees, Rotations, Insertions, Deletions Chapter 13 R7 2-3 Trees, B-trees L11 Augmenting Data Structures, Dynamic Order Statistics, Interval Trees Chapter 14 L12 Skip Lists Skip Lists handout ( PDF ) R8 Range Trees L13 Amortized Algorithms, Table Doubling, Potential Method Chapter 17 L14 Competitive Analysis: Self-organizing Lists Sleator, Daniel D., and Robert E. Tarjan. "Amortized efficiency of list update and paging  rules." Communications of the ACM  28, no. 2 (February 1985): 202-208. R9
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/12/2011 for the course MATH 6.046J taught by Professor Demaine during the Fall '10 term at MIT.

Page1 / 2

Readings - Readings .com!..,%

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online