Algorithms
Complexity Analysis and Asymptotic Notations
Marks 1Marks 2
Searching and Sorting
Marks 1Marks 2
Divide and Conquer Method
Marks 1Marks 2
Greedy Method
Marks 1Marks 2
P and NP Concepts
Marks 1Marks 2
Dynamic Programming
Marks 1Marks 2
1
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+1
-0.33

Consider the following three functions.

f1 = 10n, f2 = nlogn, f3 = n√n

Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

A
f1 , f2, f3
B
f2, f1, f3
C
f3, f2, f1
D
f2, f3, f1
2
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
For parameters a and b, both of which are $$\omega \left( 1 \right)$$,
T(n) = $$T\left( {{n^{1/a}}} \right) + 1$$, and T(b) = 1.
Then T(n) is
A
$$\Theta \left( {{{\log }_a}{{\log }_b}n} \right)$$
B
$$\Theta \left( {{{\log }_{ab}}n} \right)$$
C
$$\Theta \left( {{{\log }_b}{{\log }_a}n} \right)$$
D
$$\Theta \left( {{{\log }_2}{{\log }_2}n} \right)$$
3
GATE CSE 2017 Set 1
MCQ (Single Correct Answer)
+1
-0.33

Consider the following functions from positive integers to real numbers :

$10, \sqrt{n}, n, \log _2 n, \frac{100}{n}$.

The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is :

A
$\log _2 n, \frac{100}{n}, 10, \sqrt{n}, n$
B
$\frac{100}{n}, 10, \log _2 n, \sqrt{n}, n$
C
$10, \frac{100}{n}, \sqrt{n}, \log _2 n, n$
D
$\frac{100}{n}, \log _2 n, 10, \sqrt{n}, n$
4
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the equality $$\sum\limits_{i = 0}^n {{i^3}} = X$$ and the following choices for $$X$$
$$\eqalign{ & \,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,\,\Theta \left( {{n^4}} \right) \cr & \,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,\,\Theta \left( {{n^5}} \right) \cr & \,\,\,{\rm I}{\rm I}{\rm I}.\,\,\,\,\,\,O\left( {{n^5}} \right) \cr & \,\,\,{\rm I}V.\,\,\,\,\,\,\Omega \left( {{n^3}} \right) \cr} $$
The equality above remains correct if $$𝑋$$ is replaced by
A
Only $${\rm I}$$
B
Only $${\rm II}$$
C
$${\rm I}$$ or $${\rm III}$$ or $${\rm IV}$$ but not $${\rm II}$$
D
$${\rm II}$$ or $${\rm III}$$ or $${\rm IV}$$ but not $${\rm I}$$
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization