Practice Question-2

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/computer-system-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 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.

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…