1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is the negation of $$$\left[ {\forall x,\alpha \to \left( {\exists y,\beta \to \left( {\forall u,\exists v,\gamma } \right)} \right)} \right]?$$$
A
$$\left[ {\exists x,\alpha \to \left( {\forall y,\beta \to \left( {\exists u,\forall v,\gamma } \right)} \right)} \right]$$
B
$$\left[ {\exists x,\alpha \to \left( {\forall y,\beta \to \left( {\exists u,\forall v,\neg \gamma } \right)} \right)} \right]$$
C
$$\left[ {\forall x,\neg \alpha \to \left( {\exists y,\neg \beta \to \left( {\forall u,\exists v,\neg \gamma } \right)} \right)} \right]$$
D
$$\left[ {\exists x,\alpha \wedge \left( {\forall y,\beta \wedge \left( {\exists u,\forall v,\neg \gamma } \right)} \right)} \right]$$
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following first order formulae is logically valid? Here $$\alpha \left( x \right)$$ is a first order formulae with $$x$$ as a free variable, and $$\beta $$ is a first order formula with no free variable.
A
$$\left[ {\beta \to \left( {\exists x,\alpha \left( x \right)} \right)} \right] \to \left[ {\forall x,\beta \to \alpha \left( x \right)} \right]$$
B
$$\left[ {\exists x,\beta \to \alpha \left( x \right)} \right] \to \left[ {\beta \to \left( {\forall x,\alpha \left( x \right)} \right)} \right]$$
C
$$\left[ {\left( {\exists x,\alpha \left( x \right)} \right) \to \beta } \right] \to \left[ {\forall x,\alpha \left( x \right) \to \beta } \right]$$
D
$$\left[ {\left( {\forall x,\alpha \left( x \right)} \right) \to \beta } \right] \to \left[ {\forall x,\alpha \left( x \right) \to \beta } \right]$$
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
If $$P$$, $$Q$$, $$R$$ are Boolean variables, then $$(P + \bar{Q}) (P.\bar{Q} + P.R) (\bar{P}.\bar{R} + \bar{Q})$$ simplifies to
A
$$P.\overline Q $$
B
$$P.\overline R $$
C
$$P.\overline Q + R$$
D
$$P.\overline R + Q$$
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Which one of these first-order logic formulae is valid?
A
$$\forall x\left( {P\left( x \right) \Rightarrow Q\left( x \right)} \right) \Rightarrow \left( {\left( {\forall xP\left( x \right)} \right) \Rightarrow \left( {\forall xQ\left( x \right)} \right)} \right)$$
B
$$\exists x\left( {P\left( x \right) \vee Q\left( x \right)} \right) \Rightarrow \left( {\left( {\exists xP\left( x \right)} \right) \Rightarrow \left( {\exists xQ\left( x \right)} \right)} \right)$$
C
$$\exists x\left( {P\left( x \right) \wedge Q\left( x \right)} \right) \Leftrightarrow \left( {\left( {\exists xP\left( x \right)} \right) \wedge \left( {\exists xQ\left( x \right)} \right)} \right)$$
D
$$\forall x\exists yP\left( {x,y} \right) \Rightarrow \exists y\forall xP\left( {x,y} \right)$$

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies