Recent activity by Neeraj Singh - GATE Overflow

GATE CSE

For all GATE CSE Questions

First time here? Checkout the FAQ!

x

1 answer

1

Made easy test
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??

commented Jan 22 in Compiler Design | 106 views

2 answers

2

GATE2011-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 following. N1: (0, 1, 7, 8, 4) N2: (1, ... infty$. After the NEXT ROUND of update, what will be the cost to N1 in the distance vector of N3? 3 9 10 $\infty$

commented Jan 5 in Computer Networks | 1.4k views

3 answers

3

GATE2011-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 following. N1: (0, 1, 7, 8, 4) N2: (1, 0, 6, 7, 3) N3: (7, 6, 0, 2, 6) N4: (8, ... node, N3? (3, 2, 0, 2, 5) (3, 2, 0, 2, 6) (7, 2, 0, 2, 5) (7, 2, 0, 2, 6)

answered Dec 12, 2016 in Computer Networks | 2.2k views

1 answer

4

UGCNET-June2014-II-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$

commented Dec 4, 2016 in Graph Theory | 306 views

2 answers

5

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

commented Jul 16, 2016 in Graph Theory | 1k views

27,290 questions

35,142 answers

83,926 comments

33,231 users