@ Bikram sir can you plz explain meaning of option B

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+19 votes

Which of the following is **TRUE**?

- Every relation in 3NF is also in BCNF
- A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
- Every relation in BCNF is also in 3NF
- No relation can be in both BCNF and 3NF

0

@ Gate Ranker18 in case B) * non-prime-->non prime* dependency is possible which is not the case in 3NF(transitive dependency)

0

rajoramanoj acc to me both B and C are correct

reena_kandari it is **X-> non_prime** not **non-prime-->non prime**

+3

every non-prime attribute of R is fully functionally dependent on every key of R

it gurantee there should not be the case of * prime--->non-prime * other than

it does not say anything about **non-prime-->non prime*** , *so it can occure here which for sure does not gurantee 3NF.

+23 votes

+6

Nopes, that does not guarantee 3NF. For 3NF there **should not** be any FD X->Y such that Y-X is a non-key and X is not a super key.

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.2k
- Algorithms 3.6k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.3k
- CO & Architecture 2.9k
- Computer Networks 3.3k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 480
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 15

40,748 questions

47,471 answers

145,584 comments

62,234 users