The questions on quiz 3 are:
- Perform Dijkstra’s shortest path
- Hint: create a table like on slide 14 of the 03-2-DijkstraAndPrim.pdf slide set
- Find an MST in a graph (either Kruskal’s or Prim’s)
- A note about scratch paper: copy the NODES only, and the fill in the edges in the MST
- Proofs:
- Prove optimal substructure of one of the algorithms we have seen (randomly chosen)
- Prove the greedy choice property of one of the algorithms we have seen (randomly chosen)
- This will be by proof blocks (given a number of steps of the proof, including incorrect steps, select the correct ones and assemble them in the correct order)
- 6 possible algorithms: coin change, Dijkstra’s, MST (both Prim’s and Kruskal’s), activity selection, fractional knapsack
- Some number (5-10) of true/false questions from a very large question bank