Functional Dependencies and Normalization Previous Year Questions (PYQs) for GATE DA: 4+ Solved Questions with Step-by-Step Solutions

    Solve 4+ Functional Dependencies and Normalization previous year questions for GATE DA with answers and detailed solutions. Free sample questions below.

    Chapter Roadmap: Functional Dependencies and Normalization

    Chapter Roadmap

    1

    Functional Dependencies and Candidate Keys

    The foundation. Decoding the rules of data determination and systematically extracting minimal keys.

    2

    Normalization, BCNF and Dependency Preservation

    The application. Breaking down messy tables into clean structures to eliminate update anomalies.

    3

    Armstrong Axioms and Derived Dependencies

    The proof. Mastering the formal mathematical rules to verify and derive functional dependencies.

    Functional Dependencies and Candidate Keys

    Functional Dependencies and Candidate Keys

    A database without defined dependencies is just a chaotic bucket of text. These rules capture real-world semantics, ensuring data is logically connected and uniquely identifiable.

    What you will learn here

    • The precise definition and intuition behind Functional Dependencies.
    • How to compute the closure of an attribute set.
    • The systematic, foolproof method to find all Candidate Keys.
    • How to distinguish between Super Keys, Candidate Keys, and Prime Attributes.
    Context: This is the starting point of database design. We must understand the rules before we can normalize the tables.

    Functional Dependencies and Normalization: Solved Questions with Step-by-Step Explanations (4 Problems)

    Question 1 · Database Management and Warehousing MSQ
    Given the relational schema and the set of functional
    dependencies:

    Which of the following functional dependencies can be derived from the above
    set?
    1. A.

    2. B.

    3. C.

    4. D.

    Question 2 · Database Management and Warehousing MCQ

    If a relational decomposition is not dependency-preserving, which one of the following relational operators will be executed more frequently in order to maintain the dependencies?

    1. A.

      Selection

    2. B.

      Projection

    3. C.

      Join

    4. D.

      Set union

    Question 3 · Database Management and Warehousing MSQ
    1. A.

      A is the only candidate key of R

    2. B.

      A, BC are the candidate keys of R

    3. C.

      A, BC, E are the candidate keys of R

    4. D.

      Relation R is not in Boyce-Codd Normal Form (BCNF)

    Question 4 · Database Management and Warehousing MCQ
    Let R(A,B,C,D,E) be a relational schema with functional dependency set .
    Which of the following statements is correct?
    1. A.

      AD, ED and CD are the only candidate keys of R.

    2. B.

      AD and ED are the only candidate keys of R.

    3. C.

      A, E and CD are the only candidate keys of R.

    4. D.

      A and CD are the only candidate keys of R.

    More previous year questions (pyqs) in this unit

    chapter
    Functional Dependencies and Normalization Previous Year Questions (PYQs) for GATE DA: 4+ Solved Questions with Step-by-Step Solutions

    Solve 4+ Functional Dependencies and Normalization previous year questions for GATE DA with answers and detailed solutions. Free sample questions below.

    A question from this chapter

    Question 1
    Given the relational schema and the set of functional
    dependencies:

    Which of the following functional dependencies can be derived from the above
    set?
    Question 2

    If a relational decomposition is not dependency-preserving, which one of the following relational operators will be executed more frequently in order to maintain the dependencies?

    Question 3
    Question 4
    Let R(A,B,C,D,E) be a relational schema with functional dependency set .
    Which of the following statements is correct?
    Free preview ends here

    Login to view the complete previous-year questions and solutions

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Login to continueSee plans
    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.

    View all plansStart free