This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Comprehensive Exam: Algorithms and Concrete Mathematics Autumn 2000 This is a one hour closed-book exam and the point total for all questions is 60. All of the intended answers may be written within the space provided. If necessary, you may use the back of the preceding page for additional scratch work. If you to use the back side of a page to write part of your answer, be sure to mark your answer clearly. The following is a statement of the Stanford University Honor Code: A. The Honor Code is an undertaking of the students, individually and collectively: (1) that they will not give or receive aid in examinations; that they will not give or receive unpermitted aid in class work, in the preparation of reports, or in any other work that is to be used by the instructor as +"- basis of grading; (2) that they will do their sba~-- well as themsell-- R. The faculty on its par from proctoring exam! prevent the form of di practicable, academic p, C. While the faculty alone. students and faculty wil academic work. part in seeing to it that others as (;he Honor Code. mar of its students by refraining 3nd unreasonable precautions to kculty will also avoid, as far as to violate the Honor Code. . , set academic requirements, the , establish optimal conditions for honorable By writing my 'Lmagic number" below, I certify that I acknowledge and accept the Honor Code. (Number) n Prob t # l t # 2 ~ # 3 l # 4 ~ # 5 1 T 0 t a l I 1 I I I I I Max ( 10 ( 20 ( 10 1 10 1 10 1 60 1. ( I 0 points) Big- Oh notation, Running times For each of the following functions, circle the best upper bound &om among the choices given. You only need to circle one answer in each case. For example, if you say that a function is O(n), you do not need to also say that it is also O(n2), O(n logn), and so on. function is O(n), you do not need to also say that it is also O(n2), O(n logn), and so on....
View Full Document