A relation Empdtl is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms, Empdtl is a relation in:

3 NF and hence also in 2 NF and 1 NF

BCNF and hence also in 3 NF, 2NF and 1NF

Consider the schema R (A, B, C, D) and the functional dependencies A → B and C → D. If the decomposition is made as R1 (A, B) and R2 (C, D), then which of the following is TRUE ?

Preserves dependency and performs lossless join

Preserves dependency but cannot perform lossless join

Preserves dependency and performs lossless join

Does not preserve dependency and cannot perform lossless join

Does not preserve dependency but performs lossless join

Consider a schema R(A, B, C, D) and following functional dependencies.A → BB → CC → DD → BThen decomposition of R into R1(A, B), R2(B, C) and R3(B, D) is _______

Lossless join but not dependency preserving.

Dependency preserving and lossless join.

Lossless join but not dependency preserving.

Dependency preserving but not lossless join.

Not dependency preserving and not lossless join.

For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic values, only the following functional dependencies and those that can be inferred from them holda → cb → dThe relation is in

Second normal form but not in third normal form

First normal form but not in second normal form

Second normal form but not in third normal form

Consider the relation R(P, Q, S, T, X, Y, Z, W) with the following functional dependencies.PQ → X; P → YX; Q → Y; Y → ZWConsider the decomposition of the relation R into the constituent relations according to the following two decomposition schemes.D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)]D2 : R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)]Which one of the following options is correct?

D1 is a lossy decomposition, but D2 is a lossless decomposition.

Both D1 and D2 are lossless decompositions.

Both D1 and D2 are lossy decompositions.

D1 is a lossless decomposition, but D2 is a lossy decomposition.

Consider a relation R(A, B, C), which of the following statements is not true according to inference rules for functional dependencies?

If A → B and A → C, then A → BC

If A → B and B → C, then A → C

If AB → C, then A → B and B → C

If A → B and A → C, then A → BC

Consider a relational table R that is in 3NF, but not in BCNF, Which one of the following statements is TRUE?

R has a nontrivial functional dependency X → A, where X is not a superkey and A is a non-prime attribute and X is not a proper subset of any key.

R has a nontrivial functional dependency X → A, where X is not a superkey and A is a prime attribute.

R has a nontrivial functional dependency X → A, where X is not a superkey and A is a non-prime attribute and X is not a proper subset of any key.

R has a nontrivial functional dependency X → A, where X is not a superkey and A is a non-prime attribute and X is a proper subset of some key.

A cell in R holds a set instead of an atomic value.

28 + Mcqs in Integrity Constraints And Normal Form in Database Page 1 McqOptions

1.	______ normal form is based on the concept of transitive dependancy.
A.	1 NF
B.	2 NF
C.	All options are wrong
D.	3 NF
Answer» E.

Discussion

2.	Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist.CH → GA → BCB → CFHE → AF → EGThe relation R is ______.
A.	in 1NF but not in 2NF
B.	in 2NF but not in 3NF
C.	in 3NF but not in BCNF
D.	in BCNF
Answer» B. in 2NF but not in 3NF

Discussion

3.	A database of research articles in a journal uses the following schema.(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema.(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE(VOLUME, NUMBER) → YEAR(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICEThe database is redesigned to use the following schemas.(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)(VOLUME, NUMBER, YEAR)Which is the weakest normal form that the new database satisfies, but the old one does not?
A.	1NF
B.	2NF
C.	3NF
D.	BCNF
Answer» C. 3NF

Discussion

4.	Every time the attribute A appears, it is matched with the same value of attribute B but not the same value of attribute C. Which of the following is true ?
A.	A -> (B, C)
B.	A -> B, A ->> C
C.	A -> B, C ->> A
D.	A ->> B, B -> C
Answer» C. A -> B, C ->> A

Discussion

5.	Consider the following table: Faculty (facName, dept, office, rank, dateHired)facNameDeptOfficeRankdateHiredRaviArtA101Professor1975MuraliMathM201Assistant2000NarayananArtA101Associate1992LakshmiMathM201Professor1982MohanCSCC101Professor1980SreeniMathM203Associate1990TanujaCSCC101Instructor2001GaneshCSCC105Associate1995(Assume that no faculty member within a single department has same name. Each faculty member has only one office identified in office). 3NF refers to third normal form and BNCF refers to Boyce Codd normal form.Then Faculty is
A.	Not in 3NF, in BCNF
B.	In 3NF, not in BCNF
C.	In 3NF, in BCNF
D.	Not in 3NF, not in BCNF
Answer» C. In 3NF, in BCNF

Discussion

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

Discussion

7.	Consider the schema R (A, B, C, D) and the functional dependencies A → B and C → D. If the decomposition is made as R1 (A, B) and R2 (C, D), then which of the following is TRUE ?
A.	Preserves dependency but cannot perform lossless join
B.	Preserves dependency and performs lossless join
C.	Does not preserve dependency and cannot perform lossless join
D.	Does not preserve dependency but performs lossless join
Answer» B. Preserves dependency and performs lossless join

Discussion

8.	Consider a schema R(A, B, C, D) and following functional dependencies.A → BB → CC → DD → BThen decomposition of R into R1(A, B), R2(B, C) and R3(B, D) is _______
A.	Dependency preserving and lossless join.
B.	Lossless join but not dependency preserving.
C.	Dependency preserving but not lossless join.
D.	Not dependency preserving and not lossless join.
Answer» B. Lossless join but not dependency preserving.

Discussion

9.	A relation in which every non-key attribute is fully functionally dependent on the primary key and which has no transitive dependencies is said to be in:
A.	BCNF
B.	2NF
C.	3NF
D.	4NF
Answer» D. 4NF

Discussion

10.	If every non-key attribute functionally dependant on the primary key, then the relation will be in
A.	First normal form
B.	Second normal form
C.	Third normal form
D.	Fourth normal form
Answer» C. Third normal form

Discussion

11.	Let the set of functional dependencies F = {QR → S, R → P, S → Q} hold on a relation schema X = (PQRS). X is not in BCNF. Suppose X is decomposed into two schemas Y and Z, where Y = (PR) and Z = (QRS).Consider the two statements given below.I. Both Y and Z are in BCNFII. Decomposition of X into Y and Z is dependency preserving and losslessWhich of the above statements is/are correct?
A.	Both I and II
B.	I only
C.	II only
D.	Neither I nor II
Answer» D. Neither I nor II

Discussion

12.	If every non-key attribute is functionally dependent on the primary key, then the relation is in _______.
A.	First normal form
B.	Second normal form
C.	Third normal form
D.	Fourth normal form
Answer» C. Third normal form

Discussion

13.	For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic values, only the following functional dependencies and those that can be inferred from them holda → cb → dThe relation is in
A.	First normal form but not in second normal form
B.	Second normal form but not in third normal form
C.	Third normal form
D.	None of the above
Answer» B. Second normal form but not in third normal form

Discussion

14.	Consider the relation R(P, Q, S, T, X, Y, Z, W) with the following functional dependencies.PQ → X; P → YX; Q → Y; Y → ZWConsider the decomposition of the relation R into the constituent relations according to the following two decomposition schemes.D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)]D2 : R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)]Which one of the following options is correct?
A.	D1 is a lossy decomposition, but D2 is a lossless decomposition.
B.	Both D1 and D2 are lossless decompositions.
C.	Both D1 and D2 are lossy decompositions.
D.	D1 is a lossless decomposition, but D2 is a lossy decomposition.
Answer» E.

Discussion

15.	Consider a relation R(A, B, C), which of the following statements is not true according to inference rules for functional dependencies?
A.	If A → B and B → C, then A → C
B.	If AB → C, then A → B and B → C
C.	If A → B and A → C, then A → BC
D.	If A → B, then AC → BC
Answer» C. If A → B and A → C, then A → BC

Discussion

16.	_____ is based on the concept of full functional dependency.
A.	1NF
B.	3NF
C.	BCNF
D.	2NF
Answer» E.

Discussion

17.	In RDBMS, different classes of relations are created using __________ technique to prevent modification anomalies.
A.	Functional dependencies.
B.	Data integrity
C.	Referential integrity
D.	Normal Form
Answer» E.

Discussion

18.	Consider the following four relational schemas. For each schema, all non-trivial functional dependencies are listed. The underlined attributes are the respective primary keys.Schema I:Field ‘courses’ is a set-valued attribute containing the set of courses a student hasregistered for.Non-trivial functional dependency:rollno → coursesSchema II:Non-trivial functional dependencies:rollno, courseid → emailemail → rollnoSchema III:Non-trivial functional dependencies:rollno, courseid → marks, grademarks → gradeSchema IV:Non-trivial functional dependencies:rollno, courseid → creditcourseid → creditWhich one of the relational schemas above is in 3NF but not in BCNF?
A.	Schema I
B.	Schema II
C.	Schema III
D.	Schema IV
Answer» C. Schema III

Discussion

19.	Given the following two statements:S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.S2: AB → C, D → E, E → C is a minimal cover for the set of functional dependencies AB → C, D → E, AB → E, E → C.Which one of the following is CORRECT?
A.	S1 is TRUE and S2 is FALSE
B.	Both S1 and S2 are TRUE.
C.	S1 is FALSE and S2 is TRUE
D.	Both S1 and S2 are FALSE
Answer» B. Both S1 and S2 are TRUE.

Discussion

20.	Consider a relational table R that is in 3NF, but not in BCNF, Which one of the following statements is TRUE?
A.	R has a nontrivial functional dependency X → A, where X is not a superkey and A is a prime attribute.
B.	R has a nontrivial functional dependency X → A, where X is not a superkey and A is a non-prime attribute and X is not a proper subset of any key.
C.	R has a nontrivial functional dependency X → A, where X is not a superkey and A is a non-prime attribute and X is a proper subset of some key.
D.	A cell in R holds a set instead of an atomic value.
Answer» B. R has a nontrivial functional dependency X → A, where X is not a superkey and A is a non-prime attribute and X is not a proper subset of any key.

Discussion

21.	Consider a relational schema S = (U, V, W, X, Y, Z) on which the following functional dependencies hold:{U → V, VW → X, Y → W, X → U}Which are the candidate keys among following options?
A.	UY, VY
B.	UY, VY, XY
C.	UYZ, VYZ, VWZ
D.	UYZ, VYZ, XYZ
Answer» E.

Discussion

22.	A relation in which every non-key attribute is fully functionally dependent on the primary key and which has no transitive dependencies, is said to be in _____
A.	BCNF
B.	1NF
C.	2NF
D.	3 NF
Answer» E.

Discussion

23.	A relation is in _______ form if every field contains only atomic values, that is, not lists or sets.
A.	Second normal
B.	Third normal
C.	Fourth normal
D.	First normal
Answer» E.

Discussion

24.	Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies F = { {P, R} → {S, T}, {P, S, U} → {Q, R} }Which of the following is the trivial functional dependency in F+, where F+ is closure of F?
A.	{P, R} → {S, T}
B.	{P, R} → {R, T}
C.	{P, S} → {S}
D.	{P, S, U} → {Q}
Answer» D. {P, S, U} → {Q}

Discussion

25.	Given a relation schema R(ABCDEFGH) in first normal form. For the set of dependenciesF={ A → B, A → C, CG → H, B → H, G → F}, which dependency is logically implied?
A.	AC → H
B.	C → H
C.	G → H
D.	A → H
Answer» E.

Discussion

26.	In a relational schema R whenever a non-trivial functional dependency X → A holds in relation R, X is a super-key of relation R. Relation R is in _________The most suitable choice to fill in the blank is:
A.	BCNF
B.	2NF
C.	3NF
D.	4NF
Answer» B. 2NF

Discussion

27.	Given an instance of the relation R(ABCD).ABCDa1b1c1d1a1b2c2d2a2b2c2d3a3b3c4d3 Which of the following functional dependencies hold?
A.	{AB} → D and D → A
B.	{AB → C and B → D
C.	{AB} → C and B → C
D.	{AB} → D and A → D
Answer» D. {AB} → D and A → D

Discussion

28.	Consider the following TableThe table is in which normal form?
A.	First Normal Form
B.	Second Normal Form
C.	Third Normal Form but not BCNF
D.	Third Normal Form and BCNF
Answer» D. Third Normal Form and BCNF

Discussion

Explore topic-wise MCQs in Database.

______ normal form is based on the concept of transitive dependancy.

Consider a relation R (A, B, C, D, E, F, G, H), where each attribute is atomic, and following functional dependencies exist.CH → GA → BCB → CFHE → AF → EGThe relation R is ______.

Every time the attribute A appears, it is matched with the same value of attribute B but not the same value of attribute C. Which of the following is true ?

A relation Empdtl is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms, Empdtl is a relation in:

Consider the schema R (A, B, C, D) and the functional dependencies A → B and C → D. If the decomposition is made as R1 (A, B) and R2 (C, D), then which of the following is TRUE ?

Consider a schema R(A, B, C, D) and following functional dependencies.A → BB → CC → DD → BThen decomposition of R into R1(A, B), R2(B, C) and R3(B, D) is _______

A relation in which every non-key attribute is fully functionally dependent on the primary key and which has no transitive dependencies is said to be in:

If every non-key attribute functionally dependant on the primary key, then the relation will be in

If every non-key attribute is functionally dependent on the primary key, then the relation is in _______.

For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic values, only the following functional dependencies and those that can be inferred from them holda → cb → dThe relation is in

Consider a relation R(A, B, C), which of the following statements is not true according to inference rules for functional dependencies?

_____ is based on the concept of full functional dependency.

In RDBMS, different classes of relations are created using __________ technique to prevent modification anomalies.

Given the following two statements:S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.S2: AB → C, D → E, E → C is a minimal cover for the set of functional dependencies AB → C, D → E, AB → E, E → C.Which one of the following is CORRECT?

Consider a relational table R that is in 3NF, but not in BCNF, Which one of the following statements is TRUE?

Consider a relational schema S = (U, V, W, X, Y, Z) on which the following functional dependencies hold:{U → V, VW → X, Y → W, X → U}Which are the candidate keys among following options?

A relation in which every non-key attribute is fully functionally dependent on the primary key and which has no transitive dependencies, is said to be in _____

A relation is in _______ form if every field contains only atomic values, that is, not lists or sets.

Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies F = { {P, R} → {S, T}, {P, S, U} → {Q, R} }Which of the following is the trivial functional dependency in F+, where F+ is closure of F?

Given a relation schema R(ABCDEFGH) in first normal form. For the set of dependenciesF={ A → B, A → C, CG → H, B → H, G → F}, which dependency is logically implied?

In a relational schema R whenever a non-trivial functional dependency X → A holds in relation R, X is a super-key of relation R. Relation R is in _________The most suitable choice to fill in the blank is:

Given an instance of the relation R(ABCD).ABCDa1b1c1d1a1b2c2d2a2b2c2d3a3b3c4d3 Which of the following functional dependencies hold?

Consider the following TableThe table is in which normal form?