Time Left - 10:00 mins
NILEIT 2023: 2nd, 3rd, BCNF Normal Forms
Attempt now to get your rank among 104 students!
Question 1
Consider the relational schema R(A B C D) with following functional dependency set F = {A → BC, C → D}; The relation R is in ______.
Question 2
Consider a relation R (A, B, C, D) with the following set of functional dependencies;
F = {A → B, B → C, and C → D}.
Is the decomposition of R (A, B, C, D) into R1 (A, C, D) and R2 (B, C) a dependency preserving decomposition?
Question 3
Which of the following statements is/are Incorrect?
S1 : 3NF decomposition is always lossless join and dependency preserving.
S2 : 3NF decomposition is always lossless join but may or may not be dependency preserving.
S3 : BCNF decomposition always lossless join and dependency preserving.
S4 : BCNF decomposition is always lossless join but may or may not be dependency preserving.
Question 4
A functional dependency set for the instance of the relation R(A, B,C, D,E) is
ABC-->D,
CD-->E,
D-->A
The highest normal form of this instance is?
ABC-->D,
CD-->E,
D-->A
The highest normal form of this instance is?
Question 5
Relation R is in 2 NF iff:
- 104 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSDatabasesJun 26GATE & PSU CS