This preview shows pages 1–2. 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: Here are all the quizzes for CSCE 750, Fall 2011. CSCE 750, Fall 2011, Quiz 1 Show by grouping the sum into blocks that X n =2 1 n (lg n ) 2 < . Do not use an integral approximation. Note: You may assume without proof that X k =1 1 k 2 < . CSCE 750, Fall 2011, Quiz 2 Give an example of an asymptotically positive, real-valued function f , defined for all sufficiently large integers n , such that f ( n ) = o ( n ) but f ( n ) = ( n 1- ) for all constant > 0. You are not required to prove that your answer is correct. CSCE 750, Fall 2011, Quiz 3 Use the substitution method to show that if T ( n ) = 6 T n 7 + n, then T = O ( n ) . Only show the inductive step. Dont worry about any base case(s). CSCE 750, Fall 2011, Quiz 4 Using any method you like, but showing your work, find tight asymptotic bounds on any positive function T ( n ) satisfying T ( n ) = 2 T (7 n/ 10) + n 2 ....
View Full Document
This note was uploaded on 12/13/2011 for the course CSCE 750 taught by Professor Fenner during the Fall '11 term at South Carolina.
- Fall '11