This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Data Structures and Algorithms (I) closebook midterm exam November 30, 2007 You may answer the questions in any order. Dishonest behaviors and attempts will be punished most seriously. When you are asked to justify, prove, or disprove your answers, you may directly use anything that we have shown in class in a “blackbox” manner. Problem 1 (20 points) Let f ( n ) and g ( n ) be two positive functions. We say that f ( n ) = O ( g ( n )) if there exist two positive constants c and n such that f ( n ) ≤ c · g ( n ) holds for any n ≥ n . Let us define a “new” asymptotic notation ξ by saying that f ( n ) = ξ ( g ( n )) if f ( n ) = O ( g ( n )) and g ( n ) = O ( f ( n )) . Prove or disprove the statement that f ( n ) = ξ ( g ( n )) implies f ( n ) log 2 g ( n ) f ( n ) = ξ ( g ( n )) . Problem 2 (15 points) Prove the following theorem. Let a ≥ 1 and b > 1 be constants. Let f ( n ) be a positive function....
View
Full
Document
 Spring '10
 .
 Algorithms, Mathematical Induction, Data Structures, Big O notation, Analysis of algorithms, Computational complexity theory, Natural number

Click to edit the document details