GATE CS 2026 (Afternoon) — Question 42

Database Management Systems (DBMS)Integrity Constraints & Functional DependenciesMCQ2 marks · −2/3 if wrongMedium

In the context of schema normalization in relational DBMS, consider a set \( F \) of functional dependencies. The set of all functional dependencies implied by \( F \) is called the closure of \( F \). To compute the closure of \( F \), Armstrong's Axioms can be applied. Consider \( X, Y, \) and \( Z \) as sets of attributes over a relational schema. The three rules of Armstrong's Axioms are described as follows. Reflexivity: If \( Y \subseteq X \), then \( X \rightarrow Y \) Augmentation: If \( X \rightarrow Y \), then \( XZ \rightarrow YZ \) for any \( Z \) Transitivity: If \( X \rightarrow Y \) and \( Y \rightarrow Z \), then \( X \rightarrow Z \) The additional rule of Union is defined as follows. Union: If \( X \rightarrow Y \) and \( X \rightarrow Z \), then \( X \rightarrow YZ \) It can be proved that the additional rule of Union is also implied by the three rules of Armstrong's Axioms. Listed below are four combinations of these three rules. Which one of these combinations is both necessary and sufficient for the proof?
  1. A
    Reflexivity, Augmentation, and Transitivity
  2. B
    Reflexivity and Augmentation
  3. C
    Transitivity
  4. D
    Augmentation and Transitivity
Practise the full 2026-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Integrity Constraints & Functional DependenciesTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group