Time Left - 15:00 mins
GATE 2025 algorithm Foundation Quiz 6
Attempt now to get your rank among 50 students!
Question 1
Choose the correct importance of asymptotic notations.
Question 2
Executing an algorithm with time complexity O(n) and then an algorithm with time complexity O(n log n) gives an algorithm with Big-Oh time complexity ____?
Question 3
What is Analysis of Algorithm?
Question 4
Executing an algorithm with time complexity O(n2) exactly 10 times gives an algorithm with Big-Oh time complexity ___?
Question 5
The Time Complexity of above algorithm is ?
- 50 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSAlgorithmsNov 18GATE & PSU CS
