Free Printable Normalisation

1.

1. 1 NF was defined to disallow

a)

Multivalued attribute

b)

composite attribute

c)

multivalued and composite attribute

d)

a. . none of these

2.

1. Let R(ABCDE) be a relational schema and F={AB->CD, ABC->E, C->A} be the set of functional dependencies. The number of candidate keys is

a)

1

b)

2

c)

3

d)

4

3.

Consider relation schema R with set functional dependencies(F) as: R(ABCD)

F={AB->CD,C->A}

The given relation is in

a)

1NF

b)

2 NF

c)

3 NF

d)

BCNF

4.

If every attribute is a candidate key then the table is in

a)

1NF

b)

2 NF

c)

3 NF

d)

BCNF

5.

Consider R(ABCD) and f={A->B, B->C, C->D} then the decomposition R1(AB), R2(BC), R3(CD) is

a)

Lossy

b)

Lossless

c)

can't say

d)

none of these

6.

Consider R(ABCD) and F={AB->CD, C->A, A->C} The given relation is in

a)

1NF

b)

2 NF

c)

3 NF

d)

BCNF

7.

Consider R(ABCD) and F={AB->CD, C->A, A->C}

If the above relation is decomposed into R1(CBD), R2(CA) then the decomposition is

a)

dependency preserved

b)

not dependency preserved

c)

can't say

d)

none of these

8.

1. Consider A B C D

a1 b1 c1 d1

a1 b2 c1 d2

a2 b2 c2 d2

a2 b3 c2 d3

a3 b3 c2 d4

Which of the following dependencies hold in R

a)

A->B

b)

A->C

c)

C->B

d)

none of these

9.

Consider R(JKL) and F= { JK->L , L->K}. Find the candidate key

a)

JK

b)

JL

c)

JK & JL

d)

none of these

10.

Determine T or F of the following statements:

a. A relation may have a number of candidate keys, but has only one primary key.

b. Every table with 2 single valued attributes is in 1NF, 2 NF, 3NF, BCNF.

c. A table is in the second normal form(2NF) if every attribute is determined by

every candidate key, but is not determined by any pure subset of a candidate key.

a)

T- T –T

b)

T- T –F

c)

F- T –T

d)

T- F-F

11.

A ..................... specifies the actions needed to remove the drawbacks in the current design of database.

a)

1NF

b)

2 NF

c)

3 NF

d)

Normal form

12.

A relation is in ........................... if an attribute of a composite key is dependent on an attribute of other composite key.

a)

2NF

b)

3 NF

c)

BCNF

d)

1NF

13.

Fifth Normal form is concerned with

a)

Functional dependency

b)

Multivalued dependency

c)

Join dependency

d)

Domain key

14.

A table is in the ....................... if only candidate keys are the determinants.

a)

3NF

b)

5NF

c)

4 NF

d)

BCNF

15.

In 2NF

a)

No functional dependencies exist.

b)

No multivalued dependencies exist.

c)

No partial functional dependencies exist

d)

No partial multivalued dependencies exist.

16.

The normal form that is not necessarily dependency preserving is

a)

2NF

b)

3NF

c)

BCNF

d)

4NF

17.

The ................. is related to the concept of multi-valued dependency.

a)

4 NF

b)

5 NF

c)

boyce codd normal form

d)

third normal form

18.

Which normal form is considered adequate for normal relational database design?

a)

2NF

b)

5 NF

c)

4 NF

d)

3 NF

19.

Dependency preservation is not guaranteed in

a)

BCNF

b)

3 NF

c)

1 NF

d)

2NF

20.

A relation is ................... if every field contains only atomic values that is, no lists or sets.

a)

1 NF

b)

2 NF

c)

3 NF

d)

BCNF

Normalisation_DBMS

Total questions: 20

Worksheet time: 10mins

Similar Resources on Wayground