Scribd
Upload
46 views4 pages

Document 4

The document contains 11 multiple choice questions related to database design concepts like functional dependencies, candidate keys, closure, normal forms, and referential integrity. The questions cover topics such as the definition of terms like discriminator and full functional dependency; inference rules like decomposition and augmentation; normal forms like BCNF and 3NF; and identifying candidate keys and closure of attribute sets.

Uploaded by

Huynh Duong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
46 views4 pages

Document 4

The document contains 11 multiple choice questions related to database design concepts like functional dependencies, candidate keys, closure, normal forms, and referential integrity. The questions cover topics such as the definition of terms like discriminator and full functional dependency; inference rules like decomposition and augmentation; normal forms like BCNF and 3NF; and identifying candidate keys and closure of attribute sets.

Uploaded by

Huynh Duong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

__________ refers to a attribute or group of attributes mentioned in the left hand side of the arrow in a
FD.
Discriminator
Determinant
Multivalued attribute
All of the above

2. In a functional dependency X --> Y, if Y is functionally dependent on X, but not on X's proper subsets,
then we would call the functional dependency as
Full Functional Dependency
Partial Functional Dependency
Multivalued Functional Dependency
None of the above

3. Which of the following is the result of bad database design?


Repetition of Information
Inability to represent some information
Inconsistent database state due to some transaction
All of the above

4. If X is {E, G, H, M} and Y is {G, M} then X --> Y is


Augmentation Rule
Reflexivity Rule
Union Rule
Pseudotransitivity Rule

5. If X --> YZ then X --> Y and X --> Z is


Composition Rule
Reflexivity Rule
Union Rule
Decomposition Rule

6. Consider F1 and F2 as two sets of functional dependencies. If every functional dependency in F2 can
be inferred from the functional dependencies of F1 using inference rules, then F1 is _________ of F2
Cover Set
Closure Set
Minimal Set
None of the above

7. If X --> Y is a functional dependency and X and Y are sets of attributes, what is the relationship
between X and Y?
One-to-Many
Many-to-One
One-to-One
Many-to-Many

8. For a functional dependency X --> Y, it is said to be _________ if Y is the subset or equal to X.


Total
Trivial
Non-trivial
Partial
9. To check whether X (a set of one or more attributes) is a candidate key of relation R, we need to find
______ of X.
Canonical Cover
Closure
Minimal Cover
None of the above

10. (a) If every functional dependency in F1 can be inferred from F2 on application of inference rules, and
(b) removal of any one attribute from any functional dependency of F2 violates (a).
Then F2 is called ______ for F1.
Minimal Cover
Canonical Cover
Both Minimal and Canonical Cover
None of the above

11.A relationship R connecting entity sets E and F has referential integrity


from E to F, i.e., the edge connecting R and F has an arrow directed
towards F. Which among the following statements may be true?
a) R is many-to-many from E to F
b) R is many-to-one from E to F
c) R is many-to-one from F to E
d) R is one-to-one from E to F
Complete the following sentence with most appropriate of the given
options: “The closure of a set of attributes is a set of ________”.
a) keys
b) attributes
c) functional dependencies
d) candidate keys
In a schedule S with two transactions T1 and T2, T1 reads the data item
which was produced by T2 and T1 commits before T2 commits. In this
case, the schedule S is said to be a _________ schedule.
a) recoverable
b) non-recoverable
c) conflict serializable
d) serial
A relationship R connecting entity sets E and F has referential integrity from E to F, i.e., the edge
connecting R and F has an arrow directed towards F. Which of the following statements may be true?
R is one-one from E to F
R is many-one from E to F
Choice 2 only
Both choices 1 and 2

2. A relation with two attributes A and B satisfies the functional dependency A → B. Then the functional
dependency B → A also holds in the relation.
TRUE
FALSE

3. A relation R(A,B,C) satisfies the functional dependencies A → B, A → C, and B → A. Then, we can say
that R is in BCNF.
TRUE
FALSE

4. A relation R(A,B,C) satisfies the functional dependencies A → B, A → C, and B → A. Which of the


following are valid candidate keys?
A
B
Both choices 1 and 2
A alone

5. Which of the following sentences are true??


4NF implies BCNF
4NF implies 3NF
3NF implies 4NF
Both choices 1 and 2

6. Assume that we have the following four records in a relation R(A, B, C): (1,2,3), (4,2,3), (5,3,3), and
(5,3,4). Which of the following FDs does not hold on R?
BC → A
B→C
C→B
All of the above

7. For a relation R1(A,C,B,D,E), with dependencies A → B, and C → D which of the following is the
candidate key?
{ABC}
{ACE}
{ADE}
{ABE}

8. The closure of set of attributes is said to be a set of ____________.


Functional Dependencies
Attributes
Keys
Multivalued Attributes

9. {A1, A2, …, An}+ is the set of all attributes of R if and only if A1, A2, …, An is a _______________ for
R.
Prime attribute
Closure attributes
Super key
All of the above

10. Assume that the following set of FDs A → B, B → C, C → A, D → E, E → D are holding on a relation
R(A,B,C,D,E). Which of the following sets of tuples satisfy this.
a1 b1 c1 d1 e1, a1 b1 c1 d2 e2
a1 b1 c1 d1 e1, a1 b2 c1 d2 e2
a1 b1 c1 d1 e2, a1 b1 c1 d2 e2
None of the above

You might also like