Create Quiz

Analysis of Algorithms Quiz Question

Analysis of Algorithms Quiz Question

Quiz or Mock Test on Analysis of Algorithms. The quiz contains multiple choice questions for technical interview

You can mute/unmute sounds from here

You May Get Result Of Analysis of Algorithms Quiz Question

Quiz or Mock Test on Analysis of Algorithms. The quiz contains multiple choice questions for technical interview
Quiz or Mock Test on Analysis of Algorithms. The quiz contains multiple choice questions for technical interview
Quiz or Mock Test on Analysis of Algorithms. The quiz contains multiple choice questions for technical interview
Quiz or Mock Test on Analysis of Algorithms. The quiz contains multiple choice questions for technical interview
POST YOUR ANSWER (READ ANSWERS)

Quiz Questions And Answers

What is the time complexity of fun()?

Theta (n)
Theta (n^2)
Both
None

Which of the following is not O(n^2)?

(15^10) * n + 12099
n^1.98
(2^20) * n
n^3 / (sqrt(n))

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of

N
N^2
NlogN
N(logN)^2

What is the time complexity of the below function?

O(n)
O(n^2)
O(nlogn)
O(n(logn)^2)

The following statement is valid. log(n!) = \theta(n log n).

True
False
ANSWERS

Currently, we have no comments. Be first to comment on this quiz.

Analysis of Algorithms Quiz Question : Test Trivia

Ultimate impossible accurate personality honest Quiz Game

How do you rate this quiz?

Average rating 4.8 / 5. Vote: 5
Embed This Quiz
Copy the code below to embed this quiz