5NF
Duration: 18 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 lecture introduces Fifth Normal Form (5NF) as the final stage in a normalization sequence that includes 1NF, 2NF, 3NF, BCNF, and 4NF. A relation is in 5NF if it is already in 4NF and every non-trivial join dependency (JD) is implied by the candidate keys of the relation. The instructor frames 5NF as removing redundancy caused by complex many-to-many-to-many relationships, using a Supplier-Part-Project example. A sample table SUPPLIER_PART_PROJECT with columns Supplier, Part, and Project contains rows such as S1/P1/J1, S1/P1/J2, S1/P2/J1, and S1/P2/J2. The business rule states that if a supplier supplies a part and works with a project, the corresponding combination is valid. The three-way relationship can be represented using three binary relationships: SP, SJ, and PJ. The lecture walks through decomposing the original relation into these three binary tables and then joining them back to reconstruct SUPPLIER_PART_PROJECT, demonstrating a lossless decomposition. A comparison between 4NF and 5NF is presented: 4NF deals with multivalued dependencies (MVDs), while 5NF deals with join dependencies (JDs) and is also called Project-Join Normal Form. The instructor annotates the comparison table to emphasize that 5NF requires no non-trivial join dependencies except those implied by candidate keys.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with a title slide reading 'Decomposition Properties & 4NF' and an underlined subtitle 'Fifth Normal Form (5NF)'. The content page defines 5NF with two bullets: 'It is already in 4NF, and' and 'Every non-trivial join dependency (JD) is implied by the candidate keys of the relation.' The instructor writes '1NF, 2NF' in red under the title, then adds ', 3NF', 'BCNF, 4NF' to complete the normalization sequence. The slide explains that 5NF removes redundancy from complex many-to-many-to-many relationships and asks 'Why do we need 5NF?', using a Supplier-Part-Project example.
2:00 – 5:00 02:00-05:00
A table titled SUPPLIER_PART_PROJECT is shown with columns Supplier, Part, Project and four rows: S1/P1/J1, S1/P1/J2, S1/P2/J1, S1/P2/J2. On-screen text reads 'Suppose the business rule is:' followed by a sentence about a supplier supplying a part and working with a project, ending 'the corresponding combination is valid.' A line at the bottom states 'Here, the three-way relationship can be represented using three binary relationships.' Red handwritten annotations build up: a boxed note with 'CK' crossed out by an arrow to 'non-trivial join dependency', red letters S, P, J beside column headers, braces marking value groups, and an annotation completing to 'CK { (S, P, J) }'.
5:00 – 10:00 05:00-10:00
The instructor explains the non-trivial join dependency in the Supplier-Part-Project relation that violates 5NF. The three-way relationship is decomposed into three binary relationships: SP, SJ, and PJ. The instructor writes 'S -> P' in the top right corner, adds 'P -> J' and 'S -> J' with a cross mark next to them, writes the word 'Decomposition', and lists the decomposed relations as SP, SJ, and PJ. A second slide headed 'Fifth Normal Form (5NF)' reiterates the definition bullets, and red notes box 'non-trivial join dependency' with an arrow to '5NF', while a left box is labeled 'Join Dep'. The term '(MVD)' and 'many-to-many-to-many' appear on screen.
10:00 – 15:00 10:00-15:00
The opening slide is headed 'Fifth Normal Form (5NF)' with the sequence 1NF, 2NF, 3NF, BCNF, 4NF written in red beneath it. Two definition bullets read 'It is already in 4NF, and (MVFD)' and 'Every non-trivial join dependency (JD) is implied by the candidate keys of the relation.' The example line 'Supplier ↔ Part ↔ Project' is circled in red, with handwritten arrows pointing to the entity pairs SP, PJ and SJ. A 'Step 1: Decompose into three relations' slide displays the tables SUPPLIER_PART, SUPPLIER_PROJECT and PART_PROJECT with rows such as S1-P1, S1-J1 and P2-J2. A 'Step 2: Join the relations' slide shows SUPPLIER_PART + SUPPLIER_PROJECT + PART_PROJECT combining into SUPPLIER_PART_PROJECT, then a tree splitting that table into SP, SJ, and PJ.
15:00 – 18:13 15:00-18:13
The video explains 5NF (Project-Join Normal Form) by demonstrating how a non-trivial join dependency can be reconstructed from decomposed tables. A diagram shows the reconstruction of SUPPLIER_PART_PROJECT from SP, SJ, and PJ tables. A comparison table between 4NF and 5NF is presented: the 'Requirement' row contrasts 'non-trivial MVD' with 'candidate key', and the 'Also called' row circles 'Project-Join Normal Form (PJ/NF)'. The instructor annotates the table to emphasize that 5NF removes join-based redundancy and deals with complex relationships, requiring no non-trivial join dependencies except those implied by candidate keys. On-screen text includes 'What does 5NF do?', 'lossless', 'Multivalued Dependency (MVD)', and 'Join Dependency (JD)'.
The lecture builds 5NF as the culmination of a normalization hierarchy. It begins by positioning 5NF after 1NF, 2NF, 3NF, BCNF, and 4NF, then defines it precisely: a relation is in 5NF if it is already in 4NF and every non-trivial join dependency is implied by the candidate keys. The motivation is redundancy in many-to-many-to-many relationships, illustrated with a Supplier-Part-Project table. The core worked example decomposes the three-column relation into three binary relations (SP, SJ, PJ) and then joins them back losslessly to reconstruct the original table. This decomposition-join cycle demonstrates that the join dependency is non-trivial and not implied by candidate keys, hence violating 5NF. The final comparison table distinguishes 4NF (governed by multivalued dependencies) from 5NF (governed by join dependencies, also called Project-Join Normal Form), clarifying that 5NF eliminates the last class of redundancy tied to complex multi-way relationships.

