MCQOPTIONS
Saved Bookmarks
This section includes 39 Mcqs, each offering curated multiple-choice questions to sharpen your Database knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Given the functional dependency , is called the determinant. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
The functional dependency means that the value of S can be determined when we are given a value of R. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 3. |
Given the functional dependency , then it is also true that . |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
Given the functional dependency R → S , R is called the determinant. |
| A. | rue |
| B. | alse |
| Answer» B. alse | |
| 5. |
In a relation, the rows are sometimes called "fields". |
| A. | rue |
| B. | alse |
| Answer» C. | |
| 6. |
In a relation, the columns are sometimes called "attributes". |
| A. | rue |
| B. | alse |
| Answer» B. alse | |
| 7. |
The functional dependency R → S means that the value of S can be determined when we are given a value of R. |
| A. | rue |
| B. | alse |
| Answer» B. alse | |
| 8. |
Given the functional dependency R → (S,T) , then it is also true that R → S. |
| A. | rue |
| B. | alse |
| Answer» B. alse | |
| 9. |
In a relation, the rows are sometimes called "records". |
| A. | rue |
| B. | alse |
| Answer» B. alse | |
| 10. |
A relation is in Boyce-Codd Normal Form (BCNF) if every determinant is a composite key. |
| A. | 1 |
| B. | |
| Answer» C. | |
| 11. |
The functional dependency R ‚Üí S means that the value of S can be determined when we are given a value of R. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 12. |
A relation has cells that hold multi-value entries. |
| A. | 1 |
| B. | |
| Answer» C. | |
| 13. |
In a relation, the rows are sometimes called "fields." |
| A. | 1 |
| B. | |
| Answer» C. | |
| 14. |
The only reason for the existence of relations is to store instances of functional dependencies. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 15. |
In a relation, the columns are sometimes called "attributes." |
| A. | 1 |
| B. | |
| Answer» B. | |
| 16. |
A functional dependency is always an equation. |
| A. | 1 |
| B. | |
| Answer» C. | |
| 17. |
Keys made up of two or more attributes are called composite keys. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 18. |
A functional dependency is a relationship between or among attributes. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 19. |
A relation is in 5NF when multivalued dependencies are isolated in their own relation. |
| A. | 1 |
| B. | |
| Answer» C. | |
| 20. |
Given the functional dependency R ‚Üí S , R is called the determinant. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 21. |
A key is a group of one or more attributes that uniquely identifies a row. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 22. |
In the relational model, relationships between relations or tables are created by using: |
| A. | composite keys. |
| B. | determinants. |
| C. | candidate keys. |
| D. | foreign keys. |
| Answer» E. | |
| 23. |
Given the functional dependency R ‚Üí (S,T) , then it is also true that R ‚Üí S. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 24. |
A functional dependency is a relationship between or among: |
| A. | tables. |
| B. | rows. |
| C. | relations. |
| D. | attributes. |
| Answer» E. | |
| 25. |
If attribute A determines both attributes B and C, then it is also true that: |
| A. | A ‚Üí B. |
| B. | B ‚Üí A. |
| C. | C ‚Üí A. |
| D. | (B,C) ‚Üí A. |
| Answer» B. B ‚Üí A. | |
| 26. |
A candidate key is a determinant that determines all the other columns is a relation. |
| A. | 1 |
| B. | |
| C. | 1 |
| D. | |
| Answer» B. | |
| 27. |
Any table that meets the definition of a relation is said to be in first normal form. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 28. |
A relation is considered a: |
| A. | Column. |
| B. | one-dimensional table. |
| C. | two-dimensional table. |
| D. | three-dimensional table. |
| Answer» D. three-dimensional table. | |
| 29. |
A primary key is a composite key that was selected to be the main identifier for the relation. |
| A. | 1 |
| B. | |
| Answer» C. | |
| 30. |
Relations are categorized into normal forms according to the referential integrity constraints that they have. |
| A. | 1 |
| B. | |
| C. | 1 |
| D. | |
| Answer» C. 1 | |
| 31. |
If attributes A and B determine attribute C, then it is also true that: |
| A. | A ‚Üí C. |
| B. | B ‚Üí C. |
| C. | (A,B) is a composite determinant. |
| D. | C is a determinant. |
| Answer» D. C is a determinant. | |
| 32. |
In a relation, the rows are sometimes called "records." |
| A. | 1 |
| B. | |
| Answer» B. | |
| 33. |
In a relation, the order of the columns does not matter. |
| A. | 1 |
| B. | |
| C. | 1 |
| D. | |
| Answer» B. | |
| 34. |
A relation in this form is free of all modification anomalies. |
| A. | First normal form |
| B. | Second normal form |
| C. | Third normal form |
| D. | Domain/key normal form |
| Answer» E. | |
| 35. |
The primary key is selected from the: |
| A. | composite keys. |
| B. | determinants. |
| C. | candidate keys. |
| D. | foreign keys. |
| Answer» D. foreign keys. | |
| 36. |
The different classes of relations created by the technique for preventing modification anomalies are called: |
| A. | normal forms. |
| B. | referential integrity constraints. |
| C. | functional dependencies. |
| D. | None of the above is correct. |
| Answer» B. referential integrity constraints. | |
| 37. |
In a relation, the order of the rows matters. |
| A. | 1 |
| B. | |
| C. | 1 |
| D. | |
| Answer» C. 1 | |
| 38. |
A relation is in this form if it is in BCNF and has no multivalued dependencies: |
| A. | second normal form. |
| B. | third normal form. |
| C. | fourth normal form. |
| D. | domain/key normal form. |
| Answer» D. domain/key normal form. | |
| 39. |
Which of the following is a group of one or more attributes that uniquely identifies a row? |
| A. | Key |
| B. | Determinant |
| C. | Tuple |
| D. | Relation |
| Answer» B. Determinant | |