πŸ“˜ Relational Database Design – Important PYQs

πŸ”Ή Unit 1: Basics of Relational Model

⭐ Very Repeated

  1. Define Relation, Tuple, Attribute, Domain with example.

  2. What is Relational Model? Explain its features.

  3. Explain Keys in DBMS. Types of keys with examples.

  4. Difference between:

    • Primary key vs Foreign key

    • Super key vs Candidate key

  5. What is Integrity Constraint? Explain types.


πŸ”Ή Unit 2: Functional Dependency (FD)

⭐ Most Important (every year asked)

  1. Define Functional Dependency with example.

  2. Explain:

    • Trivial FD

    • Non-trivial FD

    • Fully functional dependency

  3. Find closure of attribute set.

  4. Find candidate keys using FD.

  5. Explain Armstrong’s Axioms.

  6. What is Minimal Cover / Canonical Cover? Find minimal cover of given FD set.

  7. Check whether FD holds or not for a relation.


πŸ”Ή Unit 3: Normalization (πŸ”₯ Most asked topic)

⭐ Must Prepare 100%

  1. What is Normalization? Why needed?

  2. Explain:

  • 1NF

  • 2NF

  • 3NF

  • BCNF

  1. Difference between 2NF, 3NF, BCNF.

  2. Convert relation into 1NF/2NF/3NF.

  3. Normalize given table up to BCNF.

  4. What is Partial Dependency?

  5. What is Transitive Dependency?

  6. Decompose relation into 3NF.

  7. Decompose relation into BCNF.

  8. Explain Lossless Join Decomposition.

  9. Explain Dependency Preservation.

  10. Check whether decomposition is lossless or not.


πŸ”Ή Unit 4: Decomposition

  1. What is Decomposition?

  2. Types of decomposition.

  3. Lossless vs Lossy decomposition.

  4. Dependency preserving decomposition.

  5. Algorithm for 3NF decomposition.

  6. BCNF decomposition algorithm.


πŸ”Ή Unit 5: ER to Relational Mapping

  1. Convert ER Diagram to Relational Schema.

  2. Map:

  • One-to-One relationship

  • One-to-Many

  • Many-to-Many

  1. Weak entity mapping.

  2. Multivalued attribute mapping.

  3. 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

Last modified: Wednesday, 4 February 2026, 1:12 AM