WATCH THIS SPACE FOR INFORMATION POSTED AFTER THE FINAL |
---|

(nothing yet!) |

- What about the Possible MTA Strike?
- Sample Final Exam (with answers) from Last Year. We try to keep to the format of the midterm. This sample is a pretty good guide to what to expect this year: -- except for question 2 (about probability) all the other question might have been used for this year's final. Of course, question 1 is about AVL tree, which we did not cover, but I could have substituted B-trees or splay trees. ALSO we might have True/False questions, as in this sample.
- Final Exam is on Wed Dec 15, at 10:00-11:50, in Rooms 405 Main and 411 Main. Please show up in Room 405 first.
- It covers ALL the material covered in lectures, tutorials and guest lectures. Since the lectures and recitation sometimes introduce material not in the book, make sure that you review your lecture notes. Emphasis is on post-midterm material.
- It is a close book exam, but you are allowed to prepare two 8" x 11" sheet of notes (= 4 pages). You can write as big or as small as you like. NOTE: you may re-use one sheet from your midterm.
- Reading List. In addition to the reading list from
midterm, we include the following:
Chapter Sections to Read Sections to Focus On 7. Graphs all but 7.4.2 and 7.5 all 8. Sorting all but 8.3 and 8.7 10. Searching all 10.4 (hashing) 11. Indexing all B-trees 12. Lists and Arrays Revisited 12.1 Skip Lists 13. Advanced Trees 13.2 Splay Trees 14. Analysis 14.1 and 14.2 14.1 and 14.2 15. Limits to Computation all 15.2 (reduction) and 15.3 (hard problems) - Skills You Should Have:
- Hand simulation of basic algorithms in topics below
- Asymptotic Notation and Recurrences
- Basic proof techniques
- Graph algorithms (DFS, BFS, Dijstra)
- Sorting Algorithms
- Hashing
- Splay Trees
- Skip Lists
- B-trees