First Normal Form
Duration: 5 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 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: 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
- Paper 2 | 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
- Paper 2 | Programming and 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 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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 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 | DataBase Management System/DBMS: 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 Database Recovery
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture, presented by Sanchit Jain Sir from Knowledge Gate Educator, provides a comprehensive explanation of First Normal Form (1NF) within the context of database normalization. The instructor begins by defining 1NF, stating that a relation is in 1NF if and only if every attribute in every cell contains a single atomic value. This definition explicitly rules out multivalued or composite attributes. The lecture then transitions to the "Other implications of first normal form," listing critical structural rules. These include the requirement that every row must be unique, meaning no two rows can have identical values for all attributes. Additionally, the instructor emphasizes that a primary key must exist, every column must have a unique name, and the physical order of rows and columns is irrelevant to the logical structure of the relation. The slide also mentions that a relation should not contain any multivalued or composite attributes.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the formal definition of First Normal Form (1NF) displayed on the slide. He reads the text: "A Relation table is said to be in first normal form iff each attribute in each cell have single value(atomic)." He explains that this means a Relation should not contain any multivalued or composite attributes. He then lists "Other implications of first normal form," such as the need for unique rows and a primary key. He writes "ER -> R.M <-> 1NF" on the whiteboard, illustrating the transformation from Entity-Relationship models to Relational Models that satisfy 1NF. He also draws a basic table structure to visualize the concept. The slide lists bullet points about row uniqueness and primary keys.
2:00 – 4:50 02:00-04:50
The instructor elaborates on the implications listed on the slide. He underlines "single value(atomic)" and "multivalued or composite attributes" to stress the atomicity requirement. He discusses row uniqueness, underlining "Every row should be unique" and explaining that no two rows can have the same values for all attributes. He draws a table with rows labeled R1 and R2 to demonstrate this. He also underlines "There must be a primary key" and "Every column should have a unique name," explaining their importance. Finally, he mentions that the order of rows and columns is irrelevant, reinforcing the set-theoretic nature of relations. He draws a grid to visualize the table structure and emphasizes that 1NF is a prerequisite for higher normal forms. The instructor uses a pen to underline key phrases on the screen.
The lecture effectively bridges the gap between theoretical database concepts and practical normalization rules. By defining 1NF through atomicity and listing specific structural implications like unique rows and primary keys, the instructor provides a clear checklist for students. The visual progression from the slide text to handwritten notes and diagrams helps reinforce the connection between Entity-Relationship modeling and the resulting relational schema in First Normal Form. The emphasis on atomic values ensures students understand the foundational requirement before moving to higher normal forms. The instructor's use of underlining and drawing helps highlight key terms and concepts for better retention. This structured approach ensures a solid understanding of database design principles.

