I have posted the final grades in SIS, so you should be able to see them soon (at least by tomorrow).
Comments on the final exam: [PDF]
Thanks everyone for a great semester, and enjoy your summer!
|
||||||
|
The final exam is Thursday, May 13, 9am-noon (as scheduled by the registrar). It covers the whole course:
It will be similar to Exams 1 and 2 except that no resources may be used (no notes at all!). I will be out of town Thursday [More...] Exam 2 Comments: [PDF] Exam 2 is here: [PDF] [LaTeX Template] Exam 2 is due at the beginning of class Tuesday. Exam 2 will be handed out Thursday, April 8 and due Tuesday, April 13. It will cover everything through today’s class (Barbara Liskov’s lecture), but emphasize things that have been covered since Exam 1: class 10-18, Problem sets 4 and 5. If you have any topics you would like me to review in class Tuesday, or questions you want me to go over, please post them here. As a separate game theory challenge, if exactly ONE student in [More...] Exam 1 Final Comments: [PDF] This paper by Ron Rivest provides an interesting application of squarefree sequences, and describes (in Section 7) some interesting ways to create arbitrarily long squarefree sequences: Abelian square-free dithering for iterated hash functions. Sonali will hold a review session for Exam 1 on Sunday, February 28, 5-6:30pm in Olsson 228E. Exam 1 will be in class on Tuesday, 2 March. It will cover material from Problem Set 1-3, Sipser Chapters 0-2, and Classes 1-9 (through 23 February). For this exam, each student will be permitted to bring one standard-size (8.5×11″) page of notes to use during the exam, but will not be permitted to use any other resources. You may use both sides of the page and generate your notes in any way you choose, but should [More...] |
||||||
|
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United States License. |
||||||