The Gateway to Computer Science Excellence

+2 votes

Best answer

The third normal form (3NF) is a normal form used in database normalization Codd's definition states that a table is in 3NF if and only if both of the following conditions hold:

- The relation R (table) is in seconfd normal form(2NF)
- Every non-prime attribute of R is non-transitively dependent on every key of R.

A* *non-prime attribute of R is an attribute that does not belong to any candidate key of R.

A transitive dependency is a functional dependency in which

*X* → *Z*(*X* determines *Z*) indirectly, by virtue of *X* → *Y* and *Y* → *Z* (where it is not the case that *Y* → *X*).

Hence,Option**(B)Transitive Dependency.**

0 votes

Answer : Transitive Dependency

Third Normal form applies that every non-prime attribute of table must be dependent on primary key, or we can say that, there should not be the case that a non-prime attribute is determined by another non-prime attribute. So this transitive functional dependency should be removed from the table and also the table must be in Second Normal form.

Reference : 3 NF

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,644 questions

56,512 answers

195,560 comments

101,074 users