COS 226 Final: COS 226 Princeton Final Fall 10
31 Jan 2019
School
Department
Course
Professor
Document Summary
This test has 14 questions worth a total of 100 points. The exam is closed book, except that you are allowed to use a one page cheatsheet (8. 5-by-11, both sides, in your own handwriting). No calculators or other electronic devices are permitted. Give your answers and show your work in the space provided. Write out and sign the honor code pledge before turning in the test. I pledge my honor that i have not violated the honor code during this examination. Write your name and princeton netid in the space provided on the front of the exam, and circle your precept number: analysis of algorithms. (12 points) For the purposes of this question, assume p 6= n p . Write p (possible), i (impossible), or u (unknown). Find a maximum spanning tree in a connected edge-weighted graph. Find all vertices reachable from a given set of source vertices in a digraph.
