De Morgan's Law

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/digital-logic/dig-sys-boolean-basics/digital-fundamentals-boolean-algebra/asset-de-morgans-law after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. 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)
  13. 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, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This short lecture segment introduces De Morgan's Laws in propositional logic, using a digital whiteboard slide titled “De-Morgan's Laws.” The instructor presents the two core equivalences: ¬(P ∧ Q) ≡ (¬P ∨ ¬Q) and ¬(P ∨ Q) ≡ (¬P ∧ ¬Q), each supported by a four-row truth table with P and Q columns showing T/F combinations. Above the laws, an example sentence is given: “If I work hard but there are no vacancies, I won't get the job,” formalized as (P ∧ Q) ⇒ ¬R. The instructor then uses a pen/annotation tool to write out the negation of a conjunction, ¬(P ∧ Q), and transforms it into its equivalent form, ¬P ∨ ¬Q. Next, the negation of a disjunction, ¬(P ∨ Q), is written and transformed into ¬P ∧ ¬Q. The slide also includes a definition of logical equivalence: “Two sentences α and β are logically equivalent if they are true in the same set of models.” The teaching flow moves from stating the laws, to verifying them with truth tables, to demonstrating step-by-step transformations on the board, and finally connecting symbolic logic to Boolean algebra notation.

Chapters

  1. 0:00 – 1:37 00:00-01:37

    The slide displays “De-Morgan's Laws” with the two equivalences ¬(P ∧ Q) ≡ (¬P ∨ ¬Q) and ¬(P ∨ Q) ≡ (¬P ∧ ¬Q), each followed by a four-row truth table. An example sentence, “If I work hard but there are no vacancies, I won't get the job. (P ∧ Q) ⇒ ¬R,” appears above the laws. The instructor writes ¬(P ∧ Q), boxes it, and derives ¬P ∨ ¬Q; then writes ¬(P ∨ Q) and derives ¬P ∧ ¬Q. The definition “Two sentences α and β are logically equivalent if they are true in the same set of models” is also shown, linking the transformations to logical equivalence and Boolean algebra notation.

The central idea is that De Morgan's Laws provide equivalences between negated conjunctions/disjunctions and their dual forms. The instructor uses truth tables to verify these equivalences and then demonstrates the transformations step-by-step with handwritten annotations. The example sentence grounds the abstract logic in a real-world conditional statement, while the definition of logical equivalence clarifies that two formulas are equivalent when they share the same truth conditions across all models. The progression from printed laws to handwritten derivations helps students see both the formal rule and its practical application.

Loading lesson…