1
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+2
-0

Consider the following relational schema along with all the functional dependencies that hold on them.

$$\begin{aligned} & R 1(A, B, C, D, E):\{D \rightarrow E, E A \rightarrow B, E B \rightarrow C\} \\ & R 2(A, B, C, D):\{A \rightarrow D, A \rightarrow B, C \rightarrow A\} \end{aligned}$$

Which of the following statement(s) is/are TRUE?

A
$R 1$ is in 3NF
B
$R 2$ is in 3 NF
C
$R 1$ is NOT in 3 NF
D
$R 2$ is NOT in 3NF
2
GATE CSE 2025 Set 1
MCQ (More than One Correct Answer)
+2
-0

Consider a relational schema team(name, city, owner), with functional dependencies \{name $\rightarrow$ city, name $\rightarrow$ owner}.

The relation team is decomposed into two relations, $t 1$ (name, city) and $t 2$ (name, owner). Which of the following statement(s) is/are TRUE?

A
The relation team is NOT in BCNF.
B
The relations $t 1$ and $t 2$ are in BCNF.
C
The decomposition constitutes a lossless join.
D
The relation team is NOT in 3NF.
3
GATE CSE 2024 Set 2
Numerical
+2
-0

A functional dependency $F: X \to Y$ is termed as a useful functional dependency if and only if it satisfies all the following three conditions:

  • $X$ is not the empty set.
  • $Y$ is not the empty set.
  • Intersection of $X$ and $Y$ is the empty set.

For a relation $R$ with 4 attributes, the total number of possible useful functional dependencies is _________

Your input ____
4
GATE CSE 2024 Set 1
MCQ (More than One Correct Answer)
+2
-0

The symbol → indicates functional dependency in the context of a relational database. Which of the following options is/are TRUE?

A

(X, Y) → (Z, W) implies X → (Z, W)

B

(X, Y) → (Z, W) implies (X, Y) → Z

C

((X, Y) → Z and W → Y) implies (X, W) → Z

D

(X → Y and Y → Z) implies X → Z

GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP