The running time of an algorithm is T (n) = log² n if the input n is squared, then the running time is increased by 1

Select one:

True

False

2)

If there are 2 algorithms F1(n) =n³/10 and F2(n)=100n² then we can say

Select one:

a.

F1 has always less time for large input

b.

F1 has always less time

c.

F2 has always less time for large input

d.

F2 has always less time

3)

One of the following algorithm considered as exhaustive search

a.

Quick sort

b.

Assignment job

c.

Binary search

d.

Closest pair