(A) O(n) time
(B) O(n^2) time
(C) O(nlogn) time
(D) O(n^3) time
A point p is said to dominated by point q if p.x ≤ q.x and p.y ≤ q.y?
(A) True
(B) False
(C) NA
(D) NA
We write out the loops as summations and then solve the summations?
(A) True
(B) False
(C) NA
(D) NA
Given a finite sequence of values a1, a2, . . . , an, their sum a1 + a2 + . . . + an is expressed in summation notation as Sigma (i=1 –> n)ai?
(A) True
(B) False
(C) NA
(D) NA
We will say that the worst-case running time is Θ(n^2). This is called __.
(A) the asymptotic growth rate of the function
(B) itteration growth rate of the function
(C) recursive growth rate of the function
(D) none
When n is large, n^2 term will be much larger than the n term and will dominate the running time?
(A) True
(B) False
(C) NA
(D) NA
__ is the average running time over all inputs of size n. Let p(I) denote the probability of seeing this input. The average-case time is the weighted sum of running times with weights.
(A) Worst-case time
(B) Average-case time
(C) Constant-case time
(D) none
There are no formal rules to the syntax of the pseudo code?
(A) True
(B) False
(C) NA
(D) NA