CSE 310: Algorithms and Data Structures, Assignment 1: Induction Due Date: Monday, June 14, 2010
Question 1: Suppose we have stamps of only two denominations, 3 cents and 5 cents. Show that it is possible to make up exactly any postage of 8 cents or more
CSE 310: Algorithms and Data Structures
Assignment 3: Timing Analysis (Due Date: June 28, 2010)
Question 1: Show that for any real constants a and b, where b>0, (n+a)b = (nb).
Question 2: Prove that f(n) = ( g(n) ) iff g(n) = ( f(n) )
Question 3: Prove th
Question1: Whatistheminimumandmaximumnumberofelementspresentin aheapofheighth? Question 2: Show that there are at most nodes of height h in any nelementheap. Qu