1
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following statements about normal forms is FALSE?
A
$$BCNF$$ is stricter than $$3NF$$
B
Lossless, dependency $$-$$ preserving decomposition into $$3NF$$ is always possible
C
Lossless, dependency - preserving decomposition into $$BCNF$$ is always possible
D
Any relation with two attributes is in $$BCNF$$
2
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
Relation $$R$$ with an associated set of functional dependencies, $$F,$$ is decomposed into $$BCNF.$$ The redundancy (arising out of functional dependencies) in the resulting set of relations is
A
Zero
B
More than zero but less than that of an equivalent $$3NF$$ decomposition
C
Proportional to the size of $${F^ + }$$
D
Indeterminate
3
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Consider a schema $$R(A,B,C,D)$$ and functional dependencies $$A \to B\,\,$$ and $$C \to D\,\,$$. Then the decomposition of $$R$$ into $${R_1}\left( {AB} \right)$$ and $${R_2}\left( {CD} \right)$$ is
A
Dependency preserving and lossless join
B
Lossless join but not dependency preserving
C
Dependency preserving but not lossless join
D
Not dependency preserving and not lossless join
4
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Let $$R=(A,B,C,D,E,F)$$ be a relation scheme with the following dependencies: $$C \to F,\,E \to A,\,EC \to D,\,A \to B.$$ Which of the following is a key for $$R?$$
A
$$CD$$
B
$$EC$$
C
$$AE$$
D
$$AC$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP