Practice Question-2

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-organization-architecture/control-unit-design/hardwired-microprogrammed-cu/asset-practice-question-2-13077 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 presents a lecture on calculating the minimum number of bits required for a microprogram control unit using two different encoding schemes: horizontal and vertical. The problem is introduced with a table showing 10 mutually exclusive groups (G1 to G10) and the number of control signals in each group. The instructor first explains the horizontal encoding method, which requires one bit for each signal, leading to a total of 74 bits. He then explains the vertical encoding method, which uses a binary code to represent each group, requiring log2 of the maximum number of signals in any group. For the given data, the maximum is 14, so log2(14) is approximately 3.8, which rounds up to 4 bits. The total number of bits for vertical encoding is the sum of the bits for each group, calculated as 2+4+3+4+4+4+4+4+2+2, which equals 31 bits. The video concludes by comparing the two methods, showing that vertical encoding is more efficient.

Chapters

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

    The video begins by presenting a problem about a microprogram control unit with 10 mutually exclusive groups of control signals. A table is displayed showing the number of signals in each group: G1=3, G2=12, G3=7, G4=5, G5=11, G6=11, G7=11, G8=14, G9=3, G10=3. The instructor introduces the concept of control signals and the need to determine the minimum number of bits required for encoding them, setting up the problem for two different encoding schemes.

  2. 2:00 – 5:00 02:00-05:00

    The instructor explains the horizontal encoding method. He draws a diagram showing a control signal 'S' branching into 'horizontal' and 'vertical' paths. He defines horizontal encoding as requiring one bit for each control signal. He then calculates the total number of bits for horizontal encoding by summing the signals in all groups: 3+12+7+5+11+11+11+14+3+3, which equals 74 bits. He writes the formula 'horizontal = 74 bits' on the board.

  3. 5:00 – 8:06 05:00-08:06

    The instructor explains the vertical encoding method. He writes the formula 'vertical = log2(14) = 4 bits' for the number of bits needed to represent the largest group (G8 with 14 signals). He then calculates the total number of bits for vertical encoding by summing the bits for each group: log2(3) + log2(12) + log2(7) + log2(5) + log2(11) + log2(11) + log2(11) + log2(14) + log2(3) + log2(3). He approximates these values as 2+4+3+4+4+4+4+4+2+2, which sums to 31 bits. He concludes that vertical encoding is more efficient than horizontal encoding.

The video systematically compares two encoding methods for a microprogram control unit. It starts by defining the problem with a table of control signals. It then demonstrates the horizontal encoding method, which requires a bit for every signal, resulting in a total of 74 bits. Next, it explains the vertical encoding method, which uses a binary code to represent each group, requiring log2 of the maximum signals in a group. The total for vertical encoding is calculated by summing the bits for each group, resulting in 31 bits. The synthesis shows that vertical encoding is significantly more efficient, requiring only 31 bits compared to 74 bits for horizontal encoding.

Loading lesson…