This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 373 Midterm 1 Questions (February 20, 2001) Spring 2001 Write your answers in the separate answer booklet. 1. Multiple Choice: Each question below has one of the following answers. (a) Θ(1) (b) Θ(log n ) (c) Θ( n ) (d) Θ( n log n ) (e) Θ( n 2 ) For each question, write the letter that corresponds to your answer. You do not need to justify your answers. Each correct answer earns you 1 point, but each incorrect answer costs you 1 2 point. You cannot score below zero. (a) What is n ∑ i =1 H i ? (b) What is lg n ∑ i =1 2 i ? (c) How many digits do you need to write n ! in decimal? (d) What is the solution of the recurrence T ( n ) = 16 T ( n/ 4) + n ? (e) What is the solution of the recurrence T ( n ) = T ( n- 2) + lg n ? (f) What is the solution of the recurrence T ( n ) = 4 T (ceilingleftbig n +51 4 ceilingrightbig- √ n ) + 17 n- 2 8 log * ( n 2 ) + 6 ? (g) What is the worst-case running time of randomized quicksort?...
View Full Document
This note was uploaded on 12/15/2009 for the course 942 cs taught by Professor A during the Spring '09 term at University of Illinois at Urbana–Champaign.
- Spring '09