*$_One solution to the multivalued dependency constraint problem is to:?

split the relation into two relations, each with a single theme.

must always be composed of two or more columns.

_For some relations, changing the data can have undesirable consequences called:$?

referential integrity constraints.

Which of the following is not a restriction for a table to be a relation?$?

No two rows in a table may be identical.

The cells of the table must contain a single value.

All of the entries in any column must be of the same kind.

No two rows in a table may be identical.

If attributes A and B determine attribute C, then it is also true that:$?

(A,B) is a composite determinant.

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):$?

referential integrity constraint.

If attributes A and B determine attribute C, then it is also true that:?

(A,B) is a composite determinant.

Which of the following is not a restriction for a table to be a relation??

No two rows in a table may be identical.

The cells of the table must contain a single value.

All of the entries in any column must be of the same kind.

No two rows in a table may be identical.

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):?

referential integrity constraint.

The different classes of relations created by the technique for preventing modification anomalies are called:?

referential integrity constraints.

40 + Mcqs in The Relational Model And Normalization in Database Page 1 McqOptions

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.

Discussion

2.	In a relation, the columns are sometimes called "attributes".%!
A.	True
B.	False
Answer» B. False

Discussion

3.	Given the functional dependency R ‚Äö√ú√≠ (S,T) , then it is also true that R ‚Äö√ú√≠ S.%!
A.	True
B.	False
Answer» B. False

Discussion

4.	In a relation, the rows are sometimes called "fields".%!
A.	True
B.	False
Answer» C.

Discussion

5.	Given the functional dependency R ‚Äö√ú√≠ S , R is called the determinant.%!
A.	True
B.	False
Answer» B. False

Discussion

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

Discussion

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

Discussion

8.	A relation has cells that hold multi-value entries.%!
A.	True
B.	False
Answer» C.

Discussion

9.	Keys made up of two or more attributes are called composite keys.%!
A.	True
B.	False
Answer» B. False

Discussion

10.	A relation is in 5NF when multivalued dependencies are isolated in their own relation.%!
A.	True
B.	False
Answer» C.

Discussion

11.	A functional dependency is always an equation.%!
A.	True
B.	False
Answer» C.

Discussion

12.	A key is a group of one or more attributes that uniquely identifies a row.%!
A.	True
B.	False
Answer» B. False

Discussion

13.	The only reason for the existence of relations is to store instances of functional dependencies.%!
A.	True
B.	False
Answer» B. False

Discussion

14.	In a relation, the rows are sometimes called "records".%!
A.	True
B.	False
Answer» B. False

Discussion

15.	A relation is in Boyce-Codd Normal Form (BCNF) if every determinant is a composite key.%!
A.	True
B.	False
Answer» C.

Discussion

16.	A functional dependency is a relationship between or among attributes.%!
A.	True
B.	False
Answer» B. False

Discussion

17.	A candidate key is a determinant that determines all the other columns is a relation.%!
A.	True
B.	False
Answer» B. False

Discussion

18.	In a relation, the order of the rows matters.%!
A.	True
B.	False
Answer» C.

Discussion

19.	Relations are categorized into normal forms according to the referential integrity constraints that they have.%!
A.	True
B.	False
Answer» C.

Discussion

20.	In a relation, the order of the columns does not matter.%!
A.	True
B.	False
Answer» B. False

Discussion

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.

Discussion

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.

Discussion

23.	*$_A functional dependency is a relationship between or among:?
A.	tables.
B.	rows.
C.	relations.
D.	attributes.
Answer» E.

Discussion

24.	*$_The primary key is selected from the:?
A.	composite keys.
B.	determinants.
C.	candidate keys.
D.	foreign keys.
Answer» D. foreign keys.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

29.	_ Row is synonymous with the term:$?
A.	record.
B.	relation.
C.	column.
D.	field.
Answer» B. relation.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

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.

Discussion

Explore topic-wise MCQs in Database.

A primary key is a composite key that was selected to be the main identifier for the relation.~!

In a relation, the columns are sometimes called "attributes".%!

Given the functional dependency R ‚Äö√ú√≠ (S,T) , then it is also true that R ‚Äö√ú√≠ S.%!

In a relation, the rows are sometimes called "fields".%!

Given the functional dependency R ‚Äö√ú√≠ S , R is called the determinant.%!

The functional dependency R ‚Äö√ú√≠ S means that the value of S can be determined when we are given a value of R.%!

Any table that meets the definition of a relation is said to be in first normal form.%!

A relation has cells that hold multi-value entries.%!

Keys made up of two or more attributes are called composite keys.%!

A relation is in 5NF when multivalued dependencies are isolated in their own relation.%!

A functional dependency is always an equation.%!

A key is a group of one or more attributes that uniquely identifies a row.%!

The only reason for the existence of relations is to store instances of functional dependencies.%!

In a relation, the rows are sometimes called "records".%!

A relation is in Boyce-Codd Normal Form (BCNF) if every determinant is a composite key.%!

A functional dependency is a relationship between or among attributes.%!

A candidate key is a determinant that determines all the other columns is a relation.%!

In a relation, the order of the rows matters.%!

Relations are categorized into normal forms according to the referential integrity constraints that they have.%!

In a relation, the order of the columns does not matter.%!

*$_One solution to the multivalued dependency constraint problem is to:?

*$_An attribute is a(n):?

*$_A functional dependency is a relationship between or among:?

*$_The primary key is selected from the:?

%_A key:_%

_ If attribute A determines both attributes B and C, then it is also true that:$?

_ A key:$?

_ In the relational model, relationships between relations or tables are created by using:$?

_ Row is synonymous with the term:$?

_A tuple is a(n):$?

_For some relations, changing the data can have undesirable consequences called:$?

_A relation is considered a:$?

_A relation is in this form if it is in BCNF and has no multivalued dependencies:$?

Which of the following is not a restriction for a table to be a relation?$?

If attributes A and B determine attribute C, then it is also true that:$?

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):$?

If attributes A and B determine attribute C, then it is also true that:?

Which of the following is not a restriction for a table to be a relation??

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):?

The different classes of relations created by the technique for preventing modification anomalies are called:?