mt1(1) - CS 373: Combinatorial Algorithms, Fall 2000...

Info iconThis preview shows pages 1–3. 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: Combinatorial Algorithms, Fall 2000 Midterm 1 October 3, 2000 Name: Net ID: Alias: U 3 / 4 1 This is a closed-book, closed-notes exam! If you brought anything with you besides writing instruments and your 8 1 2 11 cheat sheet, please leave it at the front of the classroom. Print your name, netid, and alias in the boxes above. Circle U if you are an undergrad, 3 / 4 if you are a 3/4-unit grad student, or 1 if you are a 1-unit grad student. Print your name at the top of every page (in case the staple falls out!). Answer four of the five questions on the exam. Each question is worth 10 points. If you answer more than four questions, the one with the lowest score will be ignored. 1-unit graduate students must answer question 5. Please write your final answers on the front of the exam pages. Use the backs of the pages as scratch paper. Let us know if you need more paper. Unless we specifically say otherwise, proofs are not required. However, they may help us give you partial credit. Read the entire exam before writing anything. Make sure you understand what the questions are asking. If you give a beautiful answer to the wrong question, youll get no credit. If any question is unclear, please ask one of us for clarification. Dont spend too much time on any single problem. If you get stuck, move on to something else and come back later. Write something down for every problem. Dont panic and erase large chunks of work. Even if you think its absolute nonsense, it might be worth partial credit. Relax. Breathe. Kick some ass. # Score Grader 1 2 3 4 5 Total CS 373 Midterm 1 (October 3, 2000) Fall 2000 1. Multiple Choice Every 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. What is n i =1 log i ? What is n i =1 n i ? How many digits do you need to write 2 n in decimal? What is the solution of the recurrence T ( n ) = 25 T ( n/ 5) + n ? What is the solution of the recurrence T ( n ) = T ( n- 1) + 1 2 n ? What is the solution of the recurrence T ( n ) = 3 T (ceilingleftbig n +51 3 ceilingrightbig) +17 n- 7 lg lg n- 2 2 log * n + ?...
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.

Page1 / 6

mt1(1) - CS 373: Combinatorial Algorithms, Fall 2000...

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

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