Computer Science · Database Management Systems
Let R(A, B, C, D, E, F, G, H) be a relation schema and F be the set of functional dependencies: F = {A → B, ABCD → E, EF → G, EF → H, ACDF → EG}. The minimal cover of this set of functional dependencies is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A → B, ACD → E, EF → G, EF → H✓
- 2A → B, ACD → E, EF → G, EF → H, ACDF → G
- 3A → B, ACD → E, EF → G, EF → H, ACDF → E
- 4A → B, ABCD → E, EF → H, EF → G
Correct answer
A → B, ACD → E, EF → G, EF → H
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems