Most viewed questions / GATE Overflow for GATE CSE

61 votes

10 answers

341

GATE IT 2004 | Question: 88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slow-start phase with a current transmit window of $4000$ $\text{bytes}$. ... transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$

Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the co...

Ishrat Jahan

24.6k views

Ishrat Jahan asked Nov 2, 2014

69 votes

6 answers

342

GATE CSE 2014 Set 3 | Question: 44
The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write operation with a hit in cache and $10$ nanoseconds for a write ... cache hit-ratio is $0.9$. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.

The memory access time is $1$ nanosecond for a read operation with a hit in cache, $5$ nanoseconds for a read operation with a miss in cache, $2$ nanoseconds for a write ...

go_editor

24.6k views

go_editor asked Sep 28, 2014

75 votes

11 answers

343

GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false

Given below is a program which when executed spawns two concurrent processes :semaphore $X : = 0 ;$/* Process now forks into concurrent processes $P1$ & $P2$ */$\begin{ar...

Ishrat Jahan

24.6k views

Ishrat Jahan asked Nov 3, 2014

37 votes

5 answers

344

GATE CSE 2015 Set 1 | Question: 30
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given: $45, 20, 90, 10, 50, 60, 80, 25, 70.$ Assume that the initial position of the R/W head is on track $50$ ... is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards $100$ when it starts execution) is________________tracks.

Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given:$45, 20, 90, 10, 50, 60, 80, 25, 70.$Assume that the initial position of...

makhdoom ghaya

24.5k views

makhdoom ghaya asked Feb 13, 2015

70 votes

4 answers

345

GATE CSE 2003 | Question: 54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable

Define languages $L_0$ and $L_1$ as follows :$L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $$L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts o...

Arjun

24.5k views

Arjun asked Sep 8, 2014

6 votes

3 answers

346

What is the time complexity of job sequencing with deadline using greedy algorithm?
What is the time complexity of job sequencing with deadline using greedy algorithm? O(n) O(log n) O(n log n) O(n2) Made Easy Full Syllabus Test-6 : Basic Level : Practice Test-14 Q 19 Please give reference for this answer to this algorithm.

What is the time complexity of job sequencing with deadline using greedy algorithm?O(n)O(log n)O(n log n)O(n2)Made EasyFull Syllabus Test-6 : Basic Level : Practice Test-...

Akash Kanase

24.5k views

Akash Kanase asked Dec 1, 2015

94 votes

5 answers

347

GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list

An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-...

makhdoom ghaya

24.5k views

makhdoom ghaya asked Feb 13, 2015

65 votes

9 answers

348

GATE CSE 2016 Set 1 | Question: 38
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$ ... integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.

Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$. W=$\begin{bmatrix} 0&2 &8 &...

Sandeep Singh

24.5k views

Sandeep Singh asked Feb 12, 2016

34 votes

4 answers

349

GATE CSE 2013 | Question: 19
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? $\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)$ $\theta(n^3\log n)$

What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?$\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)...

Arjun

24.5k views

Arjun asked Sep 23, 2014

43 votes

8 answers

350

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

go_editor

24.5k views

go_editor asked Sep 30, 2014

0 votes

1 answer

351

what is number of elements in power set of {{A,B},C} ?

stuti1

24.5k views

stuti1 asked Jun 7, 2016

68 votes

5 answers

352

GATE CSE 2008 | Question: 70
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$ ... -level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$

Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$. The file is ordered on a non-key field, and the...

ABG

24.4k views

ABG asked Sep 2, 2014

63 votes

6 answers

353

GATE IT 2008 | Question: 41
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Recently Used (LRU) page replacement policy. $\text{0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92}$ How many ... $1, 2, 3, 4$ $7$ and $1, 2, 4, 5$ $8$ and $1, 2, 4, 5$ $9$ and $1, 2, 3, 5$

Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Re...

Ishrat Jahan

24.4k views

Ishrat Jahan asked Oct 28, 2014

46 votes

6 answers

354

GATE CSE 2012 | Question: 35
Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, $REAR = FRONT = 0$. The conditions to detect ... : $(REAR+1) \mod n == FRONT$ full: $(FRONT+1) \mod n == REAR$ empty: $REAR == FRONT$

Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out u...

gatecse

24.4k views

gatecse asked Sep 26, 2014

61 votes

7 answers

355

GATE CSE 2010 | Question: 54
Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its ... stabilize, how many links in the network will never be used for carrying any data? $4$ $3$ $2$ $1$

Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram.All the routers use the distance ...

go_editor

24.4k views

go_editor asked Sep 30, 2014

62 votes

9 answers

356

GATE CSE 2010 | Question: 41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$

Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automati...

go_editor

24.3k views

go_editor asked Sep 30, 2014

60 votes

8 answers

357

GATE CSE 2018 | Question: 50
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$ and Writeback $(WB)$, The $IF$, $ID$, $OF$ and $WB$ ... no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instruction is _____.

The instruction pipeline of a RISC processor has the following stages: Instruction Fetch $(IF)$, Instruction Decode $(ID)$, Operand Fetch $(OF)$, Perform Operation $(PO)$...

gatecse

24.3k views

gatecse asked Feb 14, 2018

54 votes

4 answers

358

GATE CSE 2008 | Question: 65
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes? In deadlock prevention, the request for resources is always granted if the resulting state is safe In deadlock avoidance, the request ... safe Deadlock avoidance is less restrictive than deadlock prevention Deadlock avoidance requires knowledge of resource requirements apriori..

Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?In deadlock prevention, the request for resources is always granted if the result...

Kathleen

24.3k views

Kathleen asked Sep 12, 2014

24 votes

7 answers

359

GATE CSE 2021 Set 1 | Question: 30
Consider the following recurrence relation. $T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\right.$ Which one of the following options is correct? $T(n)=\Theta (n^{5/2})$ $T(n)=\Theta (n\log n)$ $T(n)=\Theta (n)$ $T(n)=\Theta ((\log n)^{5/2})$

Consider the following recurrence relation.$$T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\r...

Arjun

24.3k views

Arjun asked Feb 18, 2021

57 votes

6 answers

360

GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$

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

go_editor

24.3k views

go_editor asked Apr 21, 2016

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