MCQOPTIONS
Saved Bookmarks
This section includes 7 Mcqs, each offering curated multiple-choice questions to sharpen your Database knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
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 |
| Answer» B. More than zero but less than that of an equivalent 3NF decomposition | |
| 2. |
The functional dependency can be tested easily on the materialized view, using the constraints ____________. |
| A. | Primary key |
| B. | Null |
| C. | Unique |
| D. | Both Null and Unique |
| Answer» E. | |
| 3. |
The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is |
| A. | BCNF algorithm |
| B. | 2NF algorithm |
| C. | 3NF synthesis algorithm |
| D. | 1NF algorithm |
| Answer» E. | |
| 4. |
Which of the following relation holds? |
| A. | Course id-> title, dept name, credits |
| B. | Title-> dept name, credits |
| C. | Dept name-> credits |
| D. | Cannot be determined |
| Answer» D. Cannot be determined | |
| 5. |
R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition? |
| A. | A->B, B->CD |
| B. | A->B, B->C, C->D |
| C. | AB->C, C->AD |
| D. | A->BCD |
| Answer» E. | |
| 6. |
What are the desirable properties of a decomposition |
| A. | Partition constraint |
| B. | Dependency preservation |
| C. | Redundancy |
| D. | Security |
| Answer» C. Redundancy | |
| 7. |
A relation is in ____________ if an attribute of a composite key is dependent on an attribute of other composite key. |
| A. | 2NF |
| B. | 3NF |
| C. | BCNF |
| D. | 1NF |
| Answer» C. BCNF | |