GATE CSE 2026 Set 1 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2026 Set 1

MCQ (More than One Correct Answer)

-0

In the context of relational database normalization, which of the following statements is/ are true?

It is always possible to obtain a dependency-preserving 3NF decomposition of a relation

It is always possible to obtain a dependency-preserving 1NF decomposition of a relation

It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation

It is not always possible to obtain a dependency-preserving 2NF decomposition of a relation

GATE CSE 2026 Set 1

MCQ (Single Correct Answer)

-0

Consider a relational database schema with two relations $R(P, Q)$ and $S(X, Y)$.

Let $E=\{\langle u\rangle \mid \exists v \exists w\langle u, v\rangle \in R \wedge\langle v, w\rangle \in S\}$ be a tuple relational calculus expression. Which one of the following relational algebraic expressions is equivalent to $E$ ?

$\Pi_P\left(R \bowtie_{R . P=S . X} S\right)$

$\Pi_P\left(S \bowtie_{S . X=R . Q} R\right)$

$\Pi_P\left(R \bowtie_{R . P=S . Y} S\right)$

$\Pi_P\left(S \bowtie_{S . Y=R . Q} R\right)$

GATE CSE 2026 Set 1

Numerical

-0

Consider a relational database schema with a relation $R(A, B, C, D)$. If $\{A, B\}$ and $\{A, C\}$ are the only two candidate keys of the relation $R$, then the number of superkeys of relation $R$ is $\_\_\_\_$ . (answer in integer)

Your input ____

GATE CSE 2026 Set 1

MCQ (More than One Correct Answer)

-0

Consider the following Boolean expression of a function $F$ :

$$ F(P, Q)=(\bar{P}+Q) \oplus(\bar{P} Q) $$

Which of the following expressions is/are equivalent to $F$ ?

$\overline{P \oplus Q}$

$P \oplus Q$

$\bar{P} \oplus Q$

$\bar{P} \oplus \bar{Q}$

PREVIOUS NEXT

GATE CSE Papers

All year-wise previous year question papers

2026