1
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
What is the chromatic number of an $$n$$-vertex simple connected graph which does not contain any odd length cycle? Assume $$n \ge 2$$.
A
$$2$$
B
$$3$$
C
$$n-1$$
D
$$n$$
2
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.
3
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
$$\int\limits_0^{\pi /4} {\left( {1 - \tan x} \right)/\left( {1 + \tan x} \right)dx} $$ $$\,\,\,\,\,\,$$ evaluates to
A
$$0$$
B
$$1$$
C
In $$2$$
D
$${1 \over 2}$$ in $$2$$
4
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
An unbalanced dice (with 6 faces, numbered from 1 to 6) is thrown. The probability that the face value is odd is 90% of the probability that the face valueis even. The probability of getting any even bnumbered face is the same.

If the probability that the face is even given that it is greater than 3 is 0.75, which one of the following options is closest to the probability that the face value exceeds 3?

A
0.453
B
0.468
C
0.485
D
0.492