Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) DBMS Integrity Constraints and Normal Form Functional Dependency
Let R (ABCDEFGH) be a relation schema and F be the set of dependencies F = {A → B, ABCD → E, EF → G, EF → H and ACDF →EG}. The minimal cover of a set of functional dependencies is
1
A → B, ACD → E, EF → G, and EF → H
2
A → B, ACD → E, EF → G, EF → H and ACDF → G
3
A → B, ACD → E, EF → G, EF → H and ACDF → E
4
A → B, ABCD → E, EF → H and EF → G