Chapter:

30+ Relational Database Design Solved MCQs

in DataBase Management System (DBMS)

Chapters

1.	In the __________ normal form, a composite attribute is converted to individual attributes.
A.	First
B.	Second
C.	Third
D.	Fourth
Answer» A. First

discuss

2.	Tables in second normal form (2NF):
A.	Eliminate all hidden dependencies
B.	Eliminate the possibility of a insertion anomalies
C.	Have a composite key
D.	Have all non key fields depend on the whole primary key
Answer» A. Eliminate all hidden dependencies

discuss

3.	Which-one ofthe following statements about normal forms is FALSE?
A.	BCNF is stricter than 3 NF
B.	Lossless, dependency -preserving decomposition into 3 NF is always possible
C.	Loss less, dependency – preserving decomposition into BCNF is always possible
D.	Any relation with two attributes is BCNF
Answer» C. Loss less, dependency – preserving decomposition into BCNF is always possible

discuss

4.	Functional Dependencies are the types of constraints that are based on______
A.	Key
B.	Key revisited
C.	Superset key
D.	None of the mentioned
Answer» A. Key

discuss

5.	Which is a bottom-up approach to database design that design by examining the relationship between attributes:
A.	Functional dependency
B.	Database modeling
C.	Normalization
D.	Decomposition
Answer» C. Normalization

discuss

6.	Which forms simplifies and ensures that there are minimal data aggregates and repetitive groups:
A.	1NF
B.	2NF
C.	3NF
D.	All of the mentioned
Answer» C. 3NF

discuss

7.	Which forms has a relation that possesses data about an individual entity:
A.	2NF
B.	3NF
C.	4NF
D.	5NF
Answer» C. 4NF

discuss

8.	Which forms are based on the concept of functional dependency:
A.	1NF
B.	2NF
C.	3NF
D.	4NF
Answer» C. 3NF

discuss

9.	Empdt1(empcode, name, street, city, state, pincode). For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in
A.	1 NF only
B.	2 NF and hence also in 1 NF
C.	3NF and hence also in 2NF and 1NF
D.	BCNF and hence also in 3NF, 2NF and 1NF
Answer» B. 2 NF and hence also in 1 NF

discuss

10.	We can use the following three rules to find logically implied functional dependencies. This collection of rules is called
A.	Axioms
B.	Armstrong’s axioms
C.	Armstrong
D.	Closure
Answer» B. Armstrong’s axioms

discuss

11.	Which of the following is not Armstrong’s Axiom?
A.	Reflexivity rule
B.	Transitivity rule
C.	Pseudotransitivity rule
D.	Augmentation rule
Answer» C. Pseudotransitivity rule

discuss

12.	The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into employee1 (ID, name) employee2 (name, street, city, salary) This type of decomposition is called
A.	Lossless decomposition
B.	Lossless-join decomposition
C.	All of the mentioned
D.	None of the mentioned
Answer» D. None of the mentioned

discuss

13.	Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under
A.	Lossy-join decomposition
B.	Lossy decomposition
C.	Lossless-join decomposition
D.	Both Lossy and Lossy-join decomposition
Answer» D. Both Lossy and Lossy-join decomposition

discuss

14.	There are two functional dependencies with the same set of attributes on the left side of the arrow: A->BC A->B This can be combined as
A.	A->BC
B.	A->B
C.	B->C
D.	None of the mentioned
Answer» A. A->BC

discuss

15.	Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and D -> AB The number of superkeys of R is:
A.	2
B.	7
C.	10
D.	12
Answer» C. 10

discuss

16.	Which, if any, of the two queries above will correctly (in SQL2) get the desired set of employee ID’s?
A.	Both I and II
B.	I only
C.	II only
D.	Neither I nor I
Answer» A. Both I and II

discuss

17.	Suppose now that R(A,B:) and S(A,B:) are two relations with r and s tuples, respectively (again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the result of the SQL query: R intersect S; Then which of the following is the most restrictive, correct condition on the value of m?
A.	m = min(r,s)
B.	0 <= m <= r + s
C.	min(r,s) <= m <= max(r,s)
D.	0 <= m <= min(r,s)
Answer» D. 0 <= m <= min(r,s)

discuss

18.	Which of the following is not a key?
A.	A
B.	E
C.	B, C
D.	D
Answer» C. B, C

discuss

19.	If a relation is in BCNF, then it is also in
A.	1 NF
B.	2 NF
C.	3 NF
D.	All of the above
Answer» D. All of the above

discuss

20.	What action does ⋈ operator perform in relational algebra
A.	Output specified attributes from all rows of the input relation and remove duplicate tuples from the output
B.	Outputs pairs of rows from the two input relations that have the same value on all attributes that have the same name
C.	Output all pairs of rows from the two input relations (regardless of whether or not they have the same values on common attributes)
D.	Return rows of the input relation that satisfy the predicate
Answer» A. Output specified attributes from all rows of the input relation and remove duplicate tuples from the output

discuss

21.	Statement 1: A tuple is a row in a relation Statement 2: Existence of multiple foreign keys in a same relation is possible
A.	Both the statements are true
B.	Statement 1 is correct but Statement 2 is false
C.	Statement 1 is false but Statement 2 is correct
D.	Both the statements are false
Answer» A. Both the statements are true

discuss

22.	The____condition allows a general predicate over the relations being joined.
A.	On
B.	Using
C.	Set
D.	Where
Answer» A. On

discuss

23.	Which of the join operations do not preserve non matched tuples?
A.	Left outer join
B.	Right outer join
C.	Inner join
D.	Natural join
Answer» B. Right outer join

discuss

24.	The normal form which satisfies multivalued dependencies and which is in BCNF is
A.	4 NF
B.	3 NF
C.	2 NF
D.	All of the mentioned
Answer» A. 4 NF

discuss

25.	Which of the following is a tuple-generating dependencies?
A.	Functional dependency
B.	Equality-generating dependencies
C.	Multivalued dependencies
D.	Non-functional dependency
Answer» B. Equality-generating dependencies

discuss

26.	The main task carried out in the __________ is to remove repeating attributes to separate tables.
A.	First Normal Form
B.	Second Normal Form
C.	Third Normal Form
D.	Fourth Normal Form
Answer» A. First Normal Form

discuss

27.	Which forms has a relation that possesses data about an individual entity?
A.	2NF
B.	3NF
C.	4NF
D.	5NF
Answer» B. 3NF

discuss

28.	Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set?
A.	A many-to-many relationship set
B.	A multivalued attribute of an entity set
C.	A one-to-many relationship set
D.	None of the mentioned
Answer» A. A many-to-many relationship set

discuss

29.	Fifth Normal form is concerned with
A.	Functional dependency
B.	Multivalued dependency
C.	Join dependency
D.	Domain-key
Answer» B. Multivalued dependency

discuss

30.	n which of the following, a separate schema is created consisting of that attribute and the primary key of the entity set.
A.	A many-to-many relationship set
B.	A multivalued attribute of an entity set
C.	A one-to-many relationship set
D.	None of the mentioned
Answer» B. A multivalued attribute of an entity set

discuss

31.	In 2NF
A.	No functional dependencies (FDs) exist
B.	No multivalued dependencies (MVDs) exist
C.	No partial FDs exist
D.	No partial MVDs exist
Answer» B. No multivalued dependencies (MVDs) exist

discuss

30+ Relational Database Design Solved MCQs

In the __________ normal form, a composite attribute is converted to individual attributes.

Tables in second normal form (2NF):

Which-one ofthe following statements about normal forms is FALSE?

Functional Dependencies are the types of constraints that are based on______

Which is a bottom-up approach to database design that design by examining the relationship between attributes:

Which forms simplifies and ensures that there are minimal data aggregates and repetitive groups:

Which forms has a relation that possesses data about an individual entity:

Which forms are based on the concept of functional dependency:

Empdt1(empcode, name, street, city, state, pincode). For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in

We can use the following three rules to find logically implied functional dependencies. This collection of rules is called

Which of the following is not Armstrong’s Axiom?

The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into employee1 (ID, name) employee2 (name, street, city, salary) This type of decomposition is called

Inst_dept (ID, name, salary, dept name, building, budget) is decomposed into instructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under

There are two functional dependencies with the same set of attributes on the left side of the arrow: A->BC A->B This can be combined as

Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and D -> AB The number of superkeys of R is:

Which, if any, of the two queries above will correctly (in SQL2) get the desired set of employee ID’s?

Which of the following is not a key?

If a relation is in BCNF, then it is also in

What action does ⋈ operator perform in relational algebra

Statement 1: A tuple is a row in a relation Statement 2: Existence of multiple foreign keys in a same relation is possible

The____condition allows a general predicate over the relations being joined.

Which of the join operations do not preserve non matched tuples?

The normal form which satisfies multivalued dependencies and which is in BCNF is

Which of the following is a tuple-generating dependencies?

The main task carried out in the __________ is to remove repeating attributes to separate tables.

Which forms has a relation that possesses data about an individual entity?

Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set?

Fifth Normal form is concerned with

n which of the following, a separate schema is created consisting of that attribute and the primary key of the entity set.

In 2NF

The relation employee(ID,name,street,Credit,street,city,salary) is decomposed into
employee1 (ID, name)
employee2 (name, street, city, salary) This type of decomposition is called

There are two functional dependencies with the same set of attributes on the left side of the arrow:
A->BC A->B
This can be combined as

Consider a relation R(A,B,C,D,E) with the following functional dependencies:
ABC -> DE and
D -> AB The number of superkeys of R is: