KEMBAR78
Assignment 2 - Normalization (GRADED | PDF | Data Model | Data
Scribd
Upload
102 views2 pages

Assignment 2 - Normalization (GRADED

This document outlines an assignment for an advanced database management systems course. It includes 9 questions on topics related to normalization of relational databases, including finding candidate keys, canonical covers, determining if decompositions preserve dependencies and are lossless, and decomposing relations to higher normal forms based on given functional dependencies. Students are asked to decompose relations to 3NF or BCNF based on the functional dependencies.

Uploaded by

Divyansh Singh
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
102 views2 pages

Assignment 2 - Normalization (GRADED

This document outlines an assignment for an advanced database management systems course. It includes 9 questions on topics related to normalization of relational databases, including finding candidate keys, canonical covers, determining if decompositions preserve dependencies and are lossless, and decomposing relations to higher normal forms based on given functional dependencies. Students are asked to decompose relations to 3NF or BCNF based on the functional dependencies.

Uploaded by

Divyansh Singh
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 Code: CSEG2017

Course: Advance Database Management Systems


Program: B.Tech, (CSE) SPZ AIML
Max Marks: 10
Due Date: 14/03/2023
Assignment 2 – Normalization (GRADED)

----------------------------------------------------------------------------------------------------------------

1. Find the candidate key for the following relational schema:


i. R (A, B, C, D, E)
F = { A → B, B → C, C → D}

ii. R ( A, B, C, D, E)
F = { AD → C, B → A, C → E, E → BD}

iii. R ( A, B, C, D, E, F, G, H, I, J)
F = { ABD → E, AB → G, B → F, C → J, CJ → I, G → H}

iv. R ( A, B, C, D, E, H)
F = { A → B, BC → D, E → C, D → A}
(2 mark – 0.5 each)

2. Find the canonical/minimal cover for the following set of FDs

i. F = { A → BC, CD → E, E → C, D → AEH, ABH → BD, DH → BC}

ii. F = { AB → C, C → A, BC → D, ACD → B, BE → C, EC → FA, CF → BD, D → E}

(1 mark – 0.5 each)

3. Which of the following set is equivalent to F = { A → C, AC → D, E → AD, E → H }


i. G = { A → CH, E → ADH}
ii. G = { A → AH, E → CH}
(1 mark – 0.5 each)

4. Find whether the following decompositions are dependency preserved or not?


R (A, B, C, D)
F = { A →B, B → C, C → D, D → B}
D = { AB, BC, CD }
(0.5 mark)

5. Find whether the following decompositions satisfy lossless join decomposition for R (A, B, C, D,
E, G) F = { AB → C, BC → A, AC → B, B → D, E → G, AD → E} or not?

i. D = { ABC, BD, ADEG}


ii. D = { ABC, ADE, ADEG}
(0.5 mark – 0.25 each)
6. Consider the relational schema R (A, B, C, D, E, F, G, H, I, J) with FD set F = { AB → C, A →
DE, B → F, F → GH, D → IJ}. Check whether the following decompositions satisfy dependency
preservation and lossless join.
i. D = { ABC, ADE, BF, FGH, DIJ}
ii. D = { ABCD, DE, BF, FGH, DIJ}
(1 mark – 0.5 each)

7. Consider the relational schema R ( A, B, C, D, E, G, H) with FD set F = { AB → C, AC → B, AD


→ E, B → D, BC → A, E → G}. Check whether the following decompositions satisfy
dependency preservation and lossless join. (1 mark – 0.5 each)
i. D = { AB, BC, ABDE, EG}
ii. D = { ABC, ACDE, ADG}

8. Given the relational schema R (A, B, C, D,E) with FD set F = { AB → C, BC → A, AC → B}.


Decompose the relation to highest possible normal form. (1 mark)

9. Given the relational schema R (A, B, C, D) with FD set F = { AB → CD, D → A}. Decompose
the relation to highest possible normal form. (2 mark)

You might also like