Data Structures and Algorithms - Performance Analysis of Algorithms and Recurrences

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Data Structures and Algorithms > > Performance Analysis of Algorithms and Recurrences

11. The recurrence relation that arises in relation with the complexity of binary search is

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

12. Consider the following two functions

Which of the following is true?

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

13. The recurrence relation
T(1) = 2
T(n) = 3T(n/4) + n
has the solution T(n) equal to

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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?

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Performance Analysis of Algorithms and Recurrences

Forgot your password?

I agree with the Terms.