Discussion
Which normal form eliminates transitive dependencies ?
Answer: C
Transitive dependencies are removed by 3NF (third normal form).
A relation is in 3NF when it is in 2NF and no non-key attribute depends on the key through another non-key attribute. For example, in Student(id, dept, dept_head), dept_head depends on id only through dept, so it is moved into a separate Department table.
1NF requires atomic values. 2NF removes partial dependencies on part of a composite key. BCNF is a stricter form that also handles dependencies whose determinant is not a superkey, but the normal form defined by removing transitive dependencies is 3NF.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development