ECS 222A: Algorithm Design and Analysis UC Davis Charles Martel
Handout ? December 7, 2006
Sample Final Exam
A. Describe how to extend the randomized closest point algorithm to points in 3D space (so each point is described by a triple (xi , yi , zi ). Wh
ECS 222A: Algorithm Design and Analysis UC Davis Charles Martel
Handout ? December. 11, 2008
Final Exam
Instructions: Please write clearly and succinctly; be sure to give an overview before plunging into details. Note that if an algorithm is requested, th
ECS 222A: Algorithm Design and Analysis UC Davis Charles Martel
Handout ? Nov. 2006
Samplel Exam Solutions
1 Dynamic Programming
(a) T T else, T (1, j, k ) = (1, 0, 0) = 0 (1, wi , si ) = vi
(b) We can either use item i or not. If we use item i, we look
ECS 222A: Algorithm Design and Analysis UC Davis Charles Martel
Handout ? October. 29, 2009
Midterm Exam
1 Clustering [18 points]
We are given numbers a1 < a2 . . . < an and a parameter p. We want to partition these numbers into clusters such that: i) eac