This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: STANFORD UNIVERSITY CS 161, Summer 2004 Final Examination Question Points 1 Algorithm Design / 64 2 Augmenting Skip Lists / 22 3 Shortest Paths / 21 4 Boolean Chains / 13 5 Dynamic Hash Tables / 12 6 Dynamic Transitive Closure / 18 7 Short Answer / 30 Total /180 Name (print): Honor Code Statement: I attest that I have not given or received aid in this examination, and that I have done my share and taken an active part in seeing to it that others as well as myself uphold the spirit and letter of the Honor Code. Specifically, I attest that I have not had any advance knowledge of the questions on this examination, and I have not enabled anyone to gain such knowledge. Signed: CS161 Final 2 Answer Guidelines • These guidelines cover the default assumptions that should be made when answering a question. In all cases, explicit instructions given in the question supersede these guidelines. • Try to keep your answers to the space provided. If you need additional space, use the blank page at the end of the exam and/or the back side of normal pages. If you do, please tell us where to find the continuation of your answer and clearly label the answer text with the corresponding question number and part. • Your answers need to be complete and concise . Unless explicitly told otherwise, you must provide justification for your answers, but are not required to formally prove them. If you’re asked to give an algorithm and its running time, you do not need to prove correctness or do a formal running time analysis; a brief explanation for both is sufficient. • You may use anything proven in class, in the textbook, or on the homework without proof, unless explicitly asked to prove it. • When your solution refers to an algorithm or data structure we covered in class, please be sure to specify all the relevant parameters. For instance, specify whether you’re using randomized or deterministic Select, Quicksort; MIN or MAX heap; chaining or open addressing collision resolution for hash tables, number of slots in the hash table; skip list propagation parameter; and so on. Every factor that effects performance (or correctness) should be addressed, although it’s acceptable to say, for instance, “using universal hashing” without explicitly specifying a universal hash function family. • When answering with a running time or space bound please be sure to specify whether it’s a worstcase, expected, or amortized bound. Unless stated otherwise, any type of bound is acceptable. If giving an expectedcase bound, be careful not to make any assumptions about the distribution of the input(s)  the expectation should be over randomization internal to the algorithm or data structure....
View
Full
Document
This document was uploaded on 05/25/2011.
 Summer '09
 Algorithms

Click to edit the document details