We will say that the worst-case running time is e(n^2). This is called.....
a) the asymptotic growth rate of the function
b) iteration 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(1) 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) N/A
d) NA
Brute-force algorithm is defined as, It is a very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement?
a) True
b) False
c) NA
d) NA
Given a set of n points, P = {p1, p2,..., pn} in 2-space a point is said to be it is not dominated by any other point in P.
a) maximal
b) minimal
c) average
d) none
