info@avatto.com
+91-9920808017
11. The recurrence relation that arises in relation with the complexity of binary search is
T(n) = T(n/2) + K, where K is a constant
T(n) = 2T(n/2) + K, where K is a constant
T(n) = T(n/2) + log n
T(n) = T(n/2) + n
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
12. Consider the following two functions Which of the following is true?
g1(n) is g2(n)
g1(n) is O(n3)
g2(n) is O(g1(n))
g2(n) is O(n)
13. The recurrence relation T(1) = 2 T(n) = 3T(n/4) + n has the solution T(n) equal to
O(n)
O(log n)
O(n3/4)
none of these
14. A polynomial p(x) is such that p(0) = 5, p(1) = 4, p(2) = 9 and p(3) = 20 The minimum degree it can have is
1
2
3
4
15. Let T(n) be the function defined by T(1) = 1, T(n) = 2T ([n/2) + √n for n ≥ 2. Which of the following statement is true?
T(n) = O(√n)
T(n) = O(n)
T(n) = O (log n)
None of these
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
