Time Left - 15:00 mins
Asymptotic Notations - I Starter Quiz
Attempt now to get your rank among 77 students!
Question 1
What does it mean when we say that an algorithm X is asymptotically more efficient than Y?
Question 2
Suppose f(n) = O(n2),g(n) = Ω(n2) and h(n) = Ω(n) then [f(n) +(g(n) . h(n))]will be
Question 3
The Little ω notation is?
Question 4
Unsigned int f(unsigned int n, unsigned int r)
What is the Time Complexity of the above program?
Question 5
Consider f(n), g(n) and h(n) be function defined as follows:
f(n) = Ω(n3)
g(n) = O(n2)
h(n) = θ(n2)
Which of the following represents correct asymptotic for
Question 6
Which of the following is correct?
Question 7
Consider the following functions:
f(n) = 2log2n
g(n) = nlog2n
h(n) = n1/log2n
Which of the following statements about the asymptotic behavior of f(n), g(n) and h(n) is true?
- 77 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSGeneralOct 18GATE & PSU CS