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

GATE CSE 2024 Set 1

MCQ (Single Correct Answer)

-0.33

Given an integer array of size $N$, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The worst-case time complexity of this algorithm is

both $O(N)$ and $\Omega(N)$

$O(N)$ but not $\Omega(N)$

$\Omega(N)$ but not $O(N)$

neither $O(N)$ nor $\Omega(N)$

GATE CSE 2024 Set 1

MCQ (Single Correct Answer)

-0.66

Consider the following recurrence relation:

$$T(n) = \begin{cases} \sqrt{n} T(\sqrt{n}) + n & \text{for } n \ge 1, \\ 1 & \text{for } n = 1. \end{cases}$$

Which one of the following options is CORRECT?

$$T(n) = \Theta(n \log \log n)$$

$$T(n) = \Theta(n \log n)$$

$$T(n) = \Theta(n^2 \log n)$$

$$T(n) = \Theta(n^2 \log \log n)$$

GATE CSE 2024 Set 1

MCQ (More than One Correct Answer)

-0

Which of the following is/are Bottom-Up Parser(s)?

Shift-reduce Parser

Predictive Parser

LL(1) Parser

LR Parser

GATE CSE 2024 Set 1

MCQ (Single Correct Answer)

-0.66

Consider the following syntax-directed definition (SDD).


S → DHTU	{ S.val = D.val + H.val + T.val + U.val; }
D → “M” D₁	{ D.val = 5 + D₁.val; }
D → ε	{ D.val = –5; }
H → “L” H₁	{ H.val = 5 * 10 + H₁.val; }
H → ε	{ H.val = –10; }
T → “C” T₁	{ T.val = 5 * 100 + T₁.val; }
T → ε	{ T.val = –5; }
U → “K”	{ U.val = 5; }

Given “MMLK” as the input, which one of the following options is the CORRECT value computed by the SDD (in the attribute S.val)?

GATE CSE Papers

2024