Implementing 1x2 Decoder

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/digital-electronics/combinational-circuit/demux-decoder-encoder/asset-implementing-1x2-decoder 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 educational video features instructor Sanchit Jain explaining the digital logic concept of a 1-to-2 Decoder. The lecture begins by defining the decoder through a block diagram, truth table, and logic circuit. The instructor then demonstrates the functional equivalence between a decoder and a demultiplexer (Demux). By drawing parallel circuit diagrams and comparing their inputs and outputs, he illustrates that a decoder can effectively function as a demultiplexer when the enable line is treated as a select line. The session emphasizes the structural similarities between these two fundamental digital components.

Chapters

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

    The instructor introduces the topic with the on-screen text "1-to-2 Decoder". He starts by drawing a rectangular block diagram on the whiteboard. He labels the input on the left as 'I' and the enable input at the bottom as 'E'. On the right side, he labels the two outputs as 'Q0' and 'Q1'. Inside the block, he writes "Decoder 1x2". Next, he draws a truth table to the right of the block. He creates columns for 'I', 'Q0', and 'Q1'. He fills the first row with I=0, Q0=0, and Q1=1. He fills the second row with I=1, Q0=1, and Q1=0. Following the truth table, he draws the logic circuit implementation. He draws two AND gates. He connects the input 'I' to both AND gates. He connects the enable input 'E' directly to the bottom AND gate. He connects 'E' to the top AND gate through a NOT gate (inverter). This circuit configuration shows how the input is routed based on the enable signal.

  2. 2:00 – 4:17 02:00-04:17

    The instructor shifts focus to comparing the decoder with a Demultiplexer. He draws a block labeled "Demux 1x2" on the left with inputs 'I' and 'S0'. To its right, he draws the "Decoder" block again with inputs 'I' and 'E'. He draws the logic circuit for the Demux below the Demux block, showing two AND gates where the top gate takes 'I' and 'NOT S0', and the bottom gate takes 'I' and 'S0'. He then draws the logic circuit for the Decoder below the Decoder block, which is identical: top gate takes 'I' and 'NOT E', bottom gate takes 'I' and 'E'. He draws a large arrow pointing from the Demux block to the Decoder block, indicating equivalence. He circles the input 'I' in both blocks and circles 'S0' in the Demux and 'E' in the Decoder, writing 'F' next to them to show they serve the same function. He concludes that the decoder is essentially a demultiplexer.

The video provides a clear derivation of a 1-to-2 decoder, starting from its block representation and truth table to its gate-level implementation. The core learning point is the realization that a decoder and a demultiplexer are structurally identical. By mapping the decoder's enable input to the demultiplexer's select input, the instructor proves that decoders can be used as demultiplexers. This insight is crucial for understanding how digital logic blocks can be repurposed or viewed from different functional perspectives.

Loading lesson…