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
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged gb2019ds2
0
votes
0
answers
1
GATEBOOK2019DS21
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? $7, 5, 5, 3, 3, 2, 2, 2$ $6, 6, 6, 6, 3, 3, 2, 2, 1, 1$ $8, 7, 6, 4, 4, 3, 2, 2, 2$ $8, 7, 6, 6, 4, 4, 2, 2, 2$ II and III III and IV IV only I and IV
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

109
views
gb2019ds2
graphtheory
degreeofgraph
+1
vote
1
answer
2
GATEBOOK2019DS22
Let $G$ be an undirected labelled graph with $8$ vertices. Every vertex in $G$ is connected with every other vertex except one vertex which is not connected with any of the vertex. Which of the following represents number of distinct cycles of length $5$ in $G$: 252 490 504 662
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

173
views
gb2019ds2
+2
votes
3
answers
3
GATEBOOK2019DS23
A quinpartite graph is a graph whose vertices can be partitioned into five groups such that no two vertices in same group are connected via some edge. The maximum number of edges in a quinpartite graph with $10$ vertices, where cardinalities of those five sets are given as $\{2,3,2,1,2\},$ is: $16$ $20$ $26$ $39$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

199
views
gb2019ds2
graphtheory
graphconnectivity
+1
vote
1
answer
4
GATEBOOK2019DS24
Consider a weighted undirected graph with positive integer edge weights and let there be edges or at least one path between each of the vertices u,v and k. It is known that the shortest path from the source vertex s to u has weight $79$, shortest path from s to k has weight $31$ and the ... $\text{weight } (u, k) \le 48$ $\text{weight }(u, v) \ge 24$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

79
views
gb2019ds2
+1
vote
1
answer
5
GATEBOOK2019DS25
Consider following statements about tripartite graph, i.e. TPG, which contains three subsets of vertices of graph as A,B and C: Minimum number of edges in a cycle in a TPG which passes through all three subsets of vertices is $6$ ... . Which of the above statements are true: (i) only (iii) only (ii) and (iii) only (i) and (ii) only
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

89
views
gb2019ds2
+1
vote
2
answers
6
GATEBOOK2019DS26
Let $\alpha(G)$ be the size of the largest independent set in a graph $G$, and $\chi(G)$ the chromatic number of $G$. Which of the following statements about a graph is true? $\alpha(G)*\chi(G) \ge G$ $\alpha(G) > \chi(G)$ $\alpha(G) < \chi(G)$ $\alpha(G)*\chi(G) \le G$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

95
views
gb2019ds2
0
votes
2
answers
7
GATEBOOK2019DS27
In a binary tree with $n$ nodes, every nonleaf node has an even number of descendants. Every node is considered to be its own descendant. What is the number of nodes in a tree that has exactly one child? $0$ $1$ $\frac{(n  1)}{2}$ $n1$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

247
views
gb2019ds2
binarytree
0
votes
1
answer
8
GATEBOOK2019DS28
Consider following four graphs each with five vertices whose edgesets are shown below: $\{(1,3),(2,4),(1,2),(2,3),(3,5),(4,5)\}$ $\{(1,2),(2,3),(3,4),(4,5),(2,4)\}$ $\{(2,3),(1,2),(1,5),(2,5),(1,3),(3,4)\}$ $\{(1,4),(3,5),(2,4),(4,5),(1,2),(2,3)\}$ Which of the above graphs are isomorphic to each other: (i), (ii) and (iii) (ii) and (iii) (i) and (iv) None of the above
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

91
views
gb2019ds2
0
votes
0
answers
9
GATEBOOK2019DS29
Consider following statements: Every simple graph has at least two vertices of the same degree. If u is a vertex of odd degree in a graph, then there exists a path from u to another vertex v of the graph where v also has odd degree. If there are exactly two ... the graph. Which of the above statements are not true? (i) and (ii) only (iii) only (ii) only None of the above
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

58
views
gb2019ds2
0
votes
1
answer
10
GATEBOOK2019DS210
For which of the following scenarios does there exist a simple graph $G = (V, E)$ satisfying the specified conditions? It has $3$ components $20$ vertices and $16$ edges. It has $10$ vertices, $38$ edges, and more than one component. It has $7$ vertices, $10$ edges, and more than two components. It is connected and has $10$ edges $5$ vertices and fewer than $6$ cycles.
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

70
views
gb2019ds2
+2
votes
1
answer
11
GATEBOOK2019DS211
The number of simple digraphs with $\mid V \mid = 3$ is: $8$ $27$ $64$ $256$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

147
views
gb2019ds2
0
votes
0
answers
12
GATEBOOK2019DS212
Let $T = (V, E)$ be a tree and let $d(v)$ be the degree of a vertex. Consider following statements: $\sum_{v\in V}(2  d(v)) = 2$ If $T$ has a vertex of degree $m \ge 2$, then it has at least m vertices of degree $1$. $\sum_{v\in V}(k  d(v)) = k$, ... Which of the above statements is/are true? (i) only (i), (ii) only (ii) and (iii) only (i), (ii) and (iii) only
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

84
views
gb2019ds2
+3
votes
1
answer
13
GATEBOOK2019DS213
For which of the following scenarios does there exist a Binary tree satisfying the specified conditions? A binary tree with $35$ leaves and height $100$. A full binary tree with $21$ leaves and height $21$. A binary tree with $33$ leaves and height $5$. A rooted tree of height $5$ where every internal vertex has $3$ children and there are $365$ vertices.
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

118
views
gb2019ds2
0
votes
2
answers
14
GATEBOOK2019DS214
For each of the following graphs, the number of spanning trees are A, B and C, respectively. \The value of $A*B+C$ is: $16$ $32$ $48$ $64$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

73
views
gb2019ds2
0
votes
1
answer
15
GATEBOOK2019DS215
The chromatic number of the following graph is: \ $2$ $3$ $4$ $5$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

81
views
gb2019ds2
+1
vote
1
answer
16
GATEBOOK2019DS216
Consider the weighted undirected graph shown below: The weight of the minimum spanning tree of the above graph is: $25$ $28$ $30$ $33$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

63
views
gb2019ds2
+2
votes
1
answer
17
GATEBOOK2019DS217
The line graph $L(G)$ of a graph $G(V,E)$ is a graph whose vertices are in $11$ correspondence with the edges of $G$. Two vertices of $L(G)$ being adjacent if the corresponding edges of $G$ are adjacent. Consider following graphs: Consider following statements: L(A) is ... graphs are true? (i) and (iii) only (ii) and (iii) only (ii) and (iv) only (ii), (iii) and (iv) only
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

86
views
gb2019ds2
+2
votes
1
answer
18
GATEBOOK2019DS218
Consider following statements about Cycle graph, Complete Bipartite graph and Complete graph. Cycle graph $C_n$ is subgraph of a complete graph $K_n$. $K_{n,n}$ is a subgraph of $K_m$ if $m\le 2n$. $C_n$ a subgraph of $K_{n,n}$ if $n$ is even. Which of the above statements is/are TRUE? (i) and (iii) only (ii) and (iii) only (i) only (iii) only
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

117
views
gb2019ds2
graphconnectivity
+2
votes
1
answer
19
GATEBOOK2019DS219
Consider the following graph ? Let number of shortest paths from node $a$ to node $j$ is represented by $A$, number of shortest paths from node $e$ to node $b$ is represented by $B$ and number of shortest paths from node $b$ to node $f$ is represented by $C$. Then the value of the expression: $A^B+B^C+C^A$ is: $13$ $21$ $57$ $64$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

103
views
gb2019ds2
0
votes
1
answer
20
GATEBOOK2019DS220
Consider the graph shown below: Cardinality of the largest maximum independent set of the above graph is __________?
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

107
views
gb2019ds2
numericalanswers
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
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
Recent Posts
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
Follow @csegate
Recent questions tagged gb2019ds2
Recent Blog Comments
Refund time depends on the payment mode ...
@Arjun Sir , when can i expect my refund in the...
This book is returned you can enable a pay now...
@Pranavcool The book stocks are over and no one...
@Lokesh Thats unfortunate. I have refunded you....
49,830
questions
54,807
answers
189,530
comments
80,840
users