1
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}}$$
2
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$$
3
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Let $$G$$ be the non-planar graph with minimum possible number of edges. Then $$G$$ has
A
9 edges and 5 vertices
B
9 edges and 6 vertices
C
10 edges and 5 vertices
D
10 edges and 6 vertices
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the set of (column) vectors defined by $$X = \,\{ \,x\, \in \,{R^3}\,\left| {{x_1}\, + \,{x_2}\, + \,{x_3} = 0} \right.$$, where $${x^T} = \,{[{x_1}\, + \,{x_2}\, + \,{x_3}]^T}\} .$$ Which of the following is TRUE?
A
$$\left\{ {{{\left[ {1,\, - 1,\,0} \right]}^T},\,{{\left[ {1,\,\,0 ,- 1,\,} \right]}^T}} \right\}$$ is a basis for the subspace X.
B
$$\left\{ {{{\left[ {1,\, - 1,\,0} \right]}^T},\,{{\left[ {1,\,\,0,\, - 1,\,} \right]}^T}} \right\}$$ is a linearly independent set, but it does not span X and therefore is not a basis of X.
C
X is not a subspace of $${R^3}$$.
D
None of the above.
EXAM MAP