Register

Geek for Geek

334 views
0 votes
0 votes

Find the highest normal form of a relation R(A,B,C,D,E) with FD set {B->A, A->C, BC->D, AC->BE}

User Avatar

1 Answer

1 votes
1 votes
Candidate Keys = A, B

B -> A ( LHS Super Key. Hence BCNF)

A -> C ( LHS Super Key. Hence BCNF)

BC -> D (LHS Super Key. Hence BCNF)

AC -> BE (LHS Super Key. Hence BCNF)

Hence, Highest normal form of relation is BCNF
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Gatetarget_100 asked Aug 3, 2018
548 views
C Programing mock test geeks for geek
int main() { int a[10]; printf("%d",*a+1-*a+3); return 0; } Answer is given as 4 but i think it should be 8, if int is of 4 byte. Correct me if i am wrong
int main() { int a[10]; printf("%d",*a+1-*a+3); return 0; }Answer is given as 4 but i think it should be 8, if int is of 4 byte. Correct me if i am wrong
User Avatar
0 votes
0 votes
0 answers
2
mehul vaidya asked Jul 4, 2018
1,040 views
geek for geek
did not get logic behind this answer , why we subtract remainder from 9999 Question 6 : Find the largest four digit number exactly divisible by 15,21 and 28. Solution : The largest four digit number is 9999. Now, LCM (15, 21, 28) = 420 On dividing 9999 by 420, we get 339 as the remainder. Therefore, the required number is 9999-339 = 9660
did not get logic behind this answer , why we subtract remainder from 9999Question 6 : Find the largest four digit number exactly divisible by 15,21 and 28.Solution : The...
User Avatar
Link Copied!