Minimal Cover Of Functional Dependency
Duration: 11 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video lecture explains the concept of finding the Minimal Cover, also known as Canonical Cover or Irreducible Set, for a set of Functional Dependencies (FDs) in Database Management Systems. The instructor begins by defining minimal cover as the elimination of redundancy and canonical cover as a simplified set with the same closure as the original set. He outlines three types of redundancy: complete production redundancy, redundant attributes on the right-hand side, and redundant attributes on the left-hand side. Using a humorous analogy of a truck transforming into a bicycle, he illustrates the concept of minimization. The core of the lecture involves a step-by-step worked example on a relation R(ABCD) with specific functional dependencies. The instructor demonstrates how to decompose right-hand sides into single attributes, remove redundant dependencies by calculating attribute closures, and check for redundant attributes on the left-hand side to arrive at the final minimal cover.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with a slide titled 'To find the MINIMAL COVER /CANONICAL COVER/IRREDUCIBLE SET'. The instructor defines 'Minimal cover' as eliminating any kind of redundancy from a Functional Dependency (FD) set. He further defines a 'canonical cover' as a simplified set of FDs that has the same closure as the original set F. The slide lists three types of redundancy: complete production may be redundant, one or more attributes may be redundant on the right-hand side, and one or more attributes may be redundant on the left-hand side. The instructor uses a red pen to circle the title terms, emphasizing their equivalence in this context.
2:00 – 5:00 02:00-05:00
The instructor uses a visual analogy to explain the concept of minimization. A slide appears with the text 'Gate aspirant ke haathon se minimize hone ke baad' (After minimizing by the hands of a Gate aspirant), showing a large truck transforming into a small bicycle. This humorously illustrates the reduction process. He then transitions back to the theoretical content, writing the letter 'F' on the screen to represent the set of functional dependencies that needs to be processed. He explains that the goal is to find a minimal cover for this set F.
5:00 – 10:00 05:00-10:00
A specific problem is introduced on the screen: 'Q R(ABCD)' with functional dependencies 'A -> B', 'C -> B', 'D -> ABC', and 'AC -> D'. The instructor begins the minimization process by decomposing the right-hand side of the dependencies to ensure single attributes. He writes 'D -> A', 'D -> B', and 'D -> C' as separate dependencies. He then checks for redundant dependencies by calculating closures. For instance, he checks 'A -> B' by calculating 'A+' which equals 'AB', confirming it is necessary. He checks 'C -> B' similarly. He then identifies 'D -> B' as redundant because 'D' can derive 'B' through 'D -> A' and 'A -> B', so he crosses it out.
10:00 – 11:19 10:00-11:19
The instructor proceeds to check for redundant attributes on the left-hand side of the dependencies. He focuses on 'AC -> D'. He calculates the closure '(AC)+' and finds it equals 'ABCD'. To check for redundancy, he tests if 'A' alone or 'C' alone can derive 'D'. He calculates 'A+' which is 'AB' and 'C+' which is 'CB', neither of which includes 'D'. Therefore, neither 'A' nor 'C' is redundant, and 'AC -> D' is kept. The final minimal cover is summarized on the board as the set: 'A -> B', 'C -> B', 'D -> A', 'D -> C', and 'AC -> D'.
The video provides a comprehensive guide to finding the Minimal Cover of functional dependencies. It starts with clear definitions of redundancy and canonical covers, uses a relatable analogy to explain the concept of minimization, and culminates in a detailed, step-by-step example. The instructor demonstrates the standard algorithm: decomposing RHS, removing redundant FDs via closure calculation, and removing redundant LHS attributes. This structured approach helps students understand how to simplify a set of functional dependencies while preserving the original closure.

