1. Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that:
2. The different classes of relations created by the technique for preventing modification anomalies are called:
3. A relation is in this form if it is in BCNF and has no multivalued dependencies:
4. Row is synonymous with the term:
5. The primary key is selected from the:
6. Which of the following is a group of one or more attributes that uniquely identifies a row?
7. 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):
8. A relation is considered a:
9. In the relational model, relationships between relations or tables are created by using:
10. A functional dependency is a relationship between or among:
11. Table is synonymous with the term:
12. Which of the following is not a restriction for a table to be a relation?
13. For some relations, changing the data can have undesirable consequences called:
14. A key:
15. An attribute is a(n):
16. A relation in this form is free of all modification anomalies.
17. If attributes A and B determine attribute C, then it is also true that:
18. A tuple is a(n):
19. If attribute A determines both attributes B and C, then it is also true that:
20. One solution to the multivalued dependency constraint problem is to:
21. In a relation, the order of the rows matters.
22. In a relation, the rows are sometimes called "records".
23. A relation is a two-dimensional table.
24. Any table that meets the definition of a relation is said to be in first normal form.
25. Given the functional dependency R → (S,T) , then it is also true that R → S.
26. A candidate key is a determinant that determines all the other columns is a relation.
27. The only reason for the existence of relations is to store instances of functional dependencies.
28. A relation is in 5NF when multivalued dependencies are isolated in their own relation.
29. The functional dependency R → S means that the value of S can be determined when we are given a value of R.
30. In a relation, the columns are sometimes called "attributes".
31. In a relation, the order of the columns does not matter.
32. A functional dependency is a relationship between or among attributes.
33. A key is a group of one or more attributes that uniquely identifies a row.
34. Keys made up of two or more attributes are called composite keys.
35. Given the functional dependency R → S , R is called the determinant.
36. Relations are categorized into normal forms according to the referential integrity constraints that they have.
37. A relation is in Boyce-Codd Normal Form (BCNF) if every determinant is a composite key.
38. A functional dependency is always an equation.
39. A relation has cells that hold multi-value entries.
40. In a relation, the rows are sometimes called "fields".
41. A primary key is a composite key that was selected to be the main identifier for the relation.
42. A primary key is a composite key that was selected to be the main identifier for the relation.
43. A primary key is a composite key that was selected to be the main identifier for the relation.
44. A primary key is a composite key that was selected to be the main identifier for the relation.