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

Consider the following statements.

S1 : The sequence of procedure calls corresponds to a preorder traversal of the activation tree.

S2 : The sequence of procedure returns corresponds to a postorder traversal of the activation tree.

Which one of the following options is correct?

A
S1 is true and S2 is true
B
S1 is false and S2 is true
C
S1 is false and S2 is false
D
S1 is true and S2 is false
3
GATE CSE 2021 Set 1
MCQ (More than One Correct Answer)
+2
-0.67

Define Rn to be the maximum amount earned by cutting a rod of length n meters into one or more pieces of integer length and selling them. For i > 0, let p[i] denotes the selling price of a rod whose length is i meters. Consider the array of prices:

p[1] = 1, p[2] = 5, p[3] = 8, p[4] = 9, p[5] = 10, p[6] = 17, p[7] = 18

Which of the following statements is/are correct about R7?

A
R7 cannot be achieved by a solution consisting of three pieces.
B
R7 = 19
C
R7 = 18
D
R7 is achieved by three different solutions.
4
GATE CSE 2021 Set 1
MCQ (More than One Correct Answer)
+2
-0.67

Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery.

Which of the following statements is/are correct?

A
The same undo and redo list will be used while recovering again.
B
The database will become inconsistent.
C
All the transactions that are already undone and redone will not be recovered again.
D
The system cannot recover any further.
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12