This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSE 202 Final Examination December 2011 Maximum points: 60 Due December 8th, 5:00 PM. Submit the solutions at CSE 4246. No late submissions. No electronic submissions. Instructions: 1. Although this exam is an open book exam, you are only allowed to consult standard textbooks or course lecture notes. You cannot consult the Web. (a) Introduction to Algorithms (Cormen, Leiserson, Rivest, Stein) (b) Algorithm Design by Kleinberg and Tardos (c) Algorithms by Dasgupta, Papadimitriou and Vazirani 2. This test is designed to give you an opportunity to demonstrate your understanding of principles of algorithm design, analysis and application. Consequently, you are required to work by yourself in answering the questions. Group work or consultation with others is not allowed. You can check with the instructor or the TA for any clarification. 3. Guidelines for writing a solution: (a) Write your solutions neatly. Proofread them before you submit. (b) Write a high-level description of your algorithm. State the main ideas and strategies used in developing your algorithm. Quality of your high-level description of the algorithm is the prime determinant of your grade. (c) Write your algorithm using a high-level pseudo language providing important details. If you are using a modified version of a well-known algorithm, show clearly what your modifications are. If you are using a well-known algorithm without any modifications, it is enough to specify how you plan to apply the...
View Full Document
- Spring '06
- Analysis of algorithms, deterministic selection algorithm