Questions by Arjun / GATE Overflow for GATE CSE

2 votes

3 answers

141

GATE CSE 2024 | Set 1 | Question: 11
In a $\mathrm{B}+$ tree, the requirement of at least half-full $(50 \%)$ node occupancy is relaxed for which one of the following cases? Only the root node All leaf nodes All internal nodes Only the leftmost leaf node

In a $\mathrm{B}+$ tree, the requirement of at least half-full $(50 \%)$ node occupancy is relaxed for which one of the following cases?Only the root nodeAll leaf nodesAl...

2.3k views

asked Feb 16

3 votes

2 answers

142

GATE CSE 2024 | Set 1 | Question: 12
Which of the following statements about a relation $\mathbf{R}$ in first normal form $\text{(1NF)}$ is/are TRUE? $\mathbf{R}$ can have a multi-attribute key $\mathbf{R}$ cannot have a foreign key $\mathbf{R}$ cannot have a composite attribute $\mathbf{R}$ cannot have more than one candidate key

Which of the following statements about a relation $\mathbf{R}$ in first normal form $\text{(1NF)}$ is/are TRUE?$\mathbf{R}$ can have a multi-attribute key$\mathbf{R}$ ca...

3.6k views

asked Feb 16

1 votes

1 answer

143

GATE CSE 2024 | Set 1 | Question: 13
Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular. Which of the following statements is/are always TRUE? $L_1=L_2$ if and only if $L_1 \cap \overline{L_2}=\phi$ $L_1 \cup L_3$ is not regular $\overline{L_3}$ is not regular $\overline{L_1} \cup \overline{L_2}$ is regular

Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular.Which of the following statements is/are always TRUE?$L_1=L_2$ if and only if $L_1 \c...

2.8k views

asked Feb 16

1 votes

2 answers

144

GATE CSE 2024 | Set 1 | Question: 14
Which of the following statements about threads is/are TRUE? Threads can only be implemented in kernel space Each thread has its own file descriptor table for open files All the threads belonging to a process share a common stack Threads belonging to a process are by default not protected from each other

Which of the following statements about threads is/are TRUE?Threads can only be implemented in kernel spaceEach thread has its own file descriptor table for open filesAll...

3.1k views

asked Feb 16

2 votes

1 answer

145

GATE CSE 2024 | Set 1 | Question: 15
Which of the following process state transitions is/are NOT possible? Running to Ready Waiting to Running Ready to Waiting Running to Terminated

Which of the following process state transitions is/are NOT possible?Running to ReadyWaiting to RunningReady to WaitingRunning to Terminated

2.8k views

asked Feb 16

1 votes

1 answer

146

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

2.1k views

asked Feb 16

1 votes

1 answer

147

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

2.0k views

asked Feb 16

2 votes

1 answer

148

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

2.4k views

asked Feb 16

2 votes

1 answer

149

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

1.8k views

asked Feb 16

2 votes

2 answers

150

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

4.0k views

asked Feb 16

2 votes

1 answer

151

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

2.1k views

asked Feb 16

0 votes

1 answer

152

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

1.8k views

asked Feb 16

3 votes

1 answer

153

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

2.6k views

asked Feb 16

2 votes

2 answers

154

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 _________.

2.0k views

asked Feb 16

1 votes

1 answer

155

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

1.8k views

asked Feb 16

0 votes

3 answers

156

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

2.2k views

asked Feb 16

0 votes

2 answers

157

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 ^{"} \...

1.9k views

asked Feb 16

0 votes

1 answer

158

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

1.7k views

asked Feb 16

0 votes

1 answer

159

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

1.8k views

asked Feb 16

0 votes

2 answers

160

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

2.1k views

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