KIPM – College of Engineering &Technology
(Approved by AICTE, New Delhi & Affiliated to Dr. A. P. J. Abdul Kalam University, Lucknow)
Department of Computer Science and
Engineering
Assignment- 03
Branch : CSE (AIML)
Subject Name : DBMS
Subject Code : BCS501
Year/ Semester : 3rd Year/ 5th Semester
Faculty Name : Mr. Pramod Kumar Gupta
Session : 202526
Sr. MANDATORY QUESTIONS BL
1 What is functional dependency? Explain the procedure of K2
calculating the canonical cover of a given functional
dependency set with suitable example.
2 Describe the term MVD in the context of DBMS by giving an K2
example. Discuss 4NF and 5NF also.
3 What do you understand by transitive dependencies? Explain K2
with an example any two problems that can arise in the
database if transitive dependencies are present in the
database.
4 Write different Inference Rule for Functional Dependency? K2
5 What are advantages of normalization? K2
,K4
6 (a) Consider the relation R (a b c d) with Set F={a→ c b→d}. K1,
Decompose this relation in 2 NF. K2
(b) Explain the Loss Less Decomposition with example.
7 Explain 1NF, 2 NF, 3 NF and BCNF with suitable example. K1,
K2
8 Consider the universal relational schema R (A B C D E F G H I K1
J) and a set of following functional dependency f={F-AB->C, A-
>DE,B→F,F→GH,D→U}. Determine the keys for R? Decompose
R into 2nd Normal Forms.
9 Consider the schema R=(S T U V) and the dependencies S→T, K1
T→ 𝑈, 𝑈 → 𝑉 𝑎𝑛𝑑 𝑉 → 𝑆.Let R=(R1and R2) be a
decomposition such that R1∩R2=∅.
10 Consider a relation schema R=(A,B,C,D,E,H) on which the K1
following functional dependencies hold:{A→ 𝐵, 𝐵𝐶 → 𝐷, 𝐸 →
𝐶, 𝐷 →A} What are the candidate keys of R?