Boolean Algebra Laws

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/part-d-cs-it/dig-sys-boolean-basics/digital-fundamentals-boolean-algebra/asset-boolean-algebra-laws after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, 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, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Boolean Algebra Laws on a whiteboard, progressing from basic identities to De-Morgan's laws and set-theoretic interpretations. The instructor writes equations in maroon ink, beginning with the Idempotent Law (a.a = a and a+a = a), then Associative, Commutative, and Distributive laws. Set-form equivalents (A∩A=A, A∪A=A) are shown alongside algebraic forms. De-Morgan's laws (a+b̄ = ā·b̄ and ā.b̄ = ā + b̄) are introduced with a two-circle Venn diagram. The final section covers Identity, Complementation, and Involation laws with equations like a·1 = a and a+0 = a.

Chapters

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

    The whiteboard header reads 'Boolean Algebra Laws' with a left-side list: Idempotent Law, Associative law, Commutative law, Distributive law. The instructor writes in maroon ink the equation 'a² = a x a' near the right side, followed by 'a⁰ = 1' and the rule 'a² = a a'. New handwritten lines appear reading '1² = 1' and a second line beginning with '1', establishing basic exponent rules before moving to Boolean identities.

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

    The instructor presents the Idempotent Law with formulas 'a.a = a' and 'a+a = a', alongside set-form equivalents 'A∩A=A' and 'A U A = A' to the right of a vertical divider. He then works in the Associative law row, writing '(a.b).c = a.(b.c)' and below it '(a+b)+c = a+(b+c)'. A far-right column lists operator symbols including '+', '0', and union/empty-set marks, providing a reference for notation used throughout the lecture.

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

    The board shows the Associative law section with '(a.b)c = a(b.c)' and '(a+b)+c = a+(b+c)', plus 'A∩B∩C = A∩(B∩C)' being written. Horizontal lines separate each law block as the instructor fills in 'a.b = b.a' and 'a+b = b+a' under Commutative law. The Distributive law appears as 'a.(b+c) = a.b + a.c'. The instructor then writes De-Morgan law by hand: 'a+b̄ = ā·b̄' and completes the second line as 'ā.b̄ = ā + b̄', adding a hand-drawn two-circle Venn diagram labeled 1, 2, 3 with region 4 outside to illustrate set relationships.

  4. 10:00 – 12:02 10:00-12:02

    The board displays De-Morgan's law, Identity law, Complementation law, and Involation law. The instructor writes specific equations for each: 'a . 1 = a' and 'a + 0 = a' under Identity law. A Venn diagram with sets A and B is visible on the right, used to illustrate set operations corresponding to Boolean algebra identities. The lecture concludes with these additional laws completing the overview of fundamental Boolean Algebra properties.

The lecture systematically builds Boolean Algebra knowledge from simple exponent rules to complex identities. The teaching flow moves through four core laws (Idempotent, Associative, Commutative, Distributive) before introducing De-Morgan's laws and supplementary identities. Each algebraic law is paired with its set-theoretic equivalent, reinforcing the connection between Boolean algebra and set theory. The Venn diagram serves as a visual anchor for understanding how operations like intersection, union, and complementation map to AND, OR, and NOT. The notation column on the right provides a consistent reference for symbols used throughout.

Loading lesson…