Algorithms-Master theorem and its applications
This quiz will assess your grip over the Master theorem.
* Required
Name
*
This is a required question
Email-Id
*
This is a required question
Full Address
*
This is a required question
Organization name
*
This is a required question
Answer 1
*
f(n) is always positive.
f(n) is not symmetric.
There exists a number N,such that f(n) > 0 for n>N.
None of the above
This is a required question
Answer 2
*
Θ(n*lg(n))
Θ(lg(n))
Θ(n^2)
Θ(1)
This is a required question
Answer 3
*
Θ(n*lg(n))
Θ(n^2*lg(n))
Θ(n^2)
Θ(lg(n))
This is a required question
Answer 4
*
Θ(n*lg(n))
Θ(n^2*lg(n))
Θ(n^2)
Θ(lg(n))
This is a required question
Answer 5
*
Θ(n)
Θ(n*lg(n))
Θ(n^2)
Θ(lg(n))
This is a required question
Answer 6
*
Θ(n)
Θ(lg(n))
Θ(n^2)
Θ(n*lg(n))
This is a required question
Answer 7
*
Θ(n^2)
Θ(n^2*lg(n))
Θ(n^3)
Θ(n*lg(n))
This is a required question
Answer 8
*
Yes
No
This is a required question
Answer 9
*
Yes.It can be applied to every recurrence.
No.It cannot be applied to all recurrences.
This is a required question
Answer 10
*
4
16
49
8
This is a required question
Never submit passwords through Google Forms.