Implementing 2x1 Encoder
Duration: 4 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 provides a detailed explanation of digital logic encoders, starting with a basic 2-to-1 configuration and advancing to a more complex 4-to-2 setup. The instructor begins by displaying a block diagram labeled "Encoder 2x1" with inputs I1 and I0 and a single output. He then presents a truth table to define the logic. The table lists two rows: the first row shows inputs I1=0, I0=1 resulting in output O0=0, and the second row shows I1=1, I0=0 resulting in O0=1. The instructor uses a marker to circle the I1 column and the O0 column, visually demonstrating that the output O0 directly corresponds to the input I1 when the inputs are mutually exclusive. He further illustrates this by drawing a logic gate diagram on the right side of the whiteboard, labeling inputs I0 and I1 and showing the output connection. The instructor, identified as Sanchit Jain Sir, stands beside the board, guiding the viewer through the logical steps. The lecture then transitions to a 4-to-2 Encoder. A comprehensive truth table appears on the board with four inputs (I3, I2, I1, I0) and two outputs (O1, O0). The table details four valid states where exactly one input is high. The instructor points to the rows to explain how the binary code is generated. He then derives the Boolean expressions for the outputs. For O0, he writes the equation O0 = (I3 XOR I1) I2' I0'. For O1, he writes O1 = (I3 XOR I2) I1' I0'. Throughout this derivation, he circles specific columns in the truth table, such as I0, I1, I2, I3 and O0, O1, to correlate the input combinations with the output logic. This method highlights the process of translating truth table data into functional logic equations for encoder circuits.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the concept of a 2-to-1 encoder. He displays a truth table with inputs I1, I0 and output O0. The table shows that when I1=0, I0=1, the output is 0, and when I1=1, I0=0, the output is 1. He circles the I1 and O0 columns to show the direct relationship. He then draws a logic diagram on the right, labeling inputs I0, I1 and showing the output path. This section establishes the basic principle of encoding where multiple inputs are reduced to fewer output lines based on active input states. The box is labeled "Encoder 2x1".
2:00 – 3:54 02:00-03:54
The topic shifts to a 4-to-2 encoder. A truth table with inputs I3, I2, I1, I0 and outputs O1, O0 is shown. The instructor points to the rows to explain the encoding of four inputs into two bits. He derives the logic equations on the right side of the board. He writes O0 = (I3 XOR I1) I2' I0' and O1 = (I3 XOR I2) I1' I0'. He circles the relevant input columns (I0, I1, I2, I3) and output columns (O0, O1) to link the truth table values to the derived expressions. This part demonstrates the systematic derivation of Boolean functions for multi-bit encoders. The table rows correspond to inputs 0001, 0010, 0100, and 1000.
The video effectively bridges the gap between simple and complex encoder logic. It starts with the fundamental 2-to-1 case to establish the concept of input-to-output mapping. It then scales this up to a 4-to-2 encoder, showing how the logic becomes more intricate with more inputs. The instructor's use of truth tables and subsequent equation derivation provides a clear, step-by-step methodology for designing encoder circuits. The visual cues, such as circling columns and drawing diagrams, reinforce the connection between abstract logic tables and physical circuit implementation. This structured approach helps students understand the underlying principles of digital logic design.

