Scribd
Upload
17 views4 pages

Assignment 3 204 DBMS

Uploaded by

palak1228.varshney
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
17 views4 pages

Assignment 3 204 DBMS

Uploaded by

palak1228.varshney
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

ANNEXURE VIII (F)

ABES Engineering College, Ghaziabad

Department of Computer Applications

Session: 2023-24 Semester:2 nd Section: D/C


Subject Code: KCA 204 Subject Name: DBMS

ASSIGNMENT NO. 3

Date of Assignment: 30 may 24 Date of submission: 10june 24

S.No. KL, CO Question Marks

KL3, CO3 Define Normalization with anomalies. Also explain 2


1
normal forms. Why normalization is used?
KL3, CO3 A) Explain the Difference Between 3 NF and BCNF. 2
2
B) Define Prime and non-prime Attributes.
3 KL3, CO3 Explain Functional Dependencies with its types 2
KL3, CO3 Define ARMSTRONG Axioms. 2
4

KL3, CO3 Consider a relation R (A, B, C, D, E, F, G) with the 2


functional dependencies-
A → BC
5 BC → DE
D→F
CF → G
find the closure of attributes and attribute sets.
6 KL3, CO3 For a database relation R(A, B, C, D) where the 2
domains of A, B, C and D include only atomic values,
only the following functional dependencies and those
ANNEXURE VIII (F)
that can be inferred from them are :
A→C
B→D
The relation R is in _______.
(A) First normal form but not in second normal form.
(B) Both in first normal form as well as in second
normal form.
(C) Second normal form but not in third normal form.
(D) Both in second normal form as well as in third
normal form.
KL3, CO3 Explain Canonical cover. Define Extraneous 2
attribute. How Canonical Cover works in DBMS?
7 What is the use of canonical cover?
What is canonical cover and minimal cover in DBMS?

KL3, CO3 Find the canonical cover of FD {A->BC, B->AC, C- 2


8
>AB}.
KL3, CO3 Define Relational decomposition with its types also 2
dependency preserving. How will you check that the
9 decomposition of a relation on a given set of functional
dependencies is dependency preserving? Discuss with
the help of an example.
KL3, CO3 Consider a schema R(X, Y, Z, W) and functional 2
dependencies FD = { X -> Y and Z -> W }. Then the
10
decomposition of relational schema R into relation
R1( X Y ) and relation R2( Z W ) is lossy or lossless.
11 KL3, CO3 Let R (A, B, C, D) be a relational schema with the
following functional dependencies:
ANNEXURE VIII (F)
A → B, B → C,
C → D and D → B.

The decomposition of R into


(A, B), (B, C), (B, D)
(A) gives a lossless join, and is dependency
preserving
(B) gives a lossless join, but is not dependency
preserving
(C) does not give a lossless join, but is dependency
preserving
(D) does not give a lossless join and is not dependency
preserving

KL3, CO3 Consider the relation scheme R = {E, F, G, H, I, J,


K, L, M, N} and the set of functional dependencies
{{E, F} -> {G}, {F} -> {I, J}, {E, H} -> {K, L}, K ->
{M}, L -> {N} on R. What is the key for R?
12
A. {E, F}
B. {E, F, H}
C. {E, F, H, K, L}
D. {E}
KL3, CO3 In a schema with attributes A, B, C, D and E
following set of functional dependencies are given
{A -> B, A -> C, CD -> E, B -> D, E -> A}
Which of the following functional dependencies is
13 NOT implied by the above set?
A. CD -> AC
B. BD -> CD
C. BC -> CD
D. AC -> BC
KL3, CO3 Explain Equivalence of Functional Dependencies.
Show that A relation R(A,B,C,D) having two FD
14 sets FD1 = {A->B, B->C, AB->D} and FD2 = {A->B,
B->C, A->C, A->D} are equivalence or not
ANNEXURE VIII (F)
KL3, CO3 Given a relation R( P, Q, R, S, T) and Functional
15 Dependency set FD = { PQ → R, S → T },
determine whether the given R is in 2NF? If not
convert it into 2 NF.
KL3, CO3 Suppose R with attributes A, B, C, D, E, F have the
16 FDs A>BC, B>E, CD>EF. Prove that FD : AD>F
also holds in R

You might also like