Finding Candidate Keys from FDs | GATE DA 2027 DBMS & Data Warehousing in Hindi

Superkey milna aasaan hai. Saari candidate keys ginna - wahaan marks katte hain. ⏱ CHAPTERS 0:00 Introduction 0:50 The idea 2:14 The formula 3:00 Building it up 3:45 Subsets a brute-force hunt would have to close = 2^n 4:31 R(A,B,C,D,E,H) with F = { A-›B, BC-›D, E-›C, D-›A } 6:05 Building it up: conveyor belt 6:42 Building it up: attribute 7:30 Rule 2, proved: a right-only attribute is never prime 8:56 The formula: procedure 9:51 Core E H, then ONE 'both' attribute at a time 11:32 The idea: chaabiyaan 12:11 Prime = appears in at least ONE candidate key 13:16 The trap 14:13 Real GATE question 14:56 Real GATE question: classification 16:36 Real GATE question: options 17:44 The idea: subsets 18:21 GATE DA 2026 Q17: D is in every key, B is in none 19:58 Building it up: classification 21:01 Recap ✅ REAL GATE QUESTIONS SOLVED IN THIS VIDEO • GATE DA 2025 Q57 (answer: B;D) • GATE DA 2026 Q17 (answer: A) Har answer official GATE answer key se verify kiya gaya hai. ⬅ PICHHLA VIDEO: Functional Dependencies & Closure - 5 Solved Problems — 5 GATE PYQs Solved | GATE DA 2027 in Hindi ➡ AGLA VIDEO: Finding Candidate Keys from FDs — 5 GATE PYQs Solved | GATE DA 2027 in Hindi 📚 POORA COURSE — 220 videos, syllabus order mein:    • GATE DA 2027 Complete Course in Hindi — Fu...   🎯 GATE DA 2027 ki taiyari kaise shuru karein:    • How to Prepare for GATE DA 2027   ▶ CHANNEL:    / @datarekha   Ye poora course bilkul free hai — har topic, har exercise video. Sabko same level par seekhne aur compete karne ka haq hai.