quiz1_practice

quiz1_practice - 6.046 Fall 2004 Quiz Reviewfrom 6.046...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
6.046 Fall 2004 Quiz Review—from 6.046 Spring 2002: 1. Recurrences (20 points) Solve the following recurrences (provide only the () bounds). You can assume T ( n ) = 1 for n smaller than some constant in all cases. You do not have to provide justiFcations, just write the solutions. T ( n ) = T ( n/ 7) + 1 T ( n ) = 3 T ( n/ 3) + n T ( n ) = 5 T ( n/ 5) + n log n T ( n ) = 10 T ( n/ 3) + n 1 . 1 2. True or ±alse, and Justify (32 points) Circle T or F for each of the following statements to indicate whether the statement is true or false, respectively. If the statement is correct, briefly state why. If the statement is wrong, explain why. Your justiFcation is worth more points than your true-or-false designation. T F The solution to the recurrence T ( n ) = T ( n/ 3) + T ( n/ 6) + n log n is T ( n ) = ( n log n ) (assume T ( n ) = 1 for n smaller than some constant c ). T
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/20/2012 for the course CS 6.006 taught by Professor Erikdemaine during the Fall '08 term at MIT.

Ask a homework question - tutors are online