Decoder_Practice_Question

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/digital-logic/combinational-circuit/demux-decoder-encoder/asset-decoder-practice-question 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.

The video lecture focuses on the digital logic design concept of expanding decoder capacity, specifically constructing a 6-to-64 decoder using smaller 2-to-4 decoders. The session begins with the problem statement "Q 6-to-64 from 2-to-4 ?" displayed on the whiteboard. The instructor starts by analyzing the requirements, writing the number "64" to represent the total output lines needed. He then breaks this down, writing "16" and "4" in circles, which correspond to the number of decoders needed at different stages of the hierarchy. He draws a vertical column of red dashes to visually count the components required. As the explanation progresses, he sketches a block diagram, drawing a large rectangle to represent the overall 6-to-64 decoder system. Inside and connected to this main block, he draws smaller rectangles representing the individual 2-to-4 decoder units. He illustrates the interconnections, showing how the outputs of the upper-level decoders enable the lower-level decoders. He writes "16 decoder" next to a circle containing "16", emphasizing the count of decoders in the first stage. Towards the end, he writes "21" in a circle, calculating the total number of 2-to-4 decoders needed. This total is derived from 16 decoders for the outputs, 4 decoders to select the first 16, and 1 decoder to select the 4, summing up to 21. The visual progression moves from text-based problem definition to numerical calculation and finally to a structural block diagram, providing a clear method for hierarchical circuit design. The instructor uses red ink for all drawings and calculations, making the steps distinct against the white background. He also writes "decoder" next to the number 16 to clarify the component type.

Chapters

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

    The video demonstrates the hierarchical design of a 6-to-64 decoder using 2-to-4 decoders. It begins with the problem statement "Q 6-to-64 from 2-to-4 ?" and the instructor circles "2-to-4". He calculates the number of decoders needed by writing "64", "16", and "4" in circles and drawing a vertical column of dashes. He sketches a block diagram with a large rectangle for the main system and smaller rectangles for the 2-to-4 decoders. He illustrates the interconnections and writes "16 decoder" next to a circle. Finally, he writes "21" in a circle, indicating the total number of decoders needed (16 + 4 + 1).

The video effectively demonstrates the step-by-step process of designing a larger decoder from smaller units, moving from problem statement to numerical analysis and finally to a structural block diagram representation. The instructor clearly shows how to break down a complex design problem into manageable sub-problems using standard logic gates.

Loading lesson…