Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Database Normal Forms and Decomposition Worksheet

Total questions: 20

Worksheet time: 10mins

Name
Class
Date
1.

Given R(A, B, C, D) with FDs: A → B, B → C, C → D. Which is the highest normal form of R?

a)

1NF

b)

2NF

c)

3NF

d)

BCNF

2.

If a decomposition of R into R1 and R2 is lossless, which condition must be true?

a)

R1 ∩ R2 → R1

b)

R1 ∩ R2 → R2

c)

(R1 ∩ R2) → R1 or R2

d)

Both R1 and R2 must be in BCNF

3.

Consider R(A, B, C) with MVD A →→ B. Which decomposition is correct for 4NF?

a)

R1(A, B), R2(A, C)

b)

R1(B, C), R2(A, C)

c)

R1(A, B, C)

d)

R1(A), R2(B, C)

4.

Which situation indicates that the relation is not in BCNF even though it is in 3NF?

a)

A non-key attribute determines another non-key attribute

b)

A composite key has a partial dependency

c)

A non-prime attribute determines a key attribute

d)

A determinant is not a candidate key

5.

You decompose a table into 3NF, but some FDs are not preserved. What is the consequence?

a)

Join becomes lossy

b)

Query optimization becomes harder

c)

You cannot enforce all constraints without joins

d)

MVDs will vanish

6.

Relation R(A, B, C, D) has FD: AB → C and C → D. What is the candidate key?

a)

AB

b)

ABC

c)

ABD

d)

A

7.

Which of the following indicates the need for 4NF?

a)

Partial dependency

b)

Transitive dependency

c)

Attribute depends on many independent multi-valued facts

d)

Candidate keys are not unique

8.

In a schema R(A, B, C, D), if A → B and C → D, which decomposition ensures BCNF without losing FDs?

a)

R1(A, B), R2(C, D)

b)

R1(A, C), R2(B, D)

c)

R1(A, B, C), R2(C, D)

d)

R1(A, C, D), R2(B)

9.

Which design choice is preferable when FD preservation is more important than BCNF compliance?

a)

Use 4NF decomposition

b)

Use 3NF decomposition

c)

Use 5NF decomposition

d)

Use unnormalized design

10.

If a decomposition is dependency-preserving but lossy, what does it imply?

a)

Some FDs are lost

b)

Some original tuples cannot be recovered by join

c)

Extra tuples appear after join

d)

The decomposed tables are not in 1NF

11.

Which of the following is a multi-valued dependency?

a)

A →→ B

b)

A → B

c)

A ↔ B

d)

A ⊆ B

12.

A decomposition is lossless if and only if:

a)

No redundancy is removed

b)

The join of decomposed relations gives original relation

c)

All FDs remain preserved

d)

Data duplication occurs

13.

Which condition ensures a lossless-join decomposition for R(A,B,C)?

a)

A → B

b)

A → C or C → A

c)

AB → C

d)

C → B only

14.

Which of the following indicates redundancy in a database?

a)

Functional dependency

b)

Partial dependency

c)

Atomic values

d)

Primary key

15.

Normalization is a process used to:

a)

Increase redundancy

b)

Reduce anomalies

c)

Increase file size

d)

Reduce access speed

16.

Which of the following anomalies can normalization reduce?

a)

Insertion, deletion, update

b)

Deadlock

c)

Indexing

d)

Encryption

17.

In alternative design approaches, ER modeling is used for:

a)

Network administration

b)

Conceptual schema design

18.

If a relation has attributes that depend on non-key attributes, it violates:

a)

1NF

b)

2NF

c)

3NF

d)

BCNF

19.

A dependency A → B holds if:

a)

Two tuples with same A have same B

b)

Two tuples with same B have same A

c)

A and B are always equal

d)

A is a key

20.

Normalization using MVDs helps remove:

a)

Full dependencies

b)

Partial dependencies

c)

Transitive dependencies

d)

Repeating groups in multiple rows