Time Left - 15:00 mins
GATE 2022: Algorithm Quiz-2
Attempt now to get your rank among 374 students!
Question 1
The concept of order (Big O) is important because
Question 2
The running time of an algorithm is represented by the following recurrence relation:
Which one of the following represents the time complexity of the algorithm?
Which one of the following represents the time complexity of the algorithm?
Question 3
What is the time complexity of following code-
Question 4
Number of times hello will be printed?
Question 5
State whether the following is true of false.
f(n) = o(g(n))
iff
2f(n) = o(2g(n))
Enter 1 for true or 0 for false.
Question 6
Write the time complexity of following program, you have to write only power of n ______.
(ex: if n power is 1 write 1 or power is root then write 0.5 or if power is 2/5 write 0.4 or if power is 7/5 write it as 1.4 ans so on.)
Here n is always prime.
- 374 attempts
- 0 upvotes
- 3 comments
Tags :
GATE & PSU CSAlgorithmsAug 6GATE & PSU CS