Final Exam
- When
- Monday December 17, 2018, 3:30-5:50pm
- Where
- Olin Hall 318
- Topics
- activity scheduling
- Huffman codes
- depth-first search
- topological sort
- longest path in a DAG
- path-based dfs for strong components
- breadth-first search
- Dijkstra’s shortest path
- Prim’s algorithm
- Kruskal’s algorithm
- binary search
- repeated squaring & modulo exponentiation
- euclid’s algorithm (regular & extended)
- discrete logarithm problem
- Diffe-Hellman Key Exchange
- RSA Cryptography
- integer multiplication
- mergesort
- vertex cover
- metric TSP
- Exam Format
- Closed book, closed notes, no electronic devices.
- Can use a US-letter sized paper with your notes hand-written on it. (You may use both sides.)
- No computer-generated printout allowed.