PYQs (English)
π Relational Database Design β Important PYQs
πΉ Unit 1: Basics of Relational Model
β Very Repeated
-
Define Relation, Tuple, Attribute, Domain with example.
-
What is Relational Model? Explain its features.
-
Explain Keys in DBMS. Types of keys with examples.
-
Difference between:
-
Primary key vs Foreign key
-
Super key vs Candidate key
-
-
What is Integrity Constraint? Explain types.
πΉ Unit 2: Functional Dependency (FD)
β Most Important (every year asked)
-
Define Functional Dependency with example.
-
Explain:
-
Trivial FD
-
Non-trivial FD
-
Fully functional dependency
-
-
Find closure of attribute set.
-
Find candidate keys using FD.
-
Explain Armstrongβs Axioms.
-
What is Minimal Cover / Canonical Cover? Find minimal cover of given FD set.
-
Check whether FD holds or not for a relation.
πΉ Unit 3: Normalization (π₯ Most asked topic)
β Must Prepare 100%
-
What is Normalization? Why needed?
-
Explain:
-
1NF
-
2NF
-
3NF
-
BCNF
-
Difference between 2NF, 3NF, BCNF.
-
Convert relation into 1NF/2NF/3NF.
-
Normalize given table up to BCNF.
-
What is Partial Dependency?
-
What is Transitive Dependency?
-
Decompose relation into 3NF.
-
Decompose relation into BCNF.
-
Explain Lossless Join Decomposition.
-
Explain Dependency Preservation.
-
Check whether decomposition is lossless or not.
πΉ Unit 4: Decomposition
-
What is Decomposition?
-
Types of decomposition.
-
Lossless vs Lossy decomposition.
-
Dependency preserving decomposition.
-
Algorithm for 3NF decomposition.
-
BCNF decomposition algorithm.
πΉ Unit 5: ER to Relational Mapping
-
Convert ER Diagram to Relational Schema.
-
Map:
-
One-to-One relationship
-
One-to-Many
-
Many-to-Many
-
Weak entity mapping.
-
Multivalued attribute mapping.
-
Specialization & Generalization mapping.
π Long Answer Questions (5β10 marks)
These are commonly asked:
β Normalize given relation step by step
β Find candidate key and minimal cover
β Decompose into BCNF with proof
β Design database for:
-
Library management system
-
Student management system
-
Banking system
-
Hospital system
-
Railway reservation system
π Short Notes (2β3 marks)
Prepare definitions:
-
Super key
-
Candidate key
-
Composite key
-
Surrogate key
-
FD
-
Normalization
-
Anomaly (Insertion, Deletion, Update)
-
Lossless join
-
Dependency preservation