681 views

3 Answers

2 2 votes
fds = AB➡CDE , C➡B

candidate keys = AB , AC

non-prime attributes = D, E

It is in 3 NF (no violation)

Not in BCNF ( violation-  C➡B )

option C
0 0 votes
Dependency:
AB ---> CDE
C ---> B
$1$NF(yes): assume all attributes are atomic
$2$NF(yes): no partial functional dependency like A alone can derive C or D or E
$3$NF(yes): no transitive functional dependency or there is nothing like (non key)-->(non key)

BCNF(no): in non trivial FD C-->B, C is not a SuperKey.

Underline is used to indicate Primary Key, Not candidate key.

Here, by underline, it means that $A B$ is a primary key. There can be more candidate keys.
reshown by
Answer:
Position:
Show:

Related questions

4 4 votes
6 6 answers
740
740 views
GO Classes asked Jul 11, 2025
740 views
Armstrong's inference rule doesnot determineReflexivityAugmentationTransitivityMutual dependency
1 1 vote
6 6 answers
649
649 views
GO Classes asked Jul 11, 2025
649 views
Let $x, y, z, a, b, c$ be the attributes of an entity set E . If $\{x\},\{x, y\},\{a, b\},\{a, b, c\},\{x, y, z\}$ are superkeys then which of the following are the candi...
3 3 votes
6 6 answers
674
674 views
GO Classes asked Jul 11, 2025
674 views
Consider a relation $\mathbf{R(A, B, C, D, E)}$ with the functional dependencies:$$\mathbf{CE} \rightarrow \mathbf{D}, \mathbf{D} \rightarrow \mathbf{~B}, \mathbf{C} \rig...
2 2 votes
4 4 answers
609
609 views
GO Classes asked Jul 11, 2025
609 views
What is the highest normal form satisfied by the relation $R(A, B, C, D, E)$ with functional dependencies $\mathbf{C E} \rightarrow$ $\mathbf{D}, \mathbf{D} \rightarrow \...