1
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is TRUE for any simple connected undirected graph with more than $$2$$ vertices?
A
No two vertices have the same degree.
B
At least two vertices have the same degree.
C
At least three vertices have the same degree.
D
AA vertices have the same degree.
2
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$$
3
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
4
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}}$$

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies