mt1c - CS 373 U Conflict Midterm 1 Questions (February 24,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 373 U Conflict Midterm 1 Questions (February 24, 2004) Spring 2004 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 ) X: I dont know. 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. Each X earns you 1 4 point. Each incorrect answer costs you 1 2 point. Your total score will be rounded down to an integer. Negative scores will be rounded up to zero. (a) What is n i =1 n i ? (b) What is lg n i =1 4 i ? (c) How many bits are required to write n ! in binary? (d) What is the solution of the recurrence T ( n ) = 4 T ( n/ 2) + n log n ? (e) What is the solution of the recurrence T ( n ) = T ( n- 3) + 5 n ? (f) What is the solution of the recurrence T ( n ) = 9 T (ceilingleftbig n +13 3 ceilingrightbig) + 10 n- 7 n- lg 3 n lg lg n ?...
View Full Document

This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.

Page1 / 2

mt1c - CS 373 U Conflict Midterm 1 Questions (February 24,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online