Answers by Sumit1311 / GATE Overflow for GATE CSE

0 votes

1

375 views

answered Nov 22, 2016

4 votes

2

GATE CSE 2016 Set 2 | Question: 41
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer ... $\Theta\left(n+m\right)$ $\Theta\left(m^{2}\right)$ $\Theta\left(n^{4}\right)$

In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $...

19.7k views

answered Feb 28, 2016

5 votes

3

GATE CSE 2016 Set 2 | Question: 33
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.

Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac...

19.2k views

answered Feb 23, 2016

16 votes

4

ISRO2015-76
Consider the following statements #define hypotenuse (a, b) sqrt (a*a+b*b); The macro call hypotenuse(a+2,b+3); Finds the hypotenuse of a triangle with sides $a+2$ and $b+3$ Finds the square root of $(a+2)^2$ and $(b+3)^2$ Is invalid Find the square root of $3 *a+4*b+5$

Consider the following statements#define hypotenuse (a, b) sqrt (a*a+b*b);The macro call hypotenuse(a+2,b+3);Finds the hypotenuse of a triangle with sides $a+2$ and $b+3$...

6.0k views

answered Feb 3, 2016

6 votes

5

GATE CSE 1996 | Question: 2.19
A solution to the Dining Philosophers Problem which avoids deadlock is to ensure that all philosophers pick up the left fork before the right fork ensure that all philosophers pick up the right fork before the left fork ensure that one particular ... the right fork, and that all other philosophers pick up the right fork before the left fork None of the above

A solution to the Dining Philosophers Problem which avoids deadlock is toensure that all philosophers pick up the left fork before the right forkensure that all philosoph...

11.1k views

answered Jan 31, 2016

7 votes

6

Progress guaranteed/Mutual Exclusion/Deadlock or not?
var occupied var blocked Enter Region: { If (occupied) { then blocked= blocked +1 sleep ( ); } else occupied= 1; } Exit Region: { occupied= 0 If (blocked) { then wakeup (process); blocked= blocked – 1; } } True/False (1) Mutual Exclusion is guaranteed? (2) Deadlock free Algorithm? (3) Progress is guaranteed?

var occupiedvar blockedEnter Region:{If (occupied) {then blocked= blocked +1sleep ( );}else occupied= 1;}Exit Region:{occupied= 0If (blocked) {then wakeup (process);block...

2.3k views

answered Jan 29, 2016

89 votes

7

GATE IT 2008 | Question: 77
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours. Starting with the above tree, while there remains a node $v$ of degree two in the tree, add ... will remain at the end of the process? $2 * n_1- 3$ $n_2 + 2 * n_1 - 2$ $n_3 - n_2$ $n_2+ n_1- 2$

A binary tree with $n 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbo...

14.8k views

answered Jan 28, 2016

1 votes

8

CACHE CONCEPT------ME GATE MOCK1 ----URGENT HELP NEEDED
Assumr computer has MAin Memory consisting 1 M 16 bit word.It has also a 4-way set assosiative cache of 4K word and 64 word per block.the number of tag bits are------------- Ans: given as 4K word/(64 x 2 byte) word = 32 number ... is if 64 word is multiplied with 2 byte then why not 4K word also?? i did it like (4Kx2)/(64x2) please explain it

Assumr computer has MAin Memory consisting 1 M 16 bit word.It has also a 4-way set assosiative cache of 4K word and 64 word per block.the number of tag bits are -Ans: gi...

232 views

answered Jan 21, 2016

2 votes

9

Deadlock vs. Mutual Xclusion
S1. All synchronisation mechanisms that Do not Prevent Deadlock, guarantee mutual exclusion. S2. All synchronisation mechanisms that guarantee mutual exclusion and prevent deadlock will prevent starvation. a) s1 is only correct statement b) s2 is only correct statement c) both are correct d) none of these

S1. All synchronisation mechanisms that Do not Prevent Deadlock, guarantee mutual exclusion.S2. All synchronisation mechanisms that guarantee mutual exclusion and prevent...

518 views

answered Jan 21, 2016

0 votes

10

Congestion Window 1.3
The initial congestion window size over a TCP is 1. If slow start algorithm is used and the size of congestion window incremented by 1 whenever an ACK is received i.e. after first rounda trip time congestion window size is 2 segments. Assume that connection never leaves slow start. The number of RTT’s to send 3999 segments are _______.

The initial congestion window size over a TCP is 1. If slow start algorithm is used and the size of congestion window incremented by 1 whenever an ACK is received i.e. af...

2.0k views

answered Jan 21, 2016

0 votes

11

Unary operator expression evaluation c
After executing the program, I am getting 10 as the answer. Please explain and give the postfix for the expression [ z=x++-y*b/a ].

After executing the program, I am getting 10 as the answer.Please explain and give the postfix for the expression [ z=x++-y*b/a ].

665 views

answered Jan 13, 2016

0 votes

12

expectation
A fair coin is tossed repeatedly till both head and tail appear atleast once. Average no of tosses required is ?

A fair coin is tossed repeatedly till both head and tail appear atleast once. Average no of tosses required is ?

4.7k views

answered Jan 7, 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