Question Details

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?

Options

A

R1​ is in 3NF

B

R2 is in 3NF

C

R1​ is NOT in 3NF

D

R2 is NOT in 3NF

Show Answer
Correct Answer
D
R2 is NOT in 3NF

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 R is in 3NF if, for every non-trivial functional dependency X→Y holding on R, at least one of the following conditions is satisfied:
- X is a superkey of R, or
- Y is a prime attribute of R (i.e., Y is a member of some candidate key of R).

2. Analyzing R2(A, B, C, D):
The given set of functional dependencies for R2 is:
1. A→D
2. A→B
3. C→A

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 C only appears on the left-hand side of the functional dependency C→A and never on the right-hand side of any dependency. Therefore, C must be a part of every candidate key of R2.
Let us compute the attribute closure of C (denoted as C+):
C+={C}
Using the functional dependency C→A, we add A to the closure:
C+={C,A}
Using the functional dependencies A→D and A→B, we add D and B to the closure:
C+={A,B,C,D}
Since the closure C+ contains all attributes of R2, C is a candidate key. Because C is essential and itself determines all attributes, C 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 C→A:
The determinant C is a candidate key (superkey), so this dependency satisfies the 3NF criteria.

- For A→D:
1. The determinant A is not a superkey.
2. The dependent D is a non-prime attribute (since the only candidate key is C).
Therefore, A→D violates the rules of 3NF.

- For A→B:
1. The determinant A is not a superkey.
2. The dependent B is a non-prime attribute.
Therefore, A→B 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.

Transparent Access on Mindyard

Built for Learners & Educators Alike

Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.

FREE FOR STUDENTS

Practice & Learn Free for Students

Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.

  • Unlimited mock tests & question bank practice
  • Full access to curated study library & formula notes
  • 100% free for students • No credit card required
2 MONTHS FREE TRIAL

Educators & Coaching Institutes

Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.

  • AI question uploader & rapid test generator
  • Anti-cheating tab proctoring & performance reports
  • Full Pro access free for 60 days • No upfront commitment
Discover more resources

You may also like

Mock Tests

View All
  • GATE
  • beginner
  • 3 hours
  • civil engineering

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.

  • GATE
  • beginner
  • 3 hours
  • electronics and communication engineering

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.

Ask AI Tutor
5 left
Q1 View Question & Options
AI Tutor is solving this question...
Reading question context & options...
Ask your own doubt or choose a quick prompt: