Introduction of Codd's Rule
Duration: 12 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Paper-2 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Hardware Basics, Network Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Paper-2 | 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Paper-2 | 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, Run Time Environment
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces Codd's 12 Rules as the foundation for understanding relational database normalization from 1NF to BCNF. The instructor begins with a title slide, then explains that Codd's Rules, proposed by Dr. E. F. Codd, define the characteristics of a true Relational Database Management System (RDBMS). The session covers why these rules matter—providing standards, ensuring consistent data storage and access, and supporting data independence and integrity—using a diagram of an Application communicating with an RDBMS via SQL requests and data results, with Security and Data Management as supporting functions. The lecture then presents an overview table of Rules 0 through 12, highlighting the Foundation Rule (Rule 0) and Information Rule, before transitioning into Rule 0 with a diagram showing Students, Courses, and Enrollments tables accessed through SQL operations such as CREATE, SELECT, INSERT, and UPDATE.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title slide reading "Normalization (1NF - BCNF)" and the underlined subheading "Codd's 12 Rules." Around 65 seconds, the slide changes to "Introduction to Codd's Rules," listing that the rules were proposed by Dr. E. F. Codd and define the characteristics of a true RDBMS. A diagram shows a blue "Relational Database" cylinder connected to Students, Enrollments, and Courses tables with 1:M relationship markers, and callouts for "Row (record)" and "Column (attribute)."
2:00 – 5:00 02:00-05:00
The instructor continues the introduction, underlining key phrases such as "stored, accessed, updated, and managed" to emphasize how the relational model governs data handling. Examples of relational database systems—MySQL, PostgreSQL, and Oracle Database—are given. The slide then transitions to "Why Are Codd's Rules Important?" with bullets stating that the rules provide standards for a true RDBMS, ensure consistent data storage and access, and support data independence and integrity. A diagram places an "Application" box connected by "Request (SQL)" and "Result (Data)" arrows to an "RDBMS" cylinder, flanked by "Security" and "Data Management" boxes.
5:00 – 10:00 05:00-10:00
The importance slide is elaborated with red annotations: checkmarks on the Application box, arrows into the RDBMS, and a circle around "Database." The example line "Changing the physical storage of a student database should not require rewriting the application" illustrates data independence. The presentation then moves to an "Overview of Codd's Rules" table listing Rule No. 0 through 12, including names such as "Foundation Rule," "Information Rule," and "Non-Subversion Rule." A left bracket marks rules 0–6, and a handwritten "(Default)" note appears beside Rule 0.
10:00 – 11:54 10:00-11:54
The final segment focuses on Rule 0: Foundation Rule, displaying its definition and an example. A diagram connects Students, Courses, and Enrollments tables to an RDBMS cylinder, with SQL operations labeled CREATE, SELECT, INSERT, and UPDATE shown as the means by which all data access occurs. This sets up the subsequent detailed study of each rule in the normalization sequence.
The lecture establishes Codd's 12 Rules as the theoretical basis for relational database design and normalization. The central progression moves from identifying the rules and their originator, to explaining their practical importance through an application-RDBMS architecture diagram, to cataloging all twelve rules in an overview table, and finally beginning with Rule 0 (Foundation Rule). The recurring diagram of Students, Enrollments, and Courses tables serves as the concrete example throughout. Key takeaways for revision: Codd's Rules define what makes a system a true RDBMS; they ensure data independence so that physical storage changes do not force application rewrites; and all data access must occur through the relational model using SQL operations. The bracketing of rules 0–6 suggests a grouping that may be emphasized in later lectures.

