1
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+2
-0.67
Change Language

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 2021 Set 1
MCQ (Single Correct Answer)
+2
-0.67

Consider the following recurrence relation.

$$T(n) = \left\{ {\begin{array}{*{20}{c}} {T(n/2) + T(2n/5) + 7n \ \ \ if\ n > 0}\\ {1\ \ \ \ \ \ \ if\ n = 0} \end{array}} \right.$$

Which one of the following option is correct?

A
T(n) = Θ(n log n)
B
T(n) = Θ(n5/2)
C
T(n) = Θ((log n)5/2)
D
T(n) = Θ(n)
3
GATE CSE 2019
MCQ (Single Correct Answer)
+2
-0.67
There are n unsorted arrays: A1, A2, ..., An. Assume that n is odd. Each of A1, A2, ..., An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, ..., An is
A
$$O\left( n \right)$$
B
$$O\left( {n\log n} \right)$$
C
$$O\left( {{n^2}\log n} \right)$$
D
$$O\left( {{n^2}} \right)$$
4
GATE CSE 2016 Set 2
Numerical
+2
-0
The given diagram shows the flowchart for a recursive function $$A(n).$$ Assume that all statements, except for the recursive calls, have $$O(1)$$ time complexity. If the worst case time complexity of this function is $$O\left( {{n^\alpha }} \right),$$ then the least possible value (accurate up to two decimal positions) of $$\alpha $$ is ____________ . GATE CSE 2016 Set 2 Algorithms - Complexity Analysis and Asymptotic Notations Question 8 English
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12