Time Left - 15:00 mins
Asymptotic Notations - II Starter Quiz
Attempt now to get your rank among 72 students!
Question 1
Consider the recurrence function:
T(n)=
Then T(n) in terms of notation is?
Question 2
Which of the given choices is the correct time complexity of the following code?
for (k = 1; k < (n + 1); k++)
for (m = 1; m < (n + 1); m + = k)
for (k = 1; k < (n + 1); k++)
for (m = 1; m < (n + 1); m + = k)
x = x + 1;
Question 3
Consider the following statement:
S1 : f(n) = O(f(n)2)
S2 : If f(n) = Ω(g(n)) then f(n)=O(g(n))
S3 : If f(n) O(g(n)) then g(n) O(f(n))
Which of the following statements are always true?
Question 4
Given below are some recurrence relation and some asymptotic complexities:
Question 5
What is the time complexity of following code ?
Question 6
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
f1(n) = 2n
f2(n) = n3/2
f3(n) = nLogn
f4(n) = nlog n
Question 7
Consider the following three claims
- (n + k)m = Θ(nm), where k and m are constants
- 2n + 1 = O(2n)
- 22n + 1 = O(2n)
Which of these claims are correct ?
- 72 attempts
- 1 upvote
- 2 comments
Tags :
GATE & PSU CSGeneralJul 2GATE & PSU CS