(A) True
(B) False
(C) NA
(D) NA
Tag: Fundamentals of Algorithms
The sieve technique is a special case, where the number of subproblems is __.
(A) 3
(B) 1
(C) just 1
(D) 0
We think of divide-and-conquer as breaking the problem into a small number of bigger sub-problems, which are then solved recursively?
(A) True
(B) False
(C) NA
(D) NA
A very important special case of divide-and-conquer, which I call the sieve technique?
(A) True
(B) False
(C) NA
(D) NA
In particular, is it possible to solve the selections problem in O(n) time?
(A) no
(B) yes
(C) yes. However, the solution is far from obvious
(D) NA
Central tendency of a set is useful when the distribution of values is __.
(A) skewed
(B) not skewed
(C) highly skewed
(D) straight
Medians are useful as a measures of the __ of a set.
(A) mode
(B) average
(C) probability
(D) central tendency
When n is even, for median , there are two choices: __.
(A) n/2
(B) (n + 1)/2
(C) n/2 and (n + 1)/2
(D) none