1
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?
2
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?
3
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
Consider a relational table R that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?
4
GATE CSE 2019
MCQ (Single Correct Answer)
+2
-0.67
Let the set of functional dependencies
F = {QR → S, R → P, S → Q}
hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS).
Consider the two statements given below.
I. Both Y and Z are in BCNF
II. Decomposition of X into Y and Z is dependency preserving and lossless
Which of the above statements is/are correct?
F = {QR → S, R → P, S → Q}
hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS).
Consider the two statements given below.
I. Both Y and Z are in BCNF
II. Decomposition of X into Y and Z is dependency preserving and lossless
Which of the above statements is/are correct?
GATE CSE Subjects
Browse all chapters by subject
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages