1
GATE CSE 2019
MCQ (Single Correct Answer)
+2
-0.67
Consider the following statements:

I. The smallest element in a max-heap is always at a leaf node
II. The second largest element in a max-heap is always a child of the root node
III. A max-heap can be constructed from a binary search tree in Θ(n) time
IV. A binary search tree can be constructed from a max-heap in Θ(n) time

Which of the above statements are TRUE?
A
I, II and III
B
I, III and IV
C
I, II and IV
D
II, III and IV
2
GATE CSE 2014 Set 1
Numerical
+2
-0
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is ________
Your input ____
3
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider the following pseudo code. What is the total number of multiplications to be performed?
D = 2
for i = 1 to n do
   for j = i to n do
      for k = j + 1 to n do
           D = D * 3
A
Half of the product of the 3 consecutive integers.
B
One-third of the product of the 3 consecutive integers.
C
One-sixth of the product of the 3 consecutive integers.
D
None of the above.
4
GATE CSE 2013
MCQ (Single Correct Answer)
+2
-0.6
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.
MultiDequeue(Q){
   m = k
   while (Q is not empty and m  > 0) {
      Dequeue(Q)
      m = m - 1
   }
}
What is the worst case time complexity of a sequence of n operations on an initially empty queue?
A
$$\Theta (n)$$
B
$$Θ(n + k)$$
C
$$Θ(nk)$$
D
$$Θ(n^2)$$
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