1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following is the most appropriate logical formula to represent the statement:

"$$Gold\,and\,silver\,ornaments\,are\,precious$$"

The following notations are used:
$$G\left( x \right):\,\,x$$ is a gold ornament.
$$S\left( x \right):\,\,x$$ is a silver ornament.
$$P\left( x \right):\,\,x$$ is precious.

A
$$\forall x\left( {P\left( x \right) \to \left( {G\left( x \right) \wedge S\left( x \right)} \right)} \right)$$
B
$$\forall x\left( {\left( {G\left( x \right) \wedge S\left( x \right)} \right) \to P\left( x \right)} \right)$$
C
$$\exists x\left( {\left( {G\left( x \right) \wedge S\left( x \right)} \right) \to P\left( x \right)} \right)$$
D
$$\forall x\left( {\left( {G\left( x \right) \vee S\left( x \right)} \right) \to P\left( x \right)} \right)$$
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)
+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$$
4
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$$