retagged by
288 views
1 votes
1 votes
closed with the note: DUplicate of https://gateoverflow.in/99006/minimal-cover#c112483
Consider the following FD set {A → BC,B → AC, C → AB}. The number of different minimal covers possible for the above FD set __________ .
retagged by

Related questions

0 votes
0 votes
1 answer
1
Mrityudoot asked Jan 12
128 views
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
1 votes
1 votes
1 answer
2
Sajal Mallick asked Nov 5, 2023
337 views
Unique not null is equivalent to primary key.Relational Algebra and SQL has same expressive power.Which of the above statements are False?
0 votes
0 votes
6 answers
3
kaustubh7 asked Sep 20, 2023
811 views
Consider a relation $R(ABCDEFGH)$.How many superkeys will be there in relation $R$ if the candidate keys for relation are ${A, BC, CDE, EF}$?
0 votes
0 votes
2 answers
4
Souvik33 asked Jan 14, 2023
506 views
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of RTRUEFALSE