Recent activity by Counsellor / GATE Overflow for GATE CSE

1 answer

1

GATE CSE 2024 | Set 2 | GA Question: 2
Two wizards try to create a spell using all the four elements, water, air, fire, and earth. For this, they decide to mix all these elements in all possible orders. They also decide to work independently. After trying all possible combination ... work. How many attempts does each wizard make before coming to this conclusion, independently? $24$ $48$ $16$ $12$

Two wizards try to create a spell using all the four elements, water, air, fire, and earth. For this, they decide to mix all these elements in all possible orders. ...

3.8k views

edited Apr 10

2 answers

2

GATE CSE 2024 | Set 2 | Question: 45
Consider an Ethernet segment with a transmission speed of $10^{8} \mathrm{bits} / \mathrm{sec}$ and a maximum segment length of $500$ meters. If the speed of propagation of the signal in the medium is $2 \times 10^{8} \mathrm{~meters} / \mathrm{sec}$, then the minimum frame size (in bits) required for collision detection is ___________.

Consider an Ethernet segment with a transmission speed of $10^{8} \mathrm{bits} / \mathrm{sec}$ and a maximum segment length of $500$ meters. If the speed of propagation ...

1.6k views

edited Mar 6

2 answers

3

GATE CSE 2024 | Set 2 | Question: 44
Consider a $\text{TCP}$ connection operating at a point of time with the congestion window of size $12$ $\text{MSS}$ (Maximum Segment Size), when a timeout occurs due to packet loss. Assuming that all the segments transmitted in the next ... Time) are acknowledged correctly, the congestion window size (in $MSS$) during the third $\text{RTT}$ will be __________.

Consider a $\text{TCP}$ connection operating at a point of time with the congestion window of size $12$ $\text{MSS}$ (Maximum Segment Size), when a timeout occurs due to ...

1.7k views

edited Mar 6

1 answer

4

GATE CSE 2024 | Set 2 | Question: 43
Consider a disk with the following specifications: rotation speed of $6000$ RPM, average seek time of $5$ milliseconds, $500$ sectors/track, $512$-byte sectors. A file has content stored in $3000$ sectors located randomly on the disk. Assuming ... total time (in seconds, rounded off to $2$ decimal places) to read the entire file from the disk is ______________.

Consider a disk with the following specifications: rotation speed of $6000$ RPM, average seek time of $5$ milliseconds, $500$ sectors/track, $512$-byte sectors. A file ha...

1.7k views

edited Mar 6

1 answer

5

GATE CSE 2024 | Set 2 | Question: 42
Consider a context-free grammar $\text{G}$ with the following $3$ rules. \[ S \rightarrow a S, S \rightarrow a S b S , S \rightarrow c \] Let $w \in L(G)$. Let $ n_{a}(w), n_{b}(w), n_{c}(w) $ denote the number of times $a, b, c$ occur in $w$, respectively. Which of ... $n_{a}(w)>n_{c}(w)-2$ $n_{c}(w)=n_{b}(w)+1$ $n_{c}(w)=n_{b}(w) * 2$

Consider a context-free grammar $\text{G}$ with the following $3$ rules.\[S \rightarrow a S, S \rightarrow a S b S , S \rightarrow c\]Let $w \in L(G)$...

1.8k views

edited Mar 6

1 answer

6

GATE CSE 2024 | Set 2 | Question: 41
Let $\text{G}$ be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in $\text{G}$ has even weight. Which of the following statements is/are TRUE for every such graph $\text{G}$ ... $\text{C}$ have even weight $\text{OR}$ all edges in $\text{C}$ have odd weight

Let $\text{G}$ be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in $\text{G}$ has even weight. Which o...

2.0k views

edited Mar 6

1 answer

7

GATE CSE 2024 | Set 2 | Question: 39
Which of the following is/are EQUAL to $224$ in radix - $5$ (i.e., base - $5$) notation? $64$ in radix -10 $100$ in radix -8 $50$ in radix -16 $121$ in radix -7

Which of the following is/are EQUAL to $224$ in radix - $5$ (i.e., base - $5$) notation?$64$ in radix -10$100$ in radix -8$50$ in radix -16$121$ in radix -7

1.7k views

edited Mar 6

1 answer

8

GATE CSE 2024 | Set 2 | Question: 38
Let $\mathrm{S} 1$ and $\mathrm{S} 2$ be two stacks. $\mathrm{S} 1$ has capacity of $4$ elements. $\mathrm{S} 2$ has capacity of $2$ elements. $\text{S1}$ already has $4$ elements: $100,200,300$, and $400$ ... output sequences can be generated by using the above operations? $100,200,400,300$ $200,300,400,100$ $400,200,100,300$ $300,200,400,100$

Let $\mathrm{S} 1$ and $\mathrm{S} 2$ be two stacks. $\mathrm{S} 1$ has capacity of $4$ elements. $\mathrm{S} 2$ has capacity of $2$ elements. $\text{S1}$ ...

2.0k views

edited Mar 6

1 answer

9

GATE CSE 2024 | Set 2 | Question: 35
The relation schema, Person (pid, city), describes the city of residence for every person uniquely identified by pid. The following relational algebra operators are available: selection, projection, cross product, and rename. To find the list of cities ... above operators, the minimum number of cross product operations that must be used is $1$ $2$ $3$ $4$

The relation schema, Person (pid, city), describes the city of residence for every person uniquely identified by pid. The following relational algebra oper...

2.2k views

edited Mar 6

1 answer

10

GATE CSE 2024 | Set 2 | Question: 33
Consider the following expression: $x[i]=(p+r) *-s[i]+u / w$. The following sequence shows the list of triples representing the given expression, with entries missing for triples $(1), (3)$, and $(6)$ ... $(1)$ [ ]$=s i \quad(3)-(0)(2) \quad(6)=[ ] x i$

Consider the following expression: $x[i]=(p+r) *-s[i]+u / w$. The following sequence shows the list of triples representing the given expression, with entries missing ...

1.6k views

edited Mar 6

2 answers

11

GATE CSE 2024 | Set 2 | Question: 32
Consider an array $\mathrm{X}$ that contains $\mathrm{n}$ positive integers. A subarray of $\mathrm{X}$ is defined to be a sequence of array locations with consecutive indices. The $\mathrm{C}$ code snippet given below has been written to compute the length of the longest ... $\text{(P) } \text{len} 2+1$ $\text{(Q) } \text{len} 1+1$

Consider an array $\mathrm{X}$ that contains $\mathrm{n}$ positive integers. A subarray of $\mathrm{X}$ is defined to be a sequence of array locations with co...

1.9k views

edited Mar 6

1 answer

12

GATE CSE 2024 | Set 2 | Question: 30
Consider the following context-free grammar where the start symbol is $\text{S}$ and the set of terminals is $\{a, b, c, d\}$. \[ \begin{array}{l} S \rightarrow A a A b \mid B b B a \\ A \rightarrow c S \mid \epsilon \\ B \rightarrow d S \mid \epsilon \end{ ... blank $(4)$ blank $(1)$ $S \rightarrow B b B a$ $(2)$ $S \rightarrow A a A b$ $(3)$ blank $(4)$ blank

Consider the following context-free grammar where the start symbol is $\text{S}$ and the set of terminals is $\{a, b, c, d\}$.\[\begin{array}{l}S \rightarrow A a A b \mid...

3.0k views

edited Mar 6

3 answers

13

GATE CSE 2024 | Set 2 | Question: 27
Consider a single processor system with four processes $\text{A, B, C,}$ and $\text{D}$, represented as given below, where for each process the first value is its arrival time, and the second value is its $\text{CPU}$ ... $\mathrm{SRTF}=7, \mathrm{NP}-\mathrm{SJF}=7.5$ $\mathrm{SRTF}=7, \mathrm{NP}-\mathrm{SJF}=8.5$

Consider a single processor system with four processes $\text{A, B, C,}$ and $\text{D}$, represented as given below, where for each process the first value is...

2.4k views

edited Mar 6

1 answer

14

GATE CSE 2024 | Set 2 | Question: 21
An instruction format has the following structure: Instruction Number: Opcode destination reg, source reg-$1$, source reg-$2$ Consider the following sequence of instructions to be executed in a pipelined processor: $\text{I 1: DIV R3, R1, R2}$ ... $\text{I 3}$ There is a WAW dependency on $\text{R 3}$ between $\text{I 3}$ and $\text{I 4}$

An instruction format has the following structure:Instruction Number: Opcode destination reg, source reg-$1$, source reg-$2$ Consider the following sequenc...

1.8k views

edited Mar 6

1 answer

15

GATE CSE 2024 | Set 2 | Question: 18
Which of the following statements about $\text{IPv4}$ fragmentation is/are TRUE? The fragmentation of an $\text{IP}$ datagram is performed only at the source of the datagram The fragmentation of an $\text{IP}$ datagram ... of the datagram The reassembly of fragments is performed at all intermediate routers along the path from the source to the destination

Which of the following statements about $\text{IPv4}$ fragmentation is/are TRUE?The fragmentation of an $\text{IP}$ datagram is performed only at the sourc...

2.7k views

edited Mar 6

1 answer

16

GATE CSE 2024 | Set 2 | Question: 22
Which of the following fields of an $\text{IP}$ header is/are always modified by any router before it forwards the $\text{IP}$ packet? Source $\text{IP}$ Address Protocol Time to Live $\text{(TTL)}$ Header Checksum

Which of the following fields of an $\text{IP}$ header is/are always modified by any router before it forwards the $\text{IP}$ packet?Source $\text{IP}$ Addre...

1.8k views

edited Mar 6

1 answer

17

GATE CSE 2024 | Set 2 | Question: 15
Consider a process $\text{P}$ running on a $\text{CPU}$. Which one or more of the following events will always trigger a context switch by the $\text{OS}$ that results in process $\mathrm{P}$ moving to a non-running ... page fault An interrupt is raised by the disk to deliver data requested by some other process A timer interrupt is raised by the hardware

Consider a process $\text{P}$ running on a $\text{CPU}$. Which one or more of the following events will always trigger a context switch by the $\text{OS}$ tha...

2.9k views

edited Mar 6

3 answers

18

GATE CSE 2024 | Set 2 | Question: 11
Consider the following two sets: Set $\text{X}$ Set $\text{Y}$ P. Lexical Analyzer 1. Abstract Syntax Tree Q. Syntax Analyzer 2. Token R. Intermediate Code Generator 3. Parse Tree S. Code Optimizer 4. Constant Folding Which one of the following options is the CORRECT match ... $\mathrm{P}-4 ; \mathrm{Q}-3 ; \mathrm{R}-2 ; \mathrm{S}-1$

Consider the following two sets:Set $\text{X}$Set $\text{Y}$P. Lexical Analyzer1. Abstract Syntax TreeQ. Syntax Analyzer2. TokenR. Intermediate Code Generator3. ...

2.3k views

edited Mar 6

1 answer

19

GATE CSE 2024 | Set 2 | Question: 8
When six unbiased dice are rolled simultaneously, the probability of getting all distinct numbers $(i.e., 1, 2, 3, 4, 5, \text{and } 6)$ is $\frac{1}{324}$ $\frac{5}{324}$ $\frac{7}{324}$ $\frac{11}{324}$

When six unbiased dice are rolled simultaneously, the probability of getting all distinct numbers $(i.e., 1, 2, 3, 4, 5, \text{and } 6)$ is$\frac{1}{3...

2.0k views

edited Mar 6

2 answers

20

GATE CSE 2024 | Set 2 | Question: 7
Let $\text{A}$ be the adjacency matrix of a simple undirected graph $\text{G}$. Suppose $\text{A}$ is its own inverse. Which one of the following statements is always TRUE? $\text{G}$ is a cycle $\text{G}$ is a perfect matching $\text{G}$ is a complete graph There is no such graph $\text{G}$

Let $\text{A}$ be the adjacency matrix of a simple undirected graph $\text{G}$. Suppose $\text{A}$ is its own inverse. Which one of the following statements i...

2.8k views

edited Mar 6

4 answers

21

GATE CSE 2024 | Set 2 | Question: 5
Let $\text{T(n)}$ be the recurrence relation defined as follows: \[ \begin{array}{l} T(0)=1, \\ T(1)=2, \text { and } \\ T(n)=5 T(n-1)-6 T(n-2) \text { for } n \geq 2 \end{array} \] Which one of the following statements is TRUE? $T(n)=\Theta\left(2^{n}\right)$ $T(n)=\Theta\left(n 2^{n}\right)$ $T(n)=\Theta\left(3^{n}\right)$ $T(n)=\Theta\left(n 3^{n}\right)$

Let $\text{T(n)}$ be the recurrence relation defined as follows:\[\begin{array}{l}T(0)=1, \\T(1)=2, \text { and } \\T(n)=5 T(n-1)-6 T(n-2) \text { for } n ...

2.4k views

edited Mar 6

1 answer

22

GATE CSE 2024 | Set 2 | Question: 4
The format of a single-precision floating-point number as per the $\text{IEEE 754}$ standard is: Sign Exponent Mantissa $(1 \mathrm{bit})$ $(8 \mathrm{bits})$ $(23 \mathrm{bits})$ Choose the largest floating- ... $0$ $11111111$ $11111111111111111111111$ Sign Exponent Mantissa $0$ $01111111$ $00000000000000000000000$

The format of a single-precision floating-point number as per the $\text{IEEE 754}$ standard is:Sign ExponentMantissa$(1 \mathrm{bit})$ $(8 \mathrm{bits})$ $(23 \ma...

2.5k views

edited Mar 6

4 answers

23

GATE CSE 2024 | Set 2 | Question: 2
Let $p$ and $q$ be the following propositions: $p$ : Fail grade can be given. $q$ : Student scores more than $50 \%$ marks. Consider the statement: "Fail grade cannot be given when student scores more than $50 \%$ marks." ... above statement in propositional logic? $q \rightarrow \neg p$ $q \rightarrow p$ $p \rightarrow q$ $\neg p \rightarrow q$

Let $p$ and $q$ be the following propositions:$p$ : Fail grade can be given.$q$ : Student scores more than $50 \%$ marks.Consider the statement: "Fail grade c...

3.4k views

edited Mar 6

1 answer

24

GATE CSE 2024 | Set 2 | Question: 1
Consider a computer with a $4 \mathrm{MHz}$ processor. Its $\text{DMA}$ controller can transfer $8$ bytes in $1$ cycle from a device to main memory through cycle stealing at regular intervals. Which one of the following is the data transfer rate (in bits per ... $\text{DMA}$? $2,56,000$ $3,200$ $25,60,000$ $32,000$

Consider a computer with a $4 \mathrm{MHz}$ processor. Its $\text{DMA}$ controller can transfer $8$ bytes in $1$ cycle from a device to main memory through cycle...

2.3k views

edited Mar 6

5 answers

25

GATE CSE 2024 | Set 2 | GA Question: 4
For positive non-zero real variables $x$ and $y$, if \[ \ln \left(\frac{x+y}{2}\right)=\frac{1}{2}[\ln (x)+\ln (y)] \] then, the value of $\frac{x}{y}+\frac{y}{x}$ is $1$ $1 / 2$ $2$ $4$

For positive non-zero real variables $x$ and $y$, if\[\ln \left(\frac{x+y}{2}\right)=\frac{1}{2}[\ln (x)+\ln (y)]\]then, the value of $\frac{x}{y}+\frac{y}{x}$ is$1$$1 / ...

2.7k views

edited Mar 6

2 answers

26

GATE CSE 2024 | Set 1 | Question: 46
A given program has $25 \%$ load/store instructions. Suppose the ideal $\text{CPI}$ (cycles per instruction) without any memory stalls is $2$. The program exhibits $2 \%$ miss rate on instruction cache and $8 \%$ miss rate on data ... rounded off to two decimal places) achieved with a perfect cache (i.e., with NO data or instruction cache misses) is __________.

A given program has $25 \%$ load/store instructions. Suppose the ideal $\text{CPI}$ (cycles per instruction) without any memory stalls is $2$. The program exhibits $2 \%$...

2.6k views

edited Mar 6

2 answers

27

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

2.1k views

edited Mar 6

3 answers

28

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.1k views

edited Mar 6

1 answer

29

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.4k views

edited Mar 6

2 answers

30

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

1.9k views

edited Mar 6

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