GATE CSE 2021 Set 1 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

-0.67

Let P be an array containing n integers. Let t be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary of n elements. Which one of the following choices is correct?

t > 2n - 2

$$t > 3\left\lceil {\frac{n}{2}} \right\rceil $$ and t ≤ 2n - 2

t > n and $$t \le 3\left\lceil {\frac{n}{2}} \right\rceil $$

$$t > \left\lceil {{{\log }_2}(n)} \right\rceil $$ and t ≤ n

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

-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?

Θ(1)

Θ(n log n)

Θ(log n)

Θ(n)

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

-0.67

Consider the following statements.

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

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

Which one of the following options is correct?

S₁ is true and S₂ is true

S₁ is false and S₂ is true

S₁ is false and S₂ is false

S₁ is true and S₂ is false

GATE CSE 2021 Set 1

MCQ (More than One Correct Answer)

-0.67

Define R_n 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 R₇?

R₇ cannot be achieved by a solution consisting of three pieces.

R₇ = 19

R₇ = 18

R₇ is achieved by three different solutions.

PREVIOUS NEXT

GATE CSE Papers

2024