540 views

2 Answers

1 votes
1 votes

3NF, or Third Normal Form, is a database normalization rule that states that a relation is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R.

A non-prime attribute is an attribute that is not part of the primary key of the relation. A functional dependency is an constraint that states that the value of one attribute determines the value of another attribute in the relation. A full functional dependency is a type of functional dependency where the dependency holds for all possible values of the determinant attribute.

In other words, a relation is in 3NF if every non-prime attribute is dependent on the entire primary key and not just a part of it. Additionally, if a non-prime attribute depends on a non-key attribute then it violates 3NF.

A relation is said to be in 3NF if it is already in 2NF and there are no transitive functional dependencies, meaning that if A->B and B->C, then A->C should not exist.

In summary, the 3NF states that every non-prime attribute should be fully functionally dependent on every key of R.

0 votes
0 votes

The given key is “TRUE” and explanation as follows::

 

Consider a situation R(A,B,C,D) and FD’s { AB → C, AB → D, C→ D}

Here, key is ‘AB’ and every non-prime attribute of R is fully functionally reliant on every key of R. The FD { C→ D } voilates 3NF conditions as PA {A,B}, NPA{C,D}

So, shouldn’t the answer be FALSE

Related questions

7 votes
7 votes
2 answers
1
Himanshu1 asked Jan 2, 2016
4,617 views
A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of RTrue/False
1 votes
1 votes
1 answer
2
Sajal Mallick asked Nov 5, 2023
360 views
Unique not null is equivalent to primary key.Relational Algebra and SQL has same expressive power.Which of the above statements are False?
1 votes
1 votes
1 answer
3
dileswar sahu asked Sep 2, 2017
2,179 views
The depth of any DFS (Depth First Search) tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.I think in line graph has the...
0 votes
0 votes
2 answers
4
gshivam63 asked May 31, 2016
1,091 views
If average weight of a minimum spanning tree is Aavg.Then minimum spanning tree will have weight almost (n-1)Aavg, where n is no of vertices in the graph. It is true or f...