Priority 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 lecture introduces the Priority Encoder, a digital circuit designed to handle situations where multiple inputs are active simultaneously, a condition that renders standard encoders ineffective. The instructor explains that a priority encoder incorporates a priority function, ensuring that if two or more inputs are high, the input with the highest priority takes precedence. He illustrates this concept by drawing a block diagram with n inputs and binary outputs, emphasizing the need for a circuit that can resolve conflicts between active signals. The text on the screen explicitly states, "In some practical cases more than one input can be high at a time, there we can not use simple encoder." He further clarifies that the operation is such that "the input having the highest priority will take precedence." In the second segment, the instructor details the operation of a 4-to-2 priority encoder using a comprehensive truth table. He establishes the priority order as I3 > I2 > I1 > I0. He systematically fills the truth table, assigning 'd' (don't care) to lower-priority inputs when a higher-priority input is active. For instance, if I3 is 1, the outputs correspond to binary 3, regardless of other inputs. He then derives the Boolean expressions for the outputs O1 and O0 based on the populated truth table, writing O0 = I3 + I3'I2'I1 and O1 = I3 + I3'I2 on the board. This process demonstrates how to simplify logic for priority-based encoding. The instructor points to specific rows in the table to justify the 'd' values, showing that lower inputs are irrelevant when a higher one is asserted. He specifically writes the equation for O0 first, noting that it is high when I3 is high or when I3 and I2 are low but I1 is high. Similarly, O1 is high when I3 is high or when I3 is low and I2 is high. This detailed derivation provides a clear method for designing priority encoder logic circuits. The table shows rows for inputs 0001, 001d, 01dd, and 1ddd, mapping to outputs 00, 01, 10, and 11 respectively.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the concept of a Priority Encoder, explaining that simple encoders fail when multiple inputs are high simultaneously. He draws a block diagram with n inputs and binary outputs to visualize the circuit. The on-screen text highlights that in practical cases, more than one input can be high, necessitating a circuit with a priority function where the highest priority input takes precedence.
2:00 – 4:16 02:00-04:16
The instructor constructs a truth table for a 4-to-2 priority encoder with inputs I3, I2, I1, I0 and outputs O1, O0. He fills the table based on the priority order I3 > I2 > I1 > I0, using 'd' for don't care conditions. He derives the Boolean expressions O0 = I3 + I3'I2'I1 and O1 = I3 + I3'I2, pointing to specific rows to justify the logic and don't care assignments.
The video progresses from defining the problem of multiple active inputs to the solution of a priority encoder, and finally to the implementation via a truth table and Boolean equations. The instructor systematically builds the logic, showing how higher priority inputs override lower ones, which is essential for understanding digital system design where signal conflicts must be resolved deterministically.

