[go: up one dir, main page]

0% found this document useful (0 votes)
45 views8 pages

Normalization Questions

The document consists of a series of questions related to database normalization, specifically focusing on various normal forms (1NF, 2NF, 3NF, BCNF, and 4NF) and functional dependencies. It includes multiple-choice questions that assess understanding of when certain normal forms apply, how to identify candidate keys, and the implications of functional dependencies on relational schemas. The questions cover a range of scenarios involving relational databases, their schemas, and the properties of normalization.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
45 views8 pages

Normalization Questions

The document consists of a series of questions related to database normalization, specifically focusing on various normal forms (1NF, 2NF, 3NF, BCNF, and 4NF) and functional dependencies. It includes multiple-choice questions that assess understanding of when certain normal forms apply, how to identify candidate keys, and the implications of functional dependencies on relational schemas. The questions cover a range of scenarios involving relational databases, their schemas, and the properties of normalization.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Q1: BCNF is not used for cases where a relation has

1. Two (or more) candidate keys


2. Two candidate keys and composite
3. The candidate key overlap

Th
4. Two mutually exclusive foreign keys

is
PD
F
be
lo
ng
s
to
Q2:

9J
z
id
A
What is the highest normal form of a relation R(A, B, C, D, E) with FD set?

(b
ad
ril
ax
{B → A, A → C, BC → D, AC→ BE}

m
in
ar
s
Options:

im
ha
5@
1. 2NF

gm
ai
2. 3NF

l.c
om
3. BCNF

,9
4. 4NF

06
35
34
91
9)
Q3: Consider the following relational schemas for a library database : Book (Title, Author, Catalog_no,
Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies :
I. Title, Author → Catalog_no
II. Catalog_no → Title, Author, Publisher, Year
III. Publisher, Title, Year → Price Assume (Author, Title) is the key for both schemas. Which one of the
following is true ?

Options:

1. Both Book and Collection are in BCNF.


2. Both Book and Collection are in 3NF.
3. Book is in 2NF and Collection in 3NF.
4. Both Book and Collection are in 2NF.

Q4: Consider the schemaR = {S, T, U, V} and the dependencies


S → T, T → U, U → V and V → S If R = (R1 and R2)
be a decomposition such that R1 ∩ R2 = φ then the decomposition is

Options:
1. not in 2NF
2. in 2NF but not in 3NF
3. in 3NF but not in 2NF
4. in both 2NF and 3NF

Q5: Relation R is decomposed using a set of functional dependencies, F, and relation S Is decomposed
using another set of functional dependencies, G. One decomposition is definitely BCNF, the other is

Th
definitely 3NF, but it is not known which is which.

is
PD
To make a guaranteed identification, which one of the following tests should be used on the

F
be
decompositions? (Assume that the closure of F and G are available).

lo
ng
s
to
Options:

9J
1. Lossless-join

z
id
A
2. BCNF definition

(b
ad
3. 3NF definition

ril
ax
4. Dependency-Preservation

m
in
ar
s
im
ha
5@
gm
Q6: "The relation scheme student performance(name, courseno, rollNo, grade) has the following

ai
l.c
functional dependencies:

om
,9
06
Name, courseNo → grade

35
34
91
rollNo, courseNo → grade

9)
Name → rollNo

rollNo → name

The highest normal form of this relation scheme is

Options:

1. 2NF

2. BCNF

3. 4NF

4. 3NF

Q6: A many-to-one relationship exists between entity sets r1 and r2. How will it be represented using
functional dependencies if Pk(r) denotes the primary key attribute of relation r?

Options:

1. Pk(r1) → Pk(r2)
2. Pk(r2) → Pk(r1)

3. Pk(r2) → Pk(r1) and Pk(r1) → Pk(r2)

4. Pk(r2) → Pk(r1) or Pk(r1) → Pk(r2)

Th
is
PD
F
be
lo
Q7: For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic values,

ng
s
and only the following functional dependencies and those that can be inferred from them hold :

to
9J
z
id
a→c

A
(b
ad
ril
b→d

ax
m
in
ar
The relation is in

s
im
ha
5@
gm
ai
l.c
Options:

om
,9
06
1. First normal form but not in second normal form

35
34
91
2. Second normal form but not in third normal form

9)
3. Third normal form

4. BCNF

Q8: Which of the following relation schemas is definitely in BCNF?

Options:

1. R1(A,B)

2. R4(A,B,C,D,E)

3. R3(A,B,C,D)

4. R2(A,B,C)
Q9: A relation is in ____ form if every field consists only of atomic values, that is, not lists or sets.

Options:

1. First normal

Th
is
PD
2. Third normal

F
be
lo
3. Second normal

ng
s
to
9J
4. Fourth normal

z
id
A
(b
ad
ril
ax
m
Q10: A table has fields Fl, F2, F3, F4, F5 with the following functional dependencies

in
ar
s
im
F1 → F3,

ha
5@
gm
F2→ F4,

ai
l.c
om
(F1.F2) → F5

,9
06
35
In terms of Normalization, this table is in

34
91
9)
Options:

1. 1 NF

2. 2 NF

3. 3 NF

4. None

Q11: An instance of a relational scheme R(A, B, C) has distinct values for attribute A.

Can you conclude that A is a candidate key for R?

Options:

1. Yes

2. No

Q12:

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

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

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

Th
attribute and X is not a proper subset of any key.

is
PD
F
3. R has a nontrivial functional dependency X→A, where X is not a superkey and A is a non-prime

be
lo
ng
attribute and X is a proper subset of some key.

s
to
9J
4. R has a nontrivial functional dependency X→A, where X is not a superkey and A is a prime attribute.

z
id
A
(b
ad
ril
ax
m
in
Q13: Consider the following functional dependencies in a database:

ar
s
im
ha
Data_of_Birth → Age

5@
gm
Age → Eligibility

ai
l.c
om
,9
Name → Roll_number

06
35
34
Roll_number → Name

91
9)
Course_number → Course_name

Course_number → Instructor

(Roll_number, Course_number) → Grade

The relation (Roll_number, Name, Date_of_birth, Age) is:

Options:

1. in second normal form but not in third normal form

2. in third normal form but not in BCNF

3. in BCNF

4. in none of the above

Q14: Consider the following relational schema:

Suppliers(sid:integer, sname:string, city:string, street:string)


Parts(pid:integer, pname:string, color:string)

Catalog(sid:integer, pid:integer, cost:real)

Assume that, in the suppliers relation above, each supplier and each street within a city has a unique

Th
name, and (sname, city) forms a candidate key. No other functional dependencies are implied other

is
PD
than those implied by primary and candidate keys. Which one of the following is TRUE about the above

F
be
schema?

lo
ng
s
to
Options:

9J
z
id
A
1. The schema is in BCNF

(b
ad
ril
ax
2. The schema is in 3NF but not in BCNF

m
in
ar
s
im
3. The schema is in 2NF but not in 3NF

ha
5@
4. The schema is not in 2NF

gm
ai
l.c
om
,9
06
35
Q15: Consider the following relational schemes for a library database:

34
91
9)
Book(Title, Author, Catalog_ no, Publisher, Year, Price)

Collection (Title, Author, Catalog_no)

with in the following functional dependencies:

I. Title Author → Catalog_no

II. Catalog_no → Title Author Publisher Year

III. Publisher Title Year → Price

Assume {Author, Title} is the key for both schemes. Which of the following statements is true?

Options:

1. Both Book and Collection are in BCNF

2. Both Book and Collection are in 3NF only

3. Book is in 2NF and Collection is in 3NF

4. Both Book and Collection are in 2NF only

Q16: Consider the schema R = (S T U V) and the dependencies S → T, T → U, U → V and V → S.


Let R = (R1 and R2) be a decomposition such that R1 ∩ R2 ≠ ∅ .

The decomposition is

Options:

Th
is
PD
1. not in 2NF

F
be
lo
2. in 2NF but not 3NF

ng
s
to
9J
3. in 3NF but not in 2NF

z
id
A
(b
4. in both 2NF and 3NF

ad
ril
ax
m
in
ar
s
im
Q17: For a database relation R(a,b,c,d), where the domains a, b, c, d include only atomic values, only the

ha
5@
following functional dependencies and those that can be inferred from them hold:

gm
ai
l.c
a→c

om
,9
06
b→d

35
34
91
This relation is

9)
Options:

1. in first normal form but not in second normal form

2. in second normal form but not in third normal form

3. in third normal form

4. None of the above

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

Options: 1. S1 is TRUE and S2 is FALSE.

2. Both S1 and S2 are TRUE.


3. S1 is FALSE and S2 is TRUE.

4. Both S1 and S2 are FALSE.

Th
is
PD
Q19: If a relation is an 2NF and 3NF forms, then

F
be
lo
Options:

ng
s
to
9J
1. no non-prime attribute is functionally dependent on other non-prime attributes

z
id
A
(b
2. no non-prime attribute is functionally depend on the prime attributes

ad
ril
ax
m
3. all attributes are functionally independent

in
ar
s
im
4. prime attribute is functionally independent of all non-prime attributes

ha
5@
gm
Q20: Partial dependencies are removed to achieve which normal form?

ai
l.c
om
Options:

,9
06
35
1. First normal form

34
91
9)
2. Second normal form

3. BCNF

4. Third normal form

You might also like