1
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
What is the chromatic number of the following graph? GATE CSE 2008 Discrete Mathematics - Graph Theory Question 71 English
A
$$2$$
B
$$3$$
C
$$4$$
D
$$5$$
2
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
What is the size of the smallest MIS (Maximal Independent Set) of a chain of nine nodes?
A
5
B
4
C
3
D
2
3
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $$h$$ is:
A
$${2^h} - 1$$
B
$${2^{h - 1}} - 1$$
C
$${2^{h + 1}} - 1$$
D
$${2^{h + 1}}$$
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Consider a weighted undirected graph with positive edge weights and let $$uv$$ be an edge in the graph. It is known that the shortest path from the source vertex $$s$$ to $$u$$ has weight 53 and the shortest path from $$s$$ to $$v$$ has weighted 65. Which one of the following statements is always true?
A
weight$$(u, v)$$ $$ < 12$$
B
weight$$(u, v)$$ $$ \le 12$$
C
weight$$(u, v)$$ $$ > 12$$
D
weight$$(u, v)$$ $$ \ge 12$$

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies