GATE 2022: Algorithm Quiz-2
Attempt now to get your rank among 306 students!
The concept of order (Big O) is important because
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?
What is the time complexity of following code-
Number of times hello will be printed?
State whether the following is true of false.
f(n) = o(g(n))
2f(n) = o(2g(n))
Enter 1 for true or 0 for false.
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.
- 306 attempts
- 0 upvotes
- 3 comments
Aug 6GATE & PSU CS