MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 17 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A _________ Fc for F is a set of dependencies such that F logically implies all dependencies in Fc, and Fc logically implies all dependencies in F. |
| A. | Canonical cover |
| B. | Complete cover |
| C. | Canonical dependency |
| D. | Canonical clause |
| Answer» B. Complete cover | |
| 2. |
We say that a decomposition having the property F’+ = F+ is a __________ decomposition. |
| A. | Dependency losing |
| B. | Dependency preserving |
| C. | Lossless |
| D. | None of the mentioned |
| Answer» C. Lossless | |
| 3. |
If B is an attribute and A→B, Then B is said to be ________ by a. |
| A. | Logically implied |
| B. | Functionally implied |
| C. | Logically determined |
| D. | Functionally determined |
| Answer» E. | |
| 4. |
If A→B, A→ C then which of the following is true? |
| A. | A→BC |
| B. | A→B |
| C. | A→C |
| D. | All of the mentioned |
| Answer» E. | |
| 5. |
State true or false: Armstrong’s axioms allow us to generate all F+ for any given F |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
A functional dependency f on R is _______ by a set of functional dependencies F on r if every instance of r(R) that satisfies f also satisfies F. |
| A. | Logically Defined |
| B. | Logically Derived |
| C. | Logically implied |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 7. |
WE_SAY_THAT_A_DECOMPOSITION_HAVING_THE_PROPERTY_F‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•+_=_F+_IS_A____________DECOMPOSITION.?$# |
| A. | Dependency losing |
| B. | Dependency preserving |
| C. | Lossless |
| D. | None of the mentioned |
| Answer» C. Lossless | |
| 8. |
A___________Fc_for_F_is_a_set_of_dependencies_such_that_F_logically_implies_all_dependencies_in_Fc,_and_Fc_logically_implies_all_dependencies_in_F.$ |
| A. | Canonical cover |
| B. | Complete cover |
| C. | Canonical dependency |
| D. | Canonical clause |
| Answer» B. Complete cover | |
| 9. |
If B is an attribute and A‚ÜíB, Then B is said to be ________ by a?# |
| A. | Logically implied |
| B. | Functionally implied |
| C. | Logically determined |
| D. | Functionally determined |
| Answer» E. | |
| 10. |
If A‚ÜíB, A‚Üí C then which of the following is true?$ |
| A. | A‚ÜíBC |
| B. | A‚ÜíB |
| C. | A‚ÜíC |
| D. | All of the mentioned |
| Answer» E. | |
| 11. |
State true or false: Functional dependencies are transitive |
| A. | True |
| B. | False |
| Answer» B. False | |
| 12. |
Armstrong axioms are called sound because? |
| A. | They are expensive |
| B. | They cannot generate correct functional dependencies |
| C. | They allow us to generate the complete closure |
| D. | They cannot generate incorrect functional dependencies |
| Answer» E. | |
| 13. |
State true or false: Armstrong’s axioms allow us to generate all F+ for any given F$ |
| A. | True |
| B. | False |
| Answer» B. False | |
| 14. |
If a functional dependency is reflexive, B is a subset of A and A is the set of attributes, then |
| A. | B‚ÜíA holds |
| B. | A‚ÜíB holds |
| C. | AB‚ÜíC holds |
| D. | None of the mentioned |
| Answer» C. AB‚Äö√Ñ√∂‚àö√∫‚àö‚â†C holds | |
| 15. |
Which of the following is not Armstrong’s Axiom?$ |
| A. | Reflexivity rule |
| B. | Transitivity rule |
| C. | Pseudotransitivity rule |
| D. | Augmentation rule |
| Answer» D. Augmentation rule | |
| 16. |
If F is a set of functional dependencies, then the closure of F is denoted by? |
| A. | F* |
| B. | Fo |
| C. | F+ |
| D. | F |
| Answer» D. F | |
| 17. |
A functional dependency f on R is _______ by a set of functional dependencies F on r if every instance of r(R) that satisfies f also satisfies F. |
| A. | Logically Defined |
| B. | Logically Derived |
| C. | Logically implied |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |