1/21/2021 Algorithm ST-1
Algorithm ST-1
Your email address ([Link].it19@[Link]) will be recorded when you submit this
form. Not you? Switch account
* Required
Solve the following given recurrence relation: T(n) = 4T(n/2)+ n^2 1 point
(d) None of the above
Θ(n^2)
Θ (n^2 log n)
Θ (n log n)
Clear selection
1 point
(b) log n
(a) n
(c) n^n
(d) n^2
Clear selection
[Link] 1/7
1/21/2021 Algorithm ST-1
Consider the given code: y = y + z; for (i = 1; i < = n; i++) k = k + 2; for (i = 1; i < 1 point
= n; i++) { for(j = 1; j < = n; j++) x = x + 1; } What is the time complexity of the
given code?
O(n^2 log n)
O(n log n)
O(n^2)
O(n^3)
Clear selection
The solution of the Recurrence Relation T(n) = T(√n) + 1 1 point
Θ (log log n)
O (log n)
O (n log n)
Θ (n log n)
Clear selection
Big-O estimate for the factorial function, that is, n!, is given by 1 point
O(n!)
O(n ×n!)
O( √n)
O(n^n)
Clear selection
[Link] 2/7
1/21/2021 Algorithm ST-1
Name *
Tushar Khatri
The solution of the Recurrence Relation T(n) = T(αn) + T((1-α)n) + n 1 point
O (n log n)
Θ (log log n)
Θ (n^2 log n)
Θ (n)
Clear selection
Write your Complete Roll No *
2019UIT3049
1 point
A(n) = Θ(W(n))
A(n) = Ω (W(n))
A(n) = O(W(n))
A(n) = o(W(n))
Clear selection
[Link] 3/7
1/21/2021 Algorithm ST-1
If f(n) = n log n then which of the following is FALSE? 1 point
f(n) = Θ (n log n)
f(n) = O(n^2 log n)
f(n) = Ω (log n * log n)
f(n) = Ω (n^2)
Clear selection
1 point
A1
A3
A2
A4
Clear selection
[Link] 4/7
1/21/2021 Algorithm ST-1
1 point
f(n) - g(n)
Min (f(n), g(n))
f(n) + g(n)
Max (f(n), g(n))
Clear selection
1 point
O(n^2)
O(n log n)
O(2^n)
O(n)
Clear selection
[Link] 5/7
1/21/2021 Algorithm ST-1
Consider the following segment of C-code: int j,n ; j=1;while (j<=n) j=j*2; The 1 point
number of comparisons made in the execution of the loop for any n > 0 is:
[log n] - 1
log n
[log n] + 1
Clear selection
Consider the given Recurrence Relation, T(n) = 2n T(n/3) + n, Which of the 1 point
following is TRUE?
It comes under case 3 of Master theorem.
It comes under case 2 of Master theorem.
It comes under case 1 of Master theorem.
Master theorem cannot be applied here.
Clear selection
1 point
It is the lower bound of the growth rate of the algorithm
It determines the maximum size of a problem that can be solved in a given system, in
a given amount of time
None of the above
It can be used to decide the best algorithm that solves a given problem
Clear selection
[Link] 6/7
1/21/2021 Algorithm ST-1
The minimum number of comparisons required to find the minimum and 1 point
the maximum of n numbers is
n2
2.5*n - 1
n log n
1.5*n -2
Clear selection
Submit
Never submit passwords through Google Forms.
This form was created inside of Netaji Subhas University of Technology. Report Abuse
Forms
[Link] 7/7
