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: violation of the course rule. Note: Solutions must be readable (especially handwriting!!), concise, complete and must include pledge of the Honor system. Reading Assignment: Chapter 2 and Chapter 3 1. Explain the meaning of the following expressions: a. f(n) is ( ) 1 . b. f(n) is ( ) 1 . c. f(n) is ( ) 1 . 2. Prove or disprove each of the following conjectures: a. 2n + 7 = (1). b. 2 n+5 = (2 n ). c. 2 2n = (2 n ). d. f(n) = (g(n)) implies 2 f(n) = (2 g(n) ). e. f(n) = (f(n/2)). f. 2n + 7 = (n 2 ). 3. Indicate, for each pair of expressions (A, B) in the table below, whether A is , o, , , or of B. Assume that k 1, > 0, > 0, and c >1 are constant. Your answer should be in the form of the table with yes or no written in each box. 2 4. Rank the following functions by order of growth, that is, find an arrangement g 1 , g 2 , .g 15 of the function satisfying g 1 = g 2 , g 2 = g 3 , ., g 14 = g 15 ....
View Full Document
- Spring '10