Boolean Algebra Laws

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/digital-electronics/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. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock 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…