This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Summer 2011 1. The time to multiply two matrices is: A. B. C. D. 2. Which of the following is the best approximation for ? ( m and n are positive integers) A. B. C. D. 1 3. Which sort has both its worstcase and expected times in ? A. heap B. insertion C. merge D. selection 4. Suppose . What is the value of n ? A. 4 B. 5 C. 6 D. 7 5. The function is in which set? A. B. C. D. 6. Which of the following is not true? A. B. C. D. 7. What is n , the number of elements, for the largest table that can be processed by binary search using no more than 7 probes? A. 31 B. 63 C. 64 D. 127 8. is in all of the following sets, except A. B. C. D. 9. Suppose there is a large, unordered table with n integers, possibly with repeated values. How much time is needed to determine the minimum value? A. B. C. D. 10. The recursion tree for mergesort has which property? A. each level has the same contribution B. it leads to a definite geometric sum C. it leads to a harmonic sum D. it leads to an indefinite geometric sum 11. Suppose that you have correctly determined some c and n o to prove. Which of the following is not true? A. c may be decreased B. c may be increased C. n o may be increased D. 12. Suppose you are using the substitution method to establish a Θ bound on a recurrence and you already know necessarily and . Which of the following cannot be shown as an improvement? A. B. C. D. 13. What is required when calling union(i,j) for maintaining disjoint subsets? A. i is the ancestor of j in one of the trees B. i and j are in the same subset C. i and j are leaders for different subsets D. i and j are leaders for the same subset 14. Which of the following is not true regarding a maxheap with 1000 elements? A. Subscript 1 will store the maximum priority. B. The parent for the node with subscript 500 is stored at subscript 250. C. The left child for the node with subscript 200 is stored at subscript 400. D. The right child for the node with subscript 405 is stored at subscript 911. 15. is in all of the following sets, except A. B. C. D. Fall 2011 1. The time to compute the sum of the n elements of an integer array is in: A. B. C. D. 2. Suppose there is a large table with n integers, possibly with repeated values, in ascending order. How much time is needed to determine the number of occurences of a particular value? A. B. C. D. 3. Suppose you have correctly determined some c and n o to prove . Which of the following is not necessarily true? A. c may be increased B. c may be decreased C. n o may be increased D. 4. Suppose you are using the substitution method to establish a Θ bound on a recurrence and you already know that and . Which of the following cannot be shown as an improvement?...
View
Full Document
 Spring '12
 BOBWEEMS
 Dynamic Programming, Sort, B., c., A. B. C. D

Click to edit the document details