« Lecture #Syllabus for all sect | Main | Lecture #Syllabus for all sect »
March 03, 2006
Exam #2: Syllabus for all sect
The second exam is scheduled in the Testing Center for Thursday through Saturday next week (3/9 through 3/11). You will have a 3 hour time limit. As with exam #1, the exam is closed book, and you may have one page of notes either hand-written or typed by you (the process of preparing that page can be very useful to you). No calculators or digital assistants (you won't need one).
Homework problems are fair game for exam questions though not all exam questions will be old homework problems. Compare the homework solution keys to your homework assignments and determine if you understand the principles covered in the homework problems.
Go through the lecture notes to see what topics where emphasized in class and be sure that you understand those topics.
Although the exam will cover a subset of the following topics, we will also give some coverage to topics from earlier in the semester:
- Modular exponentiation and Cryptography
- Recurrence Relations (homogeneous)
- Non-homogeneous RR
- RR: Change of Variable, though you will not need to solve a RR w/ change of variables from start to finish.
- Dynamic programming: making change
- Optimality property
- Sequence alignment (except section 001)
- 0/1 Knapsack
- Floyd's algorithm / shortest paths
- Chained matrix multiplication
- Recursion and memory functions
- Graph algorithms: Knapsack III
You're going to do well on this one.
Posted by ringger at March 3, 2006 05:11 PM
Comments
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)