GATE CSE · 2026 · CS2
Question 42: Databases
Give it a try, then reveal the answer to check your work.
Question 42
CS2MCQ2 marksNeeds review
In the context of schema normalization in relational DBMS, consider a set
of functional dependencies. The set of all functional dependencies implied by
is called the closure of
. To compute the closure of
, Armstrong’s axioms can be applied. Consider
,
, and
as sets of attributes over a relational schema. The three rules of Armstrong’s Axioms are described as follows.Reflexivity: If
, then
Augmentation: If
, then
for any
Transitivity: If
and
, then
The additional rule of Union is defined as follows.
Union: If
and
, then
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?
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2026CS2
GATE CSE 2026 · Paper 2
Computer Science and Information Technology · Original paper archive
- Section
- Section CS2
- Question type
- Multiple choice (MCQ)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
databases
GATE CSE previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.