DEMux_practice_question

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/digital-logic/combinational-circuit/demux-decoder-encoder/asset-demux-practice-question after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: 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 Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video segment focuses on digital logic design, specifically demonstrating how to construct larger demultiplexers (DeMux) using smaller 1:2 DeMux units. The instructor addresses two specific problems written on the screen. First, he analyzes the requirement to implement a 1:4 DeMux. He draws a block diagram showing a hierarchical arrangement where one 1:2 DeMux feeds into two others. He derives a general formula for the number of 1:2 DeMuxes needed to build a 1:2^n DeMux, writing '2^n - 1' on the board. By substituting n=2 for the 1:4 DeMux, he calculates the result as 3. Next, he addresses the implementation of a 1:8 DeMux. He writes down powers of 2 (16, 32, 64) to establish context. He applies the formula '2^n - 1' for n=3, calculating '2^3 - 1 = 7'. He also briefly writes '2^4 - 1 = 15', likely for comparison or a 1:16 DeMux. The visual evidence includes handwritten formulas, block diagrams, and specific calculations on the whiteboard.

Chapters

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

    The instructor begins by addressing the first question on screen: 'Q 1 : 2 DeMux are required to implement 1 : 4 DeMux ?'. He uses a red marker to draw a block diagram illustrating the solution. The diagram shows a single 1:2 DeMux block at the input stage, which branches out to feed two subsequent 1:2 DeMux blocks. He explains the logic behind this structure. On the right side of the screen, he writes mathematical expressions to derive the answer. He writes '1:2^n' and then the formula '2^n - 1'. He calculates '2^2 - 1 = 3', circling the result to indicate that three 1:2 DeMuxes are required to build a 1:4 DeMux. He also writes 'n=2' to clarify the number of select lines.

  2. 2:00 – 2:22 02:00-02:22

    The instructor moves to the second question: 'Q 1 : 2 DeMux are required to implement 1 : 8 DeMux ?'. He writes a vertical list of numbers '16', '32', '64' on the board, likely referencing powers of 2 related to input/output lines. He then applies the previously established formula '2^n - 1' to this new problem. Since a 1:8 DeMux has 3 select lines (2^3 = 8), he writes '2^3 - 1 = 7' and circles it. He also writes '2^4 - 1 = 15' below it, possibly extending the concept to a 1:16 DeMux. The video concludes with these calculations visible on the board, reinforcing the formula for determining the number of smaller DeMux units needed.

The video provides a clear, step-by-step derivation of the formula 2^n - 1 for constructing larger DeMuxes from 1:2 units. By working through the 1:4 and 1:8 examples, the instructor demonstrates how to apply this formula to different input sizes, reinforcing the relationship between the number of select lines and the required hardware components.

Loading lesson…