Previous GATE Questions / GATE Overflow for GATE CSE

1 votes

1 answer

81

GATE CSE 2024 | Set 1 | Question: 16
Which of the following is/are Bottom-Up Parser(s)? Shift-reduce Parser Predictive Parser LL$(1)$ Parser LR Parser

Which of the following is/are Bottom-Up Parser(s)?Shift-reduce ParserPredictive ParserLL$(1)$ Parser LR Parser

Arjun

2.1k views

Arjun asked Feb 16

1 votes

1 answer

82

GATE CSE 2024 | Set 1 | Question: 17
Let $A$ and $B$ be two events in a probability space with $P(A)=0.3, P(B)=0.5$, and $P(A \cap B)=0.1$. Which of the following statements is/are TRUE? The two events $A$ and $B$ are independent $P(A \cup B)=0.7$ ... $B$ $P\left(A^c \cap B^c\right)=0.4$, where $A^c$ and $B^c$ are the complements of the events $A$ and $B$, respectively

Let $A$ and $B$ be two events in a probability space with $P(A)=0.3, P(B)=0.5$, and $P(A \cap B)=0.1$. Which of the following statements is/are TRUE?The two events $A$ an...

Arjun

2.0k views

Arjun asked Feb 16

2 votes

1 answer

83

GATE CSE 2024 | Set 1 | Question: 18
Consider the circuit shown below where the gates may have propagation delays. Assume that all signal transitions occur instantaneously and that wires have no delays. Which of the following statements about the circuit is/are CORRECT? With no propagation ... , the output $Y$ can have a transient logic Zero after $X$ transitions from logic One to logic Zero

Consider the circuit shown below where the gates may have propagation delays. Assume that all signal transitions occur instantaneously and that wires have no delays...

Arjun

2.4k views

Arjun asked Feb 16

2 votes

1 answer

84

GATE CSE 2024 | Set 1 | Question: 19
$\mathrm{TCP}$ client $\mathrm{P}$ successfully establishes a connection to $\text{TCP}$ server $\mathrm{Q}$. Let $\text{N}_{P}$ denote the sequence number in the $\text{SYN}$ sent from $\mathrm{P}$ to $\mathrm{Q}$. Let $\text{N}_{Q}$ denote the ... $\text{N}_{P}$ The acknowledgement number $\text{N}_{Q}$ is equal to $\text{N}_{P}+1$

$\mathrm{TCP}$ client $\mathrm{P}$ successfully establishes a connection to $\text{TCP}$ server $\mathrm{Q}$. Let $\text{N}_{P}$ denote the sequence number in the $\te...

Arjun

1.8k views

Arjun asked Feb 16

2 votes

2 answers

85

GATE CSE 2024 | Set 1 | Question: 20
Consider a $5$-stage pipelined processor with Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Memory Access (MEM), and Register Writeback (WB) stages. Which of the following statements about forwarding is/are ... cannot prevent all pipeline stalls Forwarding does not require any extra hardware to retrieve the data from the pipeline stages

Consider a $5$-stage pipelined processor with Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Memory Access (MEM), and Register Writeback (WB) stages. Whic...

Arjun

4.0k views

Arjun asked Feb 16

2 votes

1 answer

86

GATE CSE 2024 | Set 1 | Question: 21
Which of the following fields is/are modified in the $\text{IP}$ header of a packet going out of a network address translation $\text{(NAT)}$ device from an internal network to an external network? Source $\text{IP}$ Destination $\text{IP}$ Header Checksum Total Length

Which of the following fields is/are modified in the $\text{IP}$ header of a packet going out of a network address translation $\text{(NAT)}$ device from an internal netw...

Arjun

2.1k views

Arjun asked Feb 16

0 votes

1 answer

87

GATE CSE 2024 | Set 1 | Question: 22
Let $A$ and $B$ be non-empty finite sets such that there exist one-to-one and onto functions $\text{(i)}$ from $A$ to $B$ and $\text{(ii)}$ from $A \times A$ to $A \cup B$. The number of possible values of $\text{|A|}$ is ___________.

Let $A$ and $B$ be non-empty finite sets such that there exist one-to-one and onto functions $\text{(i)}$ from $A$ to $B$ and $\text{(ii)}$ from $A \times A$ to $A \cup B...

Arjun

1.8k views

Arjun asked Feb 16

3 votes

1 answer

88

GATE CSE 2024 | Set 1 | Question: 23
Consider the operator precedence and associativity rules for the integer arithmetic operators given in the table below. Operator Precedence Associativity + Highest Left - High Right * Medium Right / Low Right The value of the expression $3+1+5 * 2 / 7+2-4-7-6 / 2$ as per the above rules is ________.

Consider the operator precedence and associativity rules for the integer arithmetic operators given in the table below.Operator PrecedenceAssociativity+Highest Left-HighR...

Arjun

2.6k views

Arjun asked Feb 16

2 votes

2 answers

89

GATE CSE 2024 | Set 1 | Question: 24
The number of spanning trees in a complete graph of $4$ vertices labelled $\text{A, B, C,}$ and $\text{D}$ is _________.

The number of spanning trees in a complete graph of $4$ vertices labelled $\text{A, B, C,}$ and $\text{D}$ is _________.

Arjun

2.0k views

Arjun asked Feb 16

1 votes

1 answer

90

GATE CSE 2024 | Set 1 | Question: 25
Consider the following two relations, $R(A, B)$ and $S(A, C)$: $R$ $A$ $B$ $10$ $20$ $20$ $30$ $30$ $40$ $30$ $50$ $50$ $95$ $S$ $A$ $C$ $10$ $90$ $30$ $45$ $40$ $80$ The total number of tuples obtained by evaluating the following expression $\sigma_{B<C}\left(R \bowtie_{R . A=S . A} S\right)$ is ___________.

Consider the following two relations, $R(A, B)$ and $S(A, C)$:$R$$A$$B$$10$$20$$20$$30$$30$$40$$30$$50$$50$$95$$S$$A$$C$$10$$90$$30$$45$$40$$80$The total number of tuples...

Arjun

1.8k views

Arjun asked Feb 16

0 votes

3 answers

91

GATE CSE 2024 | Set 1 | Question: 26
Consider a network path $\mathrm{P}-\mathrm{Q}-\mathrm{R}$ between nodes $\mathrm{P}$ and $\mathrm{R}$ via router $\mathrm{Q}$. Node $\mathrm{P}$ sends a file of size $10^6$ bytes to $\text{R}$ via this path by splitting the file into chunks of ... $3$ decimal places) at which $\mathrm{R}$ receives all the chunks of the file? $8.000$ $8.008$ $15.992$ $16.000$

Consider a network path $\mathrm{P}-\mathrm{Q}-\mathrm{R}$ between nodes $\mathrm{P}$ and $\mathrm{R}$ via router $\mathrm{Q}$. Node $\mathrm{P}$ sends a file of size $10...

Arjun

2.2k views

Arjun asked Feb 16

0 votes

2 answers

92

GATE CSE 2024 | Set 1 | Question: 27
Consider the following syntax-directed definition $\text{(SDD)}$. $S \rightarrow D H T U$ $ \left\{S.v a l = D.val + H.val + T.val + U.val\right\};$ $D \rightarrow ^{"} \mathrm{M}^{"} D_1$ ... the following options is the $\text{CORRECT}$ value computed by the $\text{SDD}$ (in the attribute $S.val$)? $45$ $50$ $55$ $65$

Consider the following syntax-directed definition $\text{(SDD)}$.$S \rightarrow D H T U$$ \left\{S.v a l = D.val + H.val + T.val + U.val\right\};$$D \rightarrow ^{"} \...

Arjun

2.0k views

Arjun asked Feb 16

0 votes

1 answer

93

GATE CSE 2024 | Set 1 | Question: 28
Consider the following grammar $G$, with $S$ as the start symbol. The grammar $G$ has three incomplete productions denoted by $(1), (2)$, and $(3)$ ... $R \rightarrow c R$ (1) $S \rightarrow R f$ (2) $T \rightarrow c T$ (3) $R \rightarrow c R$

Consider the following grammar $G$, with $S$ as the start symbol. The grammar $G$ has three incomplete productions denoted by $(1), (2)$, and $(3)$.$$\begin{aligned} & S ...

Arjun

1.7k views

Arjun asked Feb 16

0 votes

1 answer

94

GATE CSE 2024 | Set 1 | Question: 29
Consider the following pseudo-code. $L 1 : t 1 = -1$ $L 2: t 2 = 0$ $L 3: t 3 = 0$ $L 4: t 4 = 4 * t 3$ $L 5: t 5 = 4 * t 2$ $L 6: t 6 = t 5 * M$ $L 7: t 7 = t 4+t 6$ ... options CORRECTLY specifies the number of basic blocks and the number of instructions in the largest basic block, respectively? $6$ and $6$ $6$ and $7$ $7$ and $7$ $7$ and $6$

Consider the following pseudo-code.$L 1 : t 1 = -1$ $L 2: t 2 = 0$ $L 3: t 3 = 0$ $L 4: t 4 = 4 * t 3$$L 5: t 5 = 4 * t 2$$L 6: t 6 = t 5 * M$$L 7: t 7 = t 4+t 6$$L 8: t ...

Arjun

1.9k views

Arjun asked Feb 16

0 votes

2 answers

95

GATE CSE 2024 | Set 1 | Question: 30
Consider the following two threads $\mathrm{T} 1$ and $\mathrm{T} 2$ that update two shared variables $\mathrm{a}$ and $\mathrm{b}$. Assume that initially $\mathrm{a}=\mathrm{b}=1$ ...

Consider the following two threads $\mathrm{T} 1$ and $\mathrm{T} 2$ that update two shared variables $\mathrm{a}$ and $\mathrm{b}$. Assume that initially $\math...

Arjun

2.1k views

Arjun asked Feb 16

1 votes

1 answer

96

GATE CSE 2024 | Set 1 | Question: 31
An array $[82,101,90,11,111,75,33,131,44,93]$ is heapified. Which one of the following options represents the first three elements in the heapified array? $82,90,101$ $82,11,93$ $131,11,93$ $131,111,90$

An array $[82,101,90,11,111,75,33,131,44,93]$ is heapified. Which one of the following options represents the first three elements in the heapified array?$...

Arjun

2.4k views

Arjun asked Feb 16

3 votes

3 answers

97

GATE CSE 2024 | Set 1 | Question: 32
Consider the following recurrence relation: $T(n)=\left\{\begin{array}{c}\sqrt{n} T(\sqrt{n})+n \text { for } n \geq 1, \\ 1 \quad \text { for } n=1\end{array}\right.$ Which one of the following options is CORRECT? $T(n)=\Theta(n \log \log n)$ $T(n)=\Theta(n \log n)$ $T(n)=\Theta\left(n^2 \log n\right)$ $T(n)=\Theta\left(n^2 \log \log n\right)$

Consider the following recurrence relation:$T(n)=\left\{\begin{array}{c}\sqrt{n} T(\sqrt{n})+n \text { for } n \geq 1, \\ 1 \quad \text { for } n=1\end{array}\right.$Whic...

Arjun

2.1k views

Arjun asked Feb 16

0 votes

2 answers

98

GATE CSE 2024 | Set 1 | Question: 33
Consider a binary min-heap containing $105$ distinct elements. Let $k$ be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of $k$ is $53$ $52$ $27$ $1$

Consider a binary min-heap containing $105$ distinct elements. Let $k$ be the index (in the underlying array) of the maximum element stored in the heap. The number of pos...

Arjun

2.4k views

Arjun asked Feb 16

1 votes

3 answers

99

GATE CSE 2024 | Set 1 | Question: 34
The symbol $\rightarrow$ indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE? $(X, Y) \rightarrow(Z, W)$ implies $X \rightarrow(Z, W)$ $(X, Y) \rightarrow(Z, W)$ ... $(X, W) \rightarrow Z$ $(X \rightarrow Y$ and $Y \rightarrow Z)$ implies $X \rightarrow Z$

The symbol $\rightarrow$ indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?$(X, Y) \rightarrow(Z, W)$...

Arjun

2.2k views

Arjun asked Feb 16

4 votes

2 answers

100

GATE CSE 2024 | Set 1 | Question: 35
Let $G$ be a directed graph and $T$ a depth first search $\text{(DFS)}$ spanning tree in $G$ that is rooted at a vertex $v$. Suppose $T$ is also a breadth first search $\text{(BFS)}$ tree in $G$, rooted at $v$. Which of the following ... the tree $T$ There are no forward-edge in $G$ with respect to the tree $T$ The only edges in $G$ are the edges in $T$

Let $G$ be a directed graph and $T$ a depth first search $\text{(DFS)}$ spanning tree in $G$ that is rooted at a vertex $v$. Suppose $T$ is also a breadth fir...

Arjun

3.4k views

Arjun asked Feb 16

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true