GATE CSE 2005 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are:

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

What is the first order predicate calculus statement equivalent to the following?
Every teacher is liked by some student

$$\forall \left( x \right)\left[ {teacher\left( x \right) \to \exists \left( y \right)\left[ {student\left( y \right) \to likes\left( {y,\,x} \right)} \right]} \right]$$

$$\forall \left( x \right)\left[ {teacher\left( x \right) \to \exists \left( y \right)\left[ {student\left( y \right) \wedge likes\left( {y,\,x} \right)} \right]} \right]$$

$$\exists \left( y \right)\forall \left( x \right)\left[ {teacher\left( x \right) \to \left[ {student\left( y \right) \wedge likes\left( {y,x} \right)} \right]} \right]$$

$$\forall \left( x \right)\left[ {teacher\left( x \right) \wedge \exists \left( y \right)\left[ {student\left( y \right) \to likes\left( {y,\,x} \right)} \right]} \right]$$

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

Let $$P, Q$$ and $$R$$ be three atomic prepositional assertions. Let $$X$$ denotes $$\left( {P \vee Q} \right) \to R$$ and $$Y$$ denote $$\left( {P \to R} \right) \vee \left( {Q \to R} \right)$$.

Which one of the following is a tautology?

$$X \equiv Y$$

$$X \to Y$$

$$Y \to X$$

$$\neg Y \to X$$

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

Let $$P(x)$$ and $$Q(x)$$ be arbitrary predicates. Which of the following statement is always TRUE?

$$\left( {\forall x\left( {P\left( x \right) \vee Q\left( x \right)} \right)} \right) \Rightarrow \left( {\left( {\forall xP\left( x \right)} \right) \vee \left( {\forall xQ\left( x \right)} \right)} \right)$$

$$\left( {\forall x\left( {P\left( x \right) \Rightarrow Q\left( x \right)} \right)} \right) \Rightarrow \left( {\left( {\forall xP\left( x \right)} \right) \Rightarrow \left( {\forall xQ\left( x \right)} \right)} \right)$$

$$\left( {\left( {\forall x\left( {P\left( x \right)} \right) \Rightarrow \left( {\forall xQ\left( x \right)} \right)} \right) \Rightarrow \left( {\forall x\left( {P\left( x \right) \Rightarrow Q\left( x \right)} \right)} \right)} \right)$$

$$\left( {\left( {\forall x\left( {P\left( x \right)} \right)} \right)} \right) \Leftrightarrow \left( {\forall x\left( {Q\left( x \right)} \right)} \right) \Rightarrow \left( {\forall x\left( {P\left( x \right) \Leftrightarrow Q\left( x \right)} \right)} \right)$$

PREVIOUS NEXT

GATE CSE Papers

2023