Demo: Third Normal Form

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-database-management-system/normalization-1nf-bcnf/third-normal-form-3nf/asset-demo-third-normal-form after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on Third Normal Form (3NF) within the context of database normalization. The instructor begins by establishing that a relational schema must first satisfy Second Normal Form (2NF) before it can be considered for 3NF. The core concept introduced is the prohibition of transitive dependencies, defined as a functional dependency where one non-prime attribute determines another non-prime attribute. The lecture utilizes the example relation R(A, B, C, D) with A as a candidate key to illustrate how dependencies can chain (A->B, B->C), creating transitive relationships that violate 3NF. The instructor visually demonstrates the decomposition process, splitting a single table into smaller relations to eliminate these transitive dependencies. The session concludes with a direct definition of 3NF using functional dependency notation, distinguishing between prime-to-non-prime and non-prime-to-non-prime dependencies.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture opens with the formal definition of Third Normal Form (3NF) for a relational schema R. On-screen text explicitly states that 'R should be in 2NF' as a prerequisite condition. The instructor underlines this requirement and emphasizes that the relation must not contain any transitive dependency to qualify for 3NF. The visual notes highlight 'THIRD NORMAL FORM' and list the conditions using checkmarks to indicate satisfied criteria. The instructor introduces the concept of transitive dependency as a functional dependency from one non-prime attribute to another, setting the stage for the detailed explanation that follows.

  2. 2:00 – 5:00 02:00-05:00

    The instructor elaborates on transitive dependency using the example relation R(A, B, C, D) where A is the candidate key. The visual content displays functional dependencies such as 'A -> B' and 'B -> C', illustrating a chain where non-prime attributes depend on each other rather than directly on the key. The instructor draws arrows to visualize this flow and groups attributes C and D together in a box to show the transitive relationship. The lecture then demonstrates decomposition, splitting the original table into two separate tables (A-B and B-C) to remove the transitive dependency. The final slide in this section reiterates that a relation must be in 2NF and contain no transitive dependencies to be in 3NF.

  3. 5:00 – 5:43 05:00-05:43

    The final segment presents the direct definition of 3NF using functional dependency notation. The instructor writes 'PP: P --> NP' and 'TD: NP --> NP' to categorize dependencies, where P stands for Prime and NP for Non-Prime. The on-screen text defines 3NF as a schema where every functional dependency from alpha to beta satisfies specific conditions. The instructor draws a general diagram of 'alpha -> beta' and underlines key terms to distinguish between prime attributes determining non-prime attributes versus the prohibited transitive dependencies. This section solidifies the theoretical framework by breaking down the definition into prime and non-prime attribute interactions.

The video systematically builds the concept of Third Normal Form by first establishing prerequisites and then defining violations. The progression moves from the high-level requirement of 2NF to the specific prohibition of transitive dependencies. The instructor uses a consistent example, R(A, B, C, D), to ground abstract definitions in concrete functional dependencies. Visual aids such as arrows and boxes are used extensively to map the flow of data dependency, making the abstract concept of transitivity tangible. The decomposition example serves as a practical application, showing how to restructure tables to achieve normalization. The final theoretical breakdown using prime and non-prime attribute notation provides a rigorous mathematical definition to complement the earlier conceptual explanation.

Loading lesson…