The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Neeraj Singh
User Neeraj Singh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Neeraj Singh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
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??
commented
Jan 22, 2017
in
Compiler Design
|
226
views
made-easy-test-series
compiler-design
parsing
5
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 follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ ... $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
commented
Jan 5, 2017
in
Computer Networks
|
5.7k
views
gate2011
computer-networks
routing
distance-vector-routing
normal
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 follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... 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
|
5.7k
views
gate2011
computer-networks
routing
distance-vector-routing
normal
2
answers
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
|
1.4k
views
ugcnetjune2014ii
graph-theory
hamiltonian
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
|
2.3k
views
isro2007
graph-theory
graph-coloring
50,645
questions
56,596
answers
195,822
comments
102,068
users