COS 226 Final Information, Fall 2013
This document is intended to help you use your study time effectively. Please
view it as a guide, not a contract.
You may also view the exam archive to study old questions.
Final Exam Schedule
There will be a review session TBA.
The final exam is from 1:30 to 4:30 pm on Tuesday, Jan 21st in McCosh 10.
Office Hours (Josh's hours TBA, depending on when review session happens):
|Thurs 1/16|| 7:00-8:00 pm
||Outside CS 406
|Fri 1/17|| 12:00-4:00 pm
||Outside CS 306
|Sun 1/19|| 2:00-5:00 pm
|Mon 1/20|| 10:30-1:30 pm
|Mon 1/20|| 1:30-4:30 pm
|Mon 1/20|| 7:00-9:00 pm
|Tue 1/21|| 9:00am-12:00 pm
||ACE 34 (in E-Quad)
- Closed book, closed note.
- You may bring one 8.5-by-11 sheet (both sides) with notes in your own
handwriting to the exam.
- No electronic devices (e.g., calculators, laptops, and cell phones).
We have covered an enormous amount of
material this semester, but the exam can only contain basic questions about a
small fraction of it. When you study, you should focus on understanding basic
issues, not memorizing details. For each algorithm, you should make sure that
you understand how it works on typical input and then ask yourself some
basic questions: Why do we care about this algorithm? How is it different from
other algorithms for the same problem? When is it effective?
The exam will stress material covered since the midterm,
including the following components.
The midterm itself is fair game (did you take the time to understand
questions that you missed on that exam?).
Also, some material before the midterm is also relevant to
putting new algorithms in context. For example, you
might see a question on sorting/searching that covers both
standard and string algorithms.
- Lectures 13–24.
- Algorithms in Java, 4th edition, Chapters 4–6.
- Exercises 13–23.
- Programming assignments 5–9.
Partial list of topics covered since the midterm
||LSD string sort
||MSD string sort
|Knuth-Morris-Pratt substring search
||Boyer-Moore substring search
||Rabin-Karp substring search
|RE to NFA
||Ternary search tries
||Reductions (no mathematically difficult ones, though)
Questions that show awareness of advanced topics that were covered in lecture
are also fair game (for example, NP-completeness and 3-satisfiability).
See the study ugide for a more thorough list of topics.