GATE CSE 2001 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2001

MCQ (Single Correct Answer)

-0.6

Which of the following relational calculus expressions is not safe?

$$\left\{t \mid \exists u \in R_1\left(t[A] = u[A]\right) \land \neg \exists s \in R_2 \left(t[A] = s[A]\right)\right\}$$

$$\left\{ t \mid \forall u \in R_1\left(u[A]="x"\Rightarrow \exists s \in R_2\left(t[A] = s[A] \land s[A] = u[A]\right)\right) \right\}$$

$$\left\{t \mid \neg (t \in R_1)\right\}$$

$$\left\{t \mid \exists u \in R_1\left(t[A]=u[A]\right) \land \exists s \in R_2 \left(t[A] = s[A]\right)\right\}$$

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Consider a schema $$R(A,B,C,D)$$ and functional dependencies $$A \to B\,\,$$ and $$C \to D\,\,$$. Then the decomposition of $$R$$ into $${R_1}\left( {AB} \right)$$ and $${R_2}\left( {CD} \right)$$ is

Dependency preserving and lossless join

Lossless join but not dependency preserving

Dependency preserving but not lossless join

Not dependency preserving and not lossless join

GATE CSE 2001

MCQ (Single Correct Answer)

-0.6

$$R(A,B,C,D)$$ is a relation. Which of the following does not have a lossless-join, dependency preserving $$BCNF$$ decomposition?

$$A \to B,\,B \to CD$$

$$A \to B,\,B \to C.\,C \to D$$

$$AB \to C,\,C \to AD$$

$$A \to BCD$$

GATE CSE 2001

MCQ (Single Correct Answer)

-0.6

Consider the circuit given below with initial state $${Q_0} = 1,\,\,{Q_1} = {Q_2} = 0.$$ The state of the circuit is given by the value of $$4{Q_2} + 2{Q_1} + {Q_{0.}}$$ GATE CSE 2001 Digital Logic - Sequential Circuits Question 23 English

GATE CSE 2001 Digital Logic - Sequential Circuits Question 23 English

Which one of the following is correct state sequence of the circuit?

$$1,3,4,6,7,5,2$$

$$1, 2, 5, 3, 7, 6, 4$$

$$1, 2, 7, 3, 5, 6, 4$$

$$1, 6, 5, 7, 2, 3, 4$$

PREVIOUS NEXT

GATE CSE Papers

2024