The Relational Model and Normalization - General Questions

1.

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: Option A

Explanation:

No answer description available for this question. Let us discuss.

2.

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: Option A

Explanation:

No answer description available for this question. Let us discuss.

3.

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: Option C

Explanation:

No answer description available for this question. Let us discuss.

4.

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: Option C

Explanation:

No answer description available for this question. Let us discuss.

5.

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: Option D

Explanation:

No answer description available for this question. Let us discuss.

6.

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: Option A

Explanation:

No answer description available for this question. Let us discuss.

7.

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: Option C

Explanation:

No answer description available for this question. Let us discuss.

8.

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: Option B

Explanation:

No answer description available for this question. Let us discuss.

1
2
3