Database Management System
Er Diagrams
Marks 1Marks 2
Functional Dependencies and Normalization
Marks 1Marks 2
Structured Query Language
Marks 1Marks 2
Relational Algebra
Marks 1Marks 2
Transactions and Concurrency
Marks 1Marks 2
File Structures and Indexing
Marks 1Marks 2
1
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 ____
2
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

3
GATE CSE 2021 Set 2
MCQ (More than One Correct Answer)
+2
-0

Suppose the following functional dependencies hold on a relation U with attributes P, Q, R, S, and T :

P â†’ QR

RS â†’ T

Which of the following functional dependencies can be inferred from the above functional dependencies?  

A
P â†’ R
B
PS â†’ T
C
R â†’ T
D
PS â†’ Q
4
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+2
-0.67

Consider the relation R(P, Q, S, T, X, Y, Z, W) with the following functional dependencies.

PQ â†’ X; P â†’ YX; Q â†’ Y; Y â†’ ZW

Consider the decomposition of the relation R into the constituent relations according to the following two decomposition schemes.

D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)]

D2 : R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)]

Which one of the following options is correct?

A

D1 is a lossy decomposition, but D2 is a lossless decomposition.

B
Both D1 and D2 are lossless decompositions.
C
Both D1 and D2 are lossy decompositions.
D
D1 is a lossless decomposition, but D2 is a lossy decomposition.
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization