Consider the following relational schema along with all the functional dependencies that hold on them.
R1(A,B,C,D,E):{D→E,EA→B,EB→C}
R2(A,B,C,D):{A→D,A→B,C→A}
Which of the following statement(s) is/are TRUE?
Solution :
The correct option is: R2 is NOT in 3NF
To determine whether the relational schemas are in Third Normal Form (3NF), we need to analyze their candidate keys and check the 3NF conditions for their functional dependencies.
1. Third Normal Form (3NF) Definition:
A relation schema is in 3NF if, for every non-trivial functional dependency holding on , at least one of the following conditions is satisfied:
- is a superkey of , or
- is a prime attribute of (i.e., is a member of some candidate key of ).
2. Analyzing R2(A, B, C, D):
The given set of functional dependencies for R2 is:
1.
2.
3.
Step A: Find the Candidate Keys of R2
Let us examine the attributes that do not appear on the right-hand side of any functional dependency in R2. The attribute only appears on the left-hand side of the functional dependency and never on the right-hand side of any dependency. Therefore, must be a part of every candidate key of R2.
Let us compute the attribute closure of (denoted as ):
Using the functional dependency , we add to the closure:
Using the functional dependencies and , we add and to the closure:
Since the closure contains all attributes of R2, is a candidate key. Because is essential and itself determines all attributes, is the unique candidate key of R2.
Step B: Identify Prime and Non-Prime Attributes
- Prime attribute (part of the candidate key): {C}
- Non-prime attributes (not part of the candidate key): {A, B, D}
Step C: Verify the 3NF Conditions for R2
Now we check the functional dependencies of R2 against the 3NF rules:
- For :
The determinant is a candidate key (superkey), so this dependency satisfies the 3NF criteria.
- For :
1. The determinant is not a superkey.
2. The dependent is a non-prime attribute (since the only candidate key is ).
Therefore, violates the rules of 3NF.
- For :
1. The determinant is not a superkey.
2. The dependent is a non-prime attribute.
Therefore, also violates the rules of 3NF.
Since R2 contains functional dependencies that do not satisfy either condition of the 3NF definition, the relational schema R2 is NOT in 3NF.
Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.
Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.
Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.
Prepare for GATE 2026 Civil Engineering with the latest question papers, previous year papers, detailed solutions, syllabus, exam pattern, preparation tips, mock tests, and subject-wise study material. Download GATE 2026 CE question papers with solutions in PDF format and boost your preparation for top engineering institutes and PSU recruitment.
Prepare effectively for GATE 2026 Electronics & Communication Engineering (EC) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Electronic Devices, Analog Circuits, Digital Circuits, Signals & Systems, Network Theory, Control Systems, Electromagnetics, Communications, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 EC preparation strategy.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.