
Your Success, Our Mission!
6000+ Careers Transformed.
In Database Management System, two sets of functional dependencies F and G are said to be equivalent if:
Every dependency in F can be derived from G
AND
Every dependency in G can be derived from F
In short:
Different expressions… same power.
Set F:
| A → B B → C |
Set G:
| A → B A → C |
From F:
| A → B B → C ⇒ A → C (Transitivity) |
So G is derivable from F
From G:
| A → B (already) A → C (given) |
We already have everything G provides.
So both sets generate same dependencies
Therefore:
| F ≡ G |
| F = {A → B, B → D} G = {A → B, A → D} |
| A → B B → D ⇒ A → D |
| A → D already exists |
Both sets produce same closure
Same dish → Equivalent

Same destination → Equivalent

Same output → Equivalent

Top Tutorials

GATE 2026 Data Science and AI
Explore this free tutorial to understand various concepts of GATE Data Science and AI 2026 . Learn probability, algebra, calculus, etc.

ChatGPT
In this ChatGPT tutorial, learn how to use ChatGPT effectively. Master the art of conversational AI with our step-by-step lessons. Start to learn ChatGPT today!

Artificial Intelligence
Dive into our comprehensive Artificial Intelligence tutorial and master the fundamentals of AI. From an introduction to advanced concepts, learn AI from scratch
All Courses (6)
Master's Degree (2)
Fellowship (2)
Certifications (2)