Lower bound f(n) = 8n2 + 2n - 3 grows asymptotically at least as fast as n^2.
a) True
b) False
c) NA
d) N/A
This is written as "f(n) E O(g(n))" That is, f(n) and g(n) are asymptotically equivalent. This means that they have essentially the.....growth rates for large n.
a) different
b) same
c) NA
d) N.A
If n is not very large, then almost any algorithm………be fast.
a) may
b) may be not
c) will
d) none
For n = 1,000,000, if plane-sweep takes 1 second, the brute force will take about....
a) 14 hours
b) 14 minutes
c) 14 second
d) none
The runtime of entire plane-sweep algorithm is O(n log n).....
a) True
b) False
c) NA
d) NA
Plane-sweep Algorithm, the inner while-loop.......execute more than n times over the entire course of the algorithm.
a) can
b) cannot
c) NA
d) N/A
