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

6. f(n) is of the order of g(n) if there exist positive integers "a" and "b" such that

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

7. The running time of an algorithm T(n) where (n) is the input size is given by
T(n) = 8T (n/2) + qn, if n > 1
p, if n = 1
where p, q are constants. The order of the algorithm is

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

8. The running time T(n), where (n) is the input size of a recursive algorithm is given as follows :
T(n) = C + T(n - 1); if n > 1
= d, if n ≤ 1
The order of the algorithm 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.

9. Consider following two functions
f(n) = n³, if 0 ≤ n < 10,000
n², otherwise
g(n) = n, if 0 ≤ n < 100
n² + 5n, otherwise
Which of the following are 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.

10. The complexity of comparison based sorting algorithms is

Answer
Comment
Array

Option :
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.