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

16. When s be a sorted array of n integers, and t(n) denote the time taken for the most efficient algorithm to determine if there are two elements with sum less than 1000 in s, then which of the following statements is true?

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

17. Consider the following functions
f(n) = 3n^√n
g(n) = 2n^√nlog₂n
h(n) = ∠n
Which of the following is true?

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

18. Let f, g, h, k : N → N.
Iff = O(h) and g = O(k), then

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

19. Let f is a total function from N to N and that f' = O(p) for some polynomial function p. When C and D are constants, then for every n

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

20. For any total computable function f : N + N, there is a step-counting functioning so that for every n

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.