MCQOPTIONS
Saved Bookmarks
This section includes 40 Mcqs, each offering curated multiple-choice questions to sharpen your Database knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A primary key is a composite key that was selected to be the main identifier for the relation.~! |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
In a relation, the columns are sometimes called "attributes".%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 3. |
Given the functional dependency R ‚Üí (S,T) , then it is also true that R ‚Üí S.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
In a relation, the rows are sometimes called "fields".%! |
| A. | True |
| B. | False |
| Answer» C. | |
| 5. |
Given the functional dependency R ‚Üí S , R is called the determinant.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
The functional dependency R ‚Üí S means that the value of S can be determined when we are given a value of R.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 7. |
Any table that meets the definition of a relation is said to be in first normal form.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 8. |
A relation has cells that hold multi-value entries.%! |
| A. | True |
| B. | False |
| Answer» C. | |
| 9. |
Keys made up of two or more attributes are called composite keys.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 10. |
A relation is in 5NF when multivalued dependencies are isolated in their own relation.%! |
| A. | True |
| B. | False |
| Answer» C. | |
| 11. |
A functional dependency is always an equation.%! |
| A. | True |
| B. | False |
| Answer» C. | |
| 12. |
A key is a group of one or more attributes that uniquely identifies a row.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 13. |
The only reason for the existence of relations is to store instances of functional dependencies.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 14. |
In a relation, the rows are sometimes called "records".%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 15. |
A relation is in Boyce-Codd Normal Form (BCNF) if every determinant is a composite key.%! |
| A. | True |
| B. | False |
| Answer» C. | |
| 16. |
A functional dependency is a relationship between or among attributes.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 17. |
A candidate key is a determinant that determines all the other columns is a relation.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 18. |
In a relation, the order of the rows matters.%! |
| A. | True |
| B. | False |
| Answer» C. | |
| 19. |
Relations are categorized into normal forms according to the referential integrity constraints that they have.%! |
| A. | True |
| B. | False |
| Answer» C. | |
| 20. |
In a relation, the order of the columns does not matter.%! |
| A. | True |
| B. | False |
| Answer» B. False | |
| 21. |
*$_One solution to the multivalued dependency constraint problem is to:? |
| A. | split the relation into two relations, each with a single theme. |
| B. | change the theme. |
| C. | create a new theme. |
| D. | add a composite key. |
| Answer» B. change the theme. | |
| 22. |
*$_An attribute is a(n):? |
| A. | column of a table. |
| B. | two dimensional table. |
| C. | row of a table. |
| D. | key of a table. |
| Answer» B. two dimensional table. | |
| 23. |
*$_A functional dependency is a relationship between or among:? |
| A. | tables. |
| B. | rows. |
| C. | relations. |
| D. | attributes. |
| Answer» E. | |
| 24. |
*$_The primary key is selected from the:? |
| A. | composite keys. |
| B. | determinants. |
| C. | candidate keys. |
| D. | foreign keys. |
| Answer» D. foreign keys. | |
| 25. |
%_A key:_% |
| A. | must always be composed of two or more columns. |
| B. | can only be one column. |
| C. | identifies a row. |
| D. | identifies a column. |
| Answer» D. identifies a column. | |
| 26. |
_ 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. | |
| 27. |
_ A key:$? |
| A. | must always be composed of two or more columns. |
| B. | can only be one column. |
| C. | identifies a row. |
| D. | identifies a column. |
| Answer» D. identifies a column. | |
| 28. |
_ 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. | |
| 29. |
_ Row is synonymous with the term:$? |
| A. | record. |
| B. | relation. |
| C. | column. |
| D. | field. |
| Answer» B. relation. | |
| 30. |
_A tuple is a(n):$? |
| A. | column of a table. |
| B. | two dimensional table. |
| C. | row of a table. |
| D. | key of a table. |
| Answer» D. key of a table. | |
| 31. |
_For some relations, changing the data can have undesirable consequences called:$? |
| A. | referential integrity constraints. |
| B. | modification anomalies. |
| C. | normal forms. |
| D. | transitive dependencies. |
| Answer» C. normal forms. | |
| 32. |
_A relation is considered a:$? |
| A. | Column. |
| B. | one-dimensional table. |
| C. | two-dimensional table. |
| D. | three-dimensional table. |
| Answer» D. three-dimensional table. | |
| 33. |
_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. | |
| 34. |
Which of the following is not a restriction for a table to be a relation?$? |
| A. | The cells of the table must contain a single value. |
| B. | All of the entries in any column must be of the same kind. |
| C. | The columns must be ordered. |
| D. | No two rows in a table may be identical. |
| Answer» D. No two rows in a table may be identical. | |
| 35. |
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. | |
| 36. |
When the values in one or more attributes being used as a foreign key must exist in another set of one or more attributes in another table, we have created a(n):$? |
| A. | transitive dependency. |
| B. | insertion anomaly. |
| C. | referential integrity constraint. |
| D. | normal form. |
| Answer» D. normal form. | |
| 37. |
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. | |
| 38. |
Which of the following is not a restriction for a table to be a relation?? |
| A. | The cells of the table must contain a single value. |
| B. | All of the entries in any column must be of the same kind. |
| C. | The columns must be ordered. |
| D. | No two rows in a table may be identical. |
| Answer» D. No two rows in a table may be identical. | |
| 39. |
When the values in one or more attributes being used as a foreign key must exist in another set of one or more attributes in another table, we have created a(n):? |
| A. | transitive dependency. |
| B. | insertion anomaly. |
| C. | referential integrity constraint. |
| D. | normal form. |
| Answer» D. normal form. | |
| 40. |
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. | |