1
GATE CSE 2021 Set 2
MCQ (Single Correct Answer)
+1
-0.33
Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in H?
A
θ(log n)
B
θ(n)
C

θ(1)

D
θ(n log n)
2
GATE CSE 2021 Set 2
MCQ (Single Correct Answer)
+1
-0.33
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?
A
θ(n)
B
θ(√n)
C
θ(log2(n))
D
θ(n2)
3
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+1
-0.33
A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than the maximum element in T?
A
Θ(1)
B
Θ(n log n)
C
Θ(log n)
D
Θ(n)
4
GATE CSE 2019
Numerical
+1
-0
Consider a sequence of 14 elements : A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum $$S\left( {i,j} \right) = \sum\limits_{k = 1}^j {A\left[ k \right]} $$. Determine the maximum of S(i, j), where 0 ≤ i ≤ j < 14. (Divide and conquer approach may be used)

Answer : ________.
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP