COS 226 Midterm: COS 226 Princeton Midterm Fall 12
31 Jan 2019
School
Department
Course
Professor
Document Summary
This test has 9 questions worth a total of 55 points. The exam is closed book, except that you are allowed to use a one page cheatsheet. 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. Circle the letters corresponding to id[] arrays that cannot possibly occur during the execution of the weighted quick union algorithm. Match up each algorithm by writing its number under the corresponding column. 1 (0) original input (4) shellsort (7) quicksort (1) sorted (2) selection sort (3) insertion sort (13-4-1 increments) (dijkstra 3-way, no shu e) (5) mergesort (top-down) (6) quicksort (standard, no shu e) (8) quicksort (dual-pivot, no shu e) (9) heapsort. Princeton university: analysis of algorithms. (6 points)
