Scribd
Upload
9 views

Assignment-3 (Unit-3)

Uploaded by

dhyanimishti12
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Assignment-3 (Unit-3)

Uploaded by

dhyanimishti12
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ABES Engineering College, Ghaziabad

Department of Computer Science and Engineering (AI&ML)


B.Tech. SEM V
Session: 2024-25
DATABASE MANAGEMENT SYSTEM

Assignment-3

Q. 1. What is functional dependency? List Armstrong’s axioms in details.


Q. 2. Define normalization in detail? Also define MVD and JD.
Q. 3. What do you mean by closure of an attribute set? Consider a relational schema R = (A, B, C, D)
and following set of FDs: A → BC, AC → D, D → B, AB → D, find the closure set of each
FD.
Q. 4. Consider the universal relational schema R(A B C D E F G H I J) and a set of following
functional dependencies F={AB→ C, A→ DE, B→ F, F→ GH, D→ IJ}. Determine the
candidate keys for R? also Normalize R upto the BCNF normal form.
Q. 5. Consider the Relation R(A B C D E F G H) Find the candidate key for R if FDs are:
(i) AB→ C, A→ DE, B→ F, F→ GH
(ii) AB→ C, BD→ EF, AD→ G, A→H
Q. 6. Considering the relation R (W X Y Z), find the Canonical form or irreducible form for the FDs:
X → W, WZ → XY, Y→ WXZ
Q. 7. Consider the relation R(A C D E H) is having two set of functional dependencies like F={A→C,
AC→ D, E→ AD, E→ H} and G={A→ CD, E→AH}, check both FD sets are equivalent or not.
Q. 8. Consider the relation R = (V W X Y Z). Suppose the following functional dependencies hold:
Z → V, W → Y, XY → Z, V → WX
State whether the following decomposition of schema R is lossless join decomposition.
(i) R1 = (V W X) and R2 = (V Y Z)

(ii) R1 = (V W X) and R2 = (X Y Z)

(iii) R1 = (V W Y) and R2 = (X Z W)

Q. 9. Consider the relational schema R = (A, B, C, D, E, F, G, H) with FDs:


AB → C, BC → D, E → F, G → F, H → A, FG → H,
Is the decomposition of R into R1 (A, B, C, D), R2 (A, B, C, E, F), R3 (A, D, F, G, H) lossless?
Q. 10. Compute the candidate key for relation R (A, B, C, D) having functional dependencies –
A→B, B→C, C→A

You might also like