Register

Timothy (normal form)

1,403 views
2 2 votes
Let R be a relation. Which options are correct

a)R will necessarily have a composite key  if R is in BCNF  but not in 4NF

b) If R is in 3NF and if every key of R is simple, then R is in BCNF

c) If R is in BCNF and if R has at least one simple key , then R is in 4NF

d) If R is in 3NF and if its every key  is simple, then R is in 5NF

1 Answer

0 0 votes

Option B is right option

BCNF is stricter than 3NF. A table is BCNF if it is in 3NF and for every FD  X->Y, X should be the super key of the table.

Consider a relation R X->Y, Since R is in 3NF, either

  1. X is a superkey or
  2. Y is a member of a key

Since every key in R is simple, Y has only one attribute and Y itself is a key, which implies that X is always a superkey. Therefore, X->Y does not violate BCNF in either case, which implies that R is in BCNF.

Voting & Accepting an answer helps improve the community
← Previous · KENNETH- rosen book ...Next → · Boolean algebra
← Previous in category · test-seriesNext in category → · Weak entity set
Position:
Show:

Related questions

2 2 votes
1 1 answer
109
109 views
GO Classes asked Sep 11
109 views
GO Classes DPP | GATE CS, DA | DBMS | Highest Normal Form
Consider $R(A,B,C,D,E)$ with $A \to B,$ $B \to C,$ $C \to D,$ and $C \to E$.Assuming atomic attribute values, what is the highest normal form satisfied by $R$?$\text{1NF}...
2 2 votes
4 4 answers
219
219 views
GO Classes asked Sep 10
219 views
GO Classes DPP | GATE CS, DA | DBMS | Second Normal Form
Consider the relation $R(V,W,X,Y,Z)$ with functional dependencies :$V \to X$$WY \to X$$VWY \to Z$The candidate key is $VWY$.Assume that all attributes contain atomic valu...
1 1 vote
1 1 answer
128
128 views
GO Classes asked Sep 10
128 views
GO Classes DPP | GATE CS, DA | DBMS | First Normal Form
Consider the relation $\text{course(c_id, dept_id, dept, evaluations, inst, office, sect, time_slot)}$with the following sample tuple:$\text{(61, 1, CS, {HW, Midterm, Fin...
0 0 votes
3 answers 3 answers
1.6k
1.6k views
Souvik33 asked Dec 17, 2022
1,594 views
Database Relations | Heighest normal form
MSQ A relation R(A,B,C,D) has only trivial functional dependencies of the form ( A→A, AB→AB,ABC→A, etc)Then consider the following options:The relation is surely in BCNFT...