Recent activity by Neeraj Singh / GATE Overflow for GATE CSE

2 answers

1

GATE Overflow | Algorithms | Test 1 | Question: 18
Time complexity of the optimal algorithm to interchange the $m^{th}$ and $n^{th}$ elements of a singly Linked List is $\Theta(m+n)$ $\Theta(m)$ when $m\geq n$ otherwise $\Theta(n)$ $\Theta(m)$ if $m \leq n$ otherwise $\Theta(n)$ $\Theta(m+ \min (m,n))$

Time complexity of the optimal algorithm to interchange the $m^{th}$ and $n^{th}$ elements of a singly Linked List is $\Theta(m+n)$$\Theta(m)$ when $m\geq n$ otherwise $...

647 views

commented Jan 23, 2017

1 answer

2

MadeEasy Subject Test: Compiler Design - Parsing
A non left recursive and left facotred grammar in which all non-empty rules defining the same non terminal have disjoint first sets, such grammar is called _____________ a) LL(1) b) LR(0) c) LR(1) d) None asnwer given LL(1). but i think bcoz of follow there can be conflict hence none of these should be the answer. Is it right??

A non left recursive and left facotred grammar in which all non-empty rules defining the same non terminal have disjoint first sets, such grammar is called _____________a...

1.2k views

commented Jan 22, 2017

6 answers

3

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

24.2k views

commented Jan 5, 2017

2 answers

4

Test by Bikram | Computer Networks | Test 1 | Question: 16
In a token bucket network transmission spreed is $20^*(10^6)$ bps and maximum rate can only be sent for at most $10$ sec at a time, and at most $150$ Mb can be sent over any $15$ sec window, then the value for token input rate is _________ mbps

In a token bucket network transmission spreed is $20^*(10^6)$ bps and maximum rate can only be sent for at most $10$ sec at a time, and at most $150$ Mb can be sent over...

1.3k views

commented Dec 18, 2016

4 answers

5

GATE CSE 2011 | Question: 52
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)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$

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

24.6k views

answered Dec 12, 2016

2 answers

6

UGC NET CSE | June 2014 | Part 2 | Question: 23
Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$ $m = 2, n = 3$ $m = n > 2$ $m = n > 3$

Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$$m = 2, n = 3$ $m = n 2$$m...

7.2k views

commented Dec 4, 2016

2 answers

7

ISRO2007-07
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is $1$ $k$ $k-1$ $k/2$

If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is$1$$k$$k-1$$k/2$

4.0k views

commented Jul 15, 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