CS502 Quiz No.1 Shared by Hammad, Spring 2014

Question # 1 of 10
Analysis of Selection algorithm ends up with,
Select correct option:
T(n) (p37)
T(1 / 1 + n)
T(n / 2)
T((n / 2) + n)

Question # 2 of 10
The function f(n)= n(logn+1)/2 is asymptotically equivalent to n log n. Hre Upper Bound means the function f(n) grows asymptotically ____________ faster than n log n.
Select correct option:
More
Quiet
Not (p24)
At least

Question # 3 of 10
The running time of an algorithm would not depend upon the optimization by the compiler but that of an implementation of the algorithm would depend on it.
Select correct option:
True
False (p7)

Question # 4 of 10 ( Start time: 03:26:18 PM ) Total Marks: 1
After sorting in merge sort algorithm, merging process is invoked.
Select correct option:
=True (p27)
False

Question # 5 of 10
Asymptotic growth rate of the function is taken over_________ case running time.
Select correct option:
Best
Average
Worst (p14 Note sure)
Normal

Question # 6 of 10
In analysis of f(n)=n(n/5)+n-10 log n, f(n) is asymptotically equivalent to ________.
Select correct option:
n
2n
n+1
= n2 (p23)

Question # 7 of 10
f(n) and g(n) are asymptotically equivalent. This means that they have essentially the same __________ for large n.
Select correct option:
Results
Variables
Size
= Growth rates (p23)

Question # 8 of 10
Algorithm is concerned with.......issues.
Select correct option:
Macro
Micro
Both Macro & Micro (p8)
Normal

Question # 9 of 10
We can not make any significant improvement in the running time which is better than that of brute-force algorithm.
Select correct option:
True
False

Question # 10 of 10
In addition to passing in the array itself to Merge Sort algorithm, we will pass in _________other arguments which are indices.
Select correct option:
Two (p28)
Three
Four
Five