Recent activity by adityaravishankar28 / GATE Overflow for GATE CSE

14 answers

1

GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______

The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______

39.1k views

answer edited May 3, 2021

3 answers

2

GATE CSE 1993 | Question: 10
The instruction format of a CPU is: $\text{Mode}$ and $\text{RegR}$ together specify the operand. $\text{RegR}$ specifies a CPU register and $\text{Mode}$ specifies an addressing mode. In particular, $\text{Mode}=2$ specifies that ... address of the operand? Assuming that is a non-jump instruction, what are the contents of PC after the execution of this instruction?

The instruction format of a CPU is:$\text{Mode}$ and $\text{RegR}$ together specify the operand. $\text{RegR}$ specifies a CPU register and $\text{Mode}$ specifies an add...

7.2k views

edited May 2, 2021

8 answers

3

GATE CSE 2010 | Question: 50
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... possible weight of a spanning tree $T$ in this graph such that vertex $0$ is a leaf node in the tree $T$? $7$ $8$ $9$ $10$

Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...

23.9k views

answer edited Apr 29, 2021

2 answers

4

GATE CSE 2021 Set 2 | Question: 26
Consider the string $\textrm{abbccddeee}$. Each letter in the string must be assigned a binary code satisfying the following properties: For any two letters, the code assigned to one letter must not be a prefix of the code assigned to the other letter. ... which satisfy the above two properties, what is the minimum length of the encoded string? $21$ $23$ $25$ $30$

Consider the string $\textrm{abbccddeee}$. Each letter in the string must be assigned a binary code satisfying the following properties:For any two letters, the code assi...

9.5k views

answer edited Apr 29, 2021

1 answer

5

GATE CSE 2020 | Question: 35
Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. $(P, 155), (Q,85), (R,110),(S, 30), (T,115)$ Assume the head is positioned at ... ,but before $T$. The head reverses its direction of movement between servicing of $Q$ and $P$. $R$ is serviced before $P$.

Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time.$(P, 155...

5.3k views

answer edited Apr 28, 2021

1 answer

6

GATE Overflow Test Series | Mock GATE | Test 5 | Question: 56
A channel has a bit rate of $72$ kbps and one-way propagation delay of $36$ milliseconds. The channel uses stop and wait protocol and the transmission time of the acknowledgement frame is negligible. To get a channel efficiency of at least $85\%,$ the minimum frame size in bytes should be ________

A channel has a bit rate of $72$ kbps and one-way propagation delay of $36$ milliseconds. The channel uses stop and wait protocol and the transmission time of the acknowl...

279 views

commented Feb 10, 2021

1 answer

7

GATE Overflow Test Series | Mock GATE | Test 4 | Question: 39
Consider a network with five nodes, $N_1$ to $N_5$ ... $N_{1}$ in the distance vector of $N_{5}$ is _______

Consider a network with five nodes, $N_1$ to $N_5$, as shown as below.The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the dista...

589 views

commented Feb 9, 2021

1 answer

8

GATE Overflow Test Series | Mock GATE | Test 4 | Question: 63
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2021 steps on some input} \right\}$ ... $L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursively enumerable

Consider the following languages.$L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2021 steps on some input} \right\}$,$L_{2} = \left\{\left\langl...

450 views

commented Feb 6, 2021

1 answer

9

GATE Overflow Test Series | Mock GATE | Test 3 | Question: 48
The following elements $\{0, 64, 25, 49, 4, 19, 42, 5, 40, 20\}$ are inserted in an empty hash table using the hash function $\mod 10$ and separate chaining technique for collision avoidance. Let $n$ be the number of empty ... after these $3$ insertions the ratio of $n$ and $m$ will remain the same? Give answer up to $3$ decimal places.

The following elements $\{0, 64, 25, 49, 4, 19, 42, 5, 40, 20\}$ are inserted in an empty hash table using the hash function $\mod 10$ and separate chaining technique for...

570 views

commented Feb 4, 2021

1 answer

10

GATE Overflow Test Series | Mock GATE | Test 2 | Question: 65
Which of the following is/are correct formalization of the sentence? (Mark all the appropriate choices) " Every student will do well in some examination" Here, $dowell(x,y)$ means student $x$ will do well in examination $y.$ ... $\neg \exists x(student(x) \wedge \neg \exists y(exam(y) \implies dowell(x,y)))$

Which of the following is/are correct formalization of the sentence? (Mark all the appropriate choices)" Every student will do well in some examination"Here, $dowell(x,y)...

396 views

commented Jan 26, 2021

1 answer

11

GATE Overflow Test Series | Mock GATE | Test 1 | Question: 64
Consider a $5$-stage pipeline - IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (Memory), and WB (Write Back). All register reads take place in the second phase of a clock cycle and all register ... after read) hazards by $B$ and WAW(Write after write) hazards by $C,$ then $2A+3B+5C = $_________

Consider a $5$-stage pipeline - IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (Memory), and WB (Write Back). All register reads tak...

1.3k views

commented Jan 6, 2021

1 answer

12

GATE Overflow Test Series | Mock GATE | Test 1 | Question: 51
Consider a uniprocessor system executing three tasks $A,B$ and $C$ each of which is composed of a sequence of instances as given below: $A: 3$ instances of $2\;\text{ms}$ task arriving at intervals of ... millisecond and task preemptions are allowed, the first instance of $C$ completes its execution at the end of _________ milliseconds.

Consider a uniprocessor system executing three tasks $A,B$ and $C$ each of which is composed of a sequence of instances as given below:$A: 3$ instances of $2\;\text{ms}$ ...

834 views

commented Jan 5, 2021

1 answer

13

GATE Overflow Test Series | Mock GATE | Test 1 | Question: 17
A perfect binary tree is a binary tree in which all interior nodes have two children and all leaves have the same depth or same level. Let $T$ be a full binary tree with height $ h'$ containing $2^{(h+1)} -1$ nodes. Which one of the following is the value of the sum of ... $(h-1) \times 2^{(h+1)} +2$ $2^{(h+1)} -1-h$ $2^{(h+1)} -2 -h$

A perfect binary tree is a binary tree in which all interior nodes have two children and all leaves have the same depth or same level. Let $T$ be a full binary tree with ...

838 views

commented Jan 5, 2021

1 answer

14

GATE Overflow Test Series | Mixed Subjects | Test 4 | Question: 14
Two hosts are connected via a packet switch with $2\times 10^7$ bits per second links. Each link has a propagation delay of $30$ microseconds. The switch begins forwarding a packet $40$ microseconds after it receives ... of the first bit of data and the reception of the last bit of the data in microseconds is ___________

Two hosts are connected via a packet switch with $2\times 10^7$ bits per second links. Each link has a propagation delay of $30$ microseconds. The switch begins forwardin...

170 views

commented Dec 16, 2020

1 answer

15

GATE Overflow Test Series | Operating Systems | Test 1 | Question: 23
Consider the following code using semaphores. semaphore S1 = 1, S2 = 1; int cnt1 = cnt2 = 2; Process 1 while (cnt1--) { // do something S1.wait(); print{"GATE"}; S2.signal(); // do something } ... $\text{Overflow GATE Overflow GATE}$ $\text{GATE GATE Overflow Overflow} $ $\text{Overflow GATE GATE Overflow}$

Consider the following code using semaphores.semaphore S1 = 1, S2 = 1; int cnt1 = cnt2 = 2; Process 1 while (cnt1 ) { // do something S1.wait(); print{"GATE"}; S2.signal(...

289 views

commented Dec 7, 2020

5 answers

16

GATE CSE 2013 | Question: 36
Determine the maximum length of the cable (in km) for transmitting data at a rate of $500$ Mbps in an Ethernet LAN with frames of size $10,000$ bits. Assume the signal speed in the cable to be $2,00,000$ km/s. $1$ $2$ $2.5$ $5$

Determine the maximum length of the cable (in km) for transmitting data at a rate of $500$ Mbps in an Ethernet LAN with frames of size $10,000$ bits. Assume the signal sp...

16.9k views

answered Oct 9, 2020

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