Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
48 views

Assignment Normalization

Uploaded by

ruchika.singh3001
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
48 views

Assignment Normalization

Uploaded by

ruchika.singh3001
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/ 2

Course Name: DBMS Course Code: E2UC302B

Assignment 3(b)
Problem based on Normalization: 1NF, 2NF, 3NF, and BCNF.

1. A relation R(A, B, C, D, E, F, G, H) and set of functional dependencies are CH → G, A → BC,B →


CFH, E → A,F → EG How many possible super keys are present ?

2. Relation R (A, B, C, D) with the following functional dependencies:


A→ B
B→C
A→D
Determine if the relation is in 1NF and 2NF. If not, decompose it to achieve 2NF.
3. Relation R (A, B, C, D) with the following functional dependencies:
A→ B
B→C
A, C → D
Determine if the relation is in 2NF and 3NF. If not, decompose it to achieve 3NF.
Solution:
4. Relation R(A, B, C, D, E) with the following functional dependencies:
A→ B
B→C
C→D
D→E
5. Determine if the relation is in 1NF, 2NF, and 3NF. If not, decompose it to achieve 3NF.
Relation R(A, B, C, D) with the following functional dependencies:
A→ B
B→C
A, D → C
6. Determine if the relation is in 2NF. If not, decompose it to achieve 2NF.
Relation R(A, B, C, D, E) with the following functional dependencies:
A→ B
B→C
A→D
D→E
7. Determine if the relation is in 3NF. If not, decompose it to achieve 3NF.
Relation R (A, B, C, D, E) with the following functional dependencies:
A→ B
B→C
C→D
A→E
8. Determine if the relation is in 2NF and 3NF. If not, decompose it to achieve 3NF.
9. Relation R (A, B, C, D, E) with the following functional dependencies:
A→ B
B→C
C→D
A, E → D
Determine if the relation is in 1NF, 2NF, and 3NF. If not, decompose it to achieve 3NF.

10. Given the relation R (A, B, C) with functional dependencies (FDs):


A→ B
B→C
Is the relation R in BCNF?

11. Consider the relation R (A, B, C, D) with the following functional dependencies:

A→B

B→C

C → D Decompose R into BCNF.

12. Given the relation R(A, B, C, D) with the following FDs:


A→ B
B→C
C→D
A→D
Determine if R is in BCNF and justify your answer.

13. Consider the relation R(a,b,c,d) with Set F={a→c,b→d} (i) Decompose this relation in 2 NF

14. Given the following set of FDs on schema R (V,W,X,Y,Z) {Z→V, W→Y, XY→Z, V→WX}State
whether the following decomposition are loss-less-join decompositions or not. (i) R1=(V,W,X) ,
R2=(V,Y,Z) (ii) R1=(V,W,X), R2=(X,Y,Z)

15. Consider the universal relation R = {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies
F = { {A, B}→{C}, {A}→{D, E}, {B}→{F}, {F}→{G,H}, {D}→{I, J} }. What is the key for R?
Decompose R into 2NF and then 3NF relations

16. What is highest normal form of the Relation R(W,X,Y,Z) with the set F= { WY → XZ, X →Y }
(ii) Consider a relation R(A,B,C,D,E) with set F= { A→CD, C→B,B→AE} What are the prime
attributes of this Relation and Decompose the given relation in 3NF.
17. Normalize the following schema, with given constraints, to 3NF.
books(accessionno, isbn, title, author, publisher) ,users(userid, name, deptid, deptname)
accessionno→isbn
isbn→title
isbn→publisher
isbn→→author
userid→name
userid→deptid
deptid→deptname
18. Suppose we have a database for an investment firm, consisting of the following attributes:
B — Broker, O — Office of a broker, I — Investor, S — Stock, Q — Quantity of stock owned by an
investor, D — dividend paid by a stock. Hence, the overall schema is R = (B, O, I, S, Q, D). Assume
that the following functional dependencies are required to hold on this:

a) List all the candidate keys for R.


b) Give a lossless-join decomposition of R into BCNF.
c) Give a lossless-join decomposition of R into 3NF preserving functional dependencies.
19. A relation R (A, B, C, D) having two FD sets FD1 = {A->B, B->C, A->C} and FD2 = {A->B, B->C, A-
>D}. Check the equivalence relation in both the functional dependencies.
20. Suppose you are given a relation R = (A, B, C, D, E) with the following functional
Dependencies: {CE → D, D → B, C → A}. Is the relationship in BCNF? If not, convert it into BCNF.

You might also like