OR-AND (NOR-NOR Implementation)

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/digital-logic/boolean-expression/universal-realization/asset-or-and-nor-nor-implementation 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 educational video demonstrates the implementation of a Product of Sums (POS) boolean expression using NOR gates. The instructor, Sanchit Jain, begins by writing the expression `POS = (a+b)(c+d)` on a digital whiteboard. He then constructs the standard OR-AND logic circuit to represent this expression. The core of the lesson involves transforming this standard circuit into a NOR-NOR implementation by strategically adding inversion bubbles to the gate outputs and inputs, effectively converting the OR and AND gates into their NOR equivalents. This technique highlights the universality of NOR gates in digital logic design. The video serves as a practical guide for students studying digital electronics.

Chapters

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

    The instructor starts by writing the boolean expression `POS = (a+b)(c+d)` at the top of the whiteboard. He then draws the corresponding standard logic diagram, which consists of two OR gates in the first stage receiving inputs a, b, c, and d, followed by a single AND gate in the second stage. He explicitly labels the gates as "OR" and "AND". To begin the conversion process, he draws small circles, or bubbles, at the outputs of the OR gates and the inputs of the AND gate, explaining that these inversions are key to the transformation and allow the use of De Morgan's laws implicitly. The inputs are clearly marked as a, b, c, and d entering the respective OR gates.

  2. 2:00 – 2:55 02:00-02:55

    Continuing the demonstration, the instructor draws a second circuit diagram below the first one to show the final NOR-NOR implementation. He replaces the OR gates with NOR gates and the AND gate with a NOR gate, maintaining the same input connections. He labels the new gates as "NOR" to distinguish them from the previous stage. The final visual shows a direct comparison between the OR-AND structure and the equivalent NOR-NOR structure, confirming that the logic function remains unchanged despite the change in gate types, solidifying the concept of NOR-NOR implementation. The output of the final NOR gate represents the original POS function.

The lecture effectively bridges the gap between standard POS implementation and universal gate implementation. By visually mapping the OR-AND circuit to the NOR-NOR circuit, the instructor clarifies how adding bubbles allows for gate substitution. This method is crucial for students learning to optimize digital circuits using only one type of gate, ensuring they understand the underlying logic transformations required for such implementations. Specifically, the example `(a+b)(c+d)` is used to illustrate the general principle.

Loading lesson…