1
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:
A
n/2
B
(n-1)/3
C
(n-1)/2
D
(2n+1)/3
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 2002
MCQ (Single Correct Answer)
+2
-0.6
From the following instance of a relation schema $$R(A, B, C),$$ we can conclude that: GATE CSE 2002 Database Management System - Functional Dependencies and Normalization Question 23 English
A
A functionally determines $$B$$ and $$B$$ functionally determines $$C$$
B
A functionally determines $$B$$ and $$B$$ does not functionally determines $$C$$
C
$$B$$ does not functionally determines $$C$$
D
A does not functionally determine $$B$$ and $$B$$ does not functionally determine $$C$$
4
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
Relation $$R$$ is decomposed using a set of functional dependencies, $$F,$$ and relation $$S$$ is decomposed using another set of functional dependencies, $$G.$$ One decomposition is definitely $$BCNF,$$ the other is definitely. $$3NF,$$ but it is not known which is which. To make a guaranteed identification, which one of the following tests should be used on the decompositions? (Assume that the closures of $$F$$ and $$G$$ are available).
A
Dependency-preservation
B
Lossless-join
C
$$BCNF$$ definition
D
$$3$$ $$NF$$ definition
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12