Previous GATE Questions / GATE Overflow for GATE CSE

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

1.9k 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.8k 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.3k 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.3k 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.3k views

Arjun asked Feb 16

1 votes

1 answer

101

GATE CSE 2024 | Set 1 | Question: 36
Consider the following read-write schedule $\text{S}$ over three transactions $T_{1}, T_{2}$, and $T_{3}$ ... to $\text{S}$? $T_{1} T_{2} T_{3}$ $T_{1} T_{3} T_{2}$ $T_{3} T_{2} T_{1}$ $T_{3} T_{1} T_{2}$

Consider the following read-write schedule $\text{S}$ over three transactions $T_{1}, T_{2}$, and $T_{3}$, where the subscripts in the schedule indicate trans...

Arjun

2.3k views

Arjun asked Feb 16

0 votes

2 answers

102

GATE CSE 2024 | Set 1 | Question: 37
Consider a Boolean expression given by $\text{F(X, Y, Z)}=\sum(3,5,6,7)$. Which of the following statements is/are CORRECT? $\text{F(X, Y, Z)}=\Pi(0,1,2,4)$ $\text{F(X, Y, Z)=X Y+Y Z+X Z}$ $\text{F(X, Y, Z)}$ is independent of input $\text{Y}$ $\text{F(X, Y, Z)}$ is independent of input $\text{X}$

Consider a Boolean expression given by $\text{F(X, Y, Z)}=\sum(3,5,6,7)$.Which of the following statements is/are CORRECT?$\text{F(X, Y, Z)}=\Pi(0,1,2,4)$ $\text{F(X, Y, ...

Arjun

2.0k views

Arjun asked Feb 16

2 votes

2 answers

103

GATE CSE 2024 | Set 1 | Question: 38
Consider the following $\mathrm{C}$ ... the return value is less than $2^{10}$ If the inputs are $x=10, y=20$, then the return value is greater than $2^{20}$

Consider the following $\mathrm{C}$ function definition.int f (int x, int y){ for (int i=0 ; i<y ; i++ ) { x= x + x + y; } return x; }Which of the following stateme...

Arjun

2.2k views

Arjun asked Feb 16

12 votes

3 answers

104

GATE CSE 2024 | Set 1 | Question: 39
Let $A$ be any $n \times m$ matrix, where $m>n$. Which of the following statements is/are TRUE about the system of linear equations $Ax=0$? There exist at least $m-n$ linearly independent solutions to this system There exist $m-n$ ... solution in which at least $m-n$ variables are $0$ There exists a solution in which at least $n$ variables are non-zero

Let $A$ be any $n \times m$ matrix, where $m>n$. Which of the following statements is/are TRUE about the system of linear equations $Ax=0$?There exist at least $m-n...

Arjun

3.3k views

Arjun asked Feb 16

1 votes

1 answer

105

GATE CSE 2024 | Set 1 | Question: 40
Consider the $5$ -state $\text{DFA}$. $M$ accepting the language $L(M) \subset(0+1)^{*}$ shown below. For any string $w \in(0+1)^*$ let $n_0(w)$ be the number of $0^{\prime} s$ in $w$ and $n_1(w)$ be the number of 1 's in $w$. ... $4$ are distinguishable in $M$ States $2$ and $5$ are distinguishable in $M$ Any string $w$ with $n_0(w)=n_1(w)$ is in $L(M)$

Consider the $5$ -state $\text{DFA}$. $M$ accepting the language $L(M) \subset(0+1)^{*}$ shown below. For any string $w \in(0+1)^*$ let $n_0(w)$ be the number of $0^{\...

Arjun

2.4k views

Arjun asked Feb 16

0 votes

1 answer

106

GATE CSE 2024 | Set 1 | Question: 41
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let $G$ be any graph with $n$ vertices and chromatic number $k$. Which of the following statements is/are always TRUE? $G$ contains a complete subgraph with ... $n/k$ $G$ contains at least $k(k-1) / 2$ edges $G$ contains a vertex of degree at least $k$

The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let $G$ be any graph with $n$ vertices and chromatic nu...

Arjun

2.0k views

Arjun asked Feb 16

3 votes

2 answers

107

GATE CSE 2024 | Set 1 | Question: 42
Consider the operators $\diamond$ and $\square$ defined by $a \diamond b=a+2 b, a \square b=a b$, for positive integers. Which of the following statements is/are TRUE? Operator $\diamond$ ... $\square$ obeys the distributive law Operator $\square$ over the operator $\diamond$ obeys the distributive law

Consider the operators $\diamond$ and $\square$ defined by $a \diamond b=a+2 b, a \square b=a b$, for positive integers. Which of the following statements is/are TRUE?Ope...

Arjun

1.8k views

Arjun asked Feb 16

1 votes

2 answers

108

GATE CSE 2024 | Set 1 | Question: 43
Consider two set-associative cache memory architectures: $\text{WBC}$, which uses the write back policy, and $\text{WTC}$, which uses the write through policy. Both of them use the $\text{LRU}$ (Least Recently Used) block ... write miss in $\text{WTC}$ always writes the victim cache block to main memory before loading the missed block to the cache

Consider two set-associative cache memory architectures: $\text{WBC}$, which uses the write back policy, and $\text{WTC}$, which uses the write through policy...

Arjun

2.2k views

Arjun asked Feb 16

0 votes

2 answers

109

GATE CSE 2024 | Set 1 | Question: 44
Consider a $512$ GB hard disk with $32$ storage surfaces. There are $4096$ sectors per track and each sector holds $1024$ bytes of data. The number of cylinders in the hard disk is _________.

Consider a $512$ GB hard disk with $32$ storage surfaces. There are $4096$ sectors per track and each sector holds $1024$ bytes of data. The number of cylinders in the ha...

Arjun

1.6k views

Arjun asked Feb 16

0 votes

3 answers

110

GATE CSE 2024 | Set 1 | Question: 45
The baseline execution time of a program on a $2 \mathrm{GHz}$ single core machine is $100$ nanoseconds ( $n s)$. The code corresponding to $90 \%$ of the execution time can be fully parallelized. The overhead for using an ... the parallelized code for an equal amount of time. The number of cores that minimize the execution time of the program is __________.

The baseline execution time of a program on a $2 \mathrm{GHz}$ single core machine is $100$ nanoseconds ( $n s)$. The code corresponding to $90 \%$ of the execution time ...

Arjun

1.8k 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