Question 1 of 25
Hints left: 3
Q1
In a relation, the order of the columns does not matter.
Q2
Any table that meets the definition of a relation is said to be in first normal form.
Q3
Relations are categorized into normal forms according to the referential integrity constraints that they have.
Q4
Given the functional dependency R → S , R is called the determinant.
Q5
A relation is in Boyce-Codd Normal Form (BCNF) if every determinant is a composite key.
Q6
In a relation, the order of the rows matters.
Q7
If attributes A and B determine attribute C, then it is also true that:
Q8
If attribute A determines both attributes B and C, then it is also true that:
Q10
A relation is in 5NF when multivalued dependencies are isolated in their own relation.
Q11
One solution to the multivalued dependency constraint problem is to:
Q13
A candidate key is a determinant that determines all the other columns is a relation.
Q14
Keys made up of two or more attributes are called composite keys.
Q15
A relation in this form is free of all modification anomalies.
Q16
An attribute is a(n):
Q17
In a relation, the columns are sometimes called "attributes".
Q18
In a relation, the rows are sometimes called "records".
Q19
The functional dependency R → S means that the value of S can be determined when we are given a value of R.
Q20
The only reason for the existence of relations is to store instances of functional dependencies.
Q21
A relation is a two-dimensional table.
Q22
A key is a group of one or more attributes that uniquely identifies a row.
Q23
Given the functional dependency R → (S,T) , then it is also true that R → S.
Q24
For some relations, changing the data can have undesirable consequences called:
Q25
A functional dependency is a relationship between or among attributes.