COS 226 Final Information, Fall 2012
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

Office Hours:
 Saturday, Jan 19th, 1–3 PM. Dushyant, CS 003
 Sunday, Jan 20th, 1–3 PM. Dan, Friend 017
 Sunday, Jan 20th, 5–7 PM. Diego, CS 003
 Monday, Jan 21st, 1–3 PM. Maia, CS 205
 Monday, Jan 21st, 3–5 PM. Kevin, CS 207
 Monday, Jan 21st, 5–7 PM. Ankit, CS 216

There will be a review session 3–5pm on Sunday, Jan 20th in Friend 006.

The final exam is 9amnoon on Tuesday, Jan 22nd in James S. McDonnell Hall A02.
Exam Format
 Closed book, closed note.
 You may bring one 8.5by11 sheet (both sides) with notes in your own
handwriting to the exam.
 No electronic devices (e.g., calculators, laptops, and cell phones).
Material Covered
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.
 Lectures 13–24.
 Algorithms in Java, 4th edition, Chapters 4–6.
 Exercises 13–23.
 Programming assignments 6–8.
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.
Partial list of topics covered since the midterm
keyindexed counting
 LSD string sort
 MSD string sort
 3way string quicksort

Depthfirst search
 Breadthfirst search
 Topological sort
 Prim's algorithm

Kruskal's algorithm
 Dijkstra's algorithm
 BellmanFord algorithm
 FordFulkerson algorithm

KnuthMorrisPratt substring search
 BoyerMoore substring search
 RabinKarp substring search

RE to NFA
 Rway tries
 Ternary search tries
 Reductions

Runlength coding
 Huffman coding
 LZW compression
 BurrowsWheeler

Questions that show awareness of advanced topics that were covered in lecture
are also fair game (for example, NPcompleteness and 3satisfiability).