Practice Question-1

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/computer-organisation-architecture/control-unit-design/hardwired-microprogrammed-cu/asset-practice-question-1-13076 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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, Complexity Theory
  10. 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. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a step-by-step solution to a problem in computer architecture concerning a micro-programmed control unit. The instructor begins by analyzing the requirements: the system must support 256 instructions, 16 flag conditions, and generate 48 control signals. The first part of the solution calculates the number of bits required for each control word. This is done by determining the number of bits needed for the instruction address (log2(256) = 8 bits), the flag conditions (log2(16) = 4 bits), and the control signals (48 bits). The total is the sum of these: 8 + 4 + 48 = 60 bits. The second part calculates the total control memory size in bytes. The instructor multiplies the number of instructions (256) by the number of bits per control word (60) to get the total number of bits (15,360). This is then converted to bytes by dividing by 8, resulting in 1,920 bytes. The entire process is demonstrated on a whiteboard with clear, handwritten calculations.

Chapters

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

    The video starts with the instructor presenting a problem about a micro-programmed control unit. The on-screen text states the system must support 256 instructions, 16 flag conditions, and generate 48 control signals. The instructor begins to break down the problem, writing '256 instruction' and '16 flag' on the whiteboard. He then calculates the number of bits required for the instruction address, writing 'log2(16)' and 'log2(16) = 4' to determine that 4 bits are needed for the flag conditions. He also writes '48 control signal' to account for the control signals. The instructor is seen writing 'log2(16)' and 'log2(16) = 4' on the whiteboard, indicating the calculation for the flag conditions.

  2. 2:00 – 3:56 02:00-03:56

    The instructor continues the calculation for the first part of the problem. He writes 'log2(256)' and calculates it as 8, determining that 8 bits are needed for the instruction address. He then adds the bits for the instruction address (8), flag conditions (4), and control signals (48), writing '8 + 4 + 48 = 60 bits' to find the total bits per control word. For the second part, he calculates the total control memory size. He multiplies the number of instructions (256) by the bits per control word (60), writing '256 x 60 = 15,360 bits'. He then converts this to bytes by dividing by 8, writing '15,360 / 8 = 1,920 bytes'. The final answer for the control memory size is clearly written as 1,920 bytes.

The video provides a clear, methodical walkthrough of calculating the control memory requirements for a micro-programmed control unit. It demonstrates the fundamental principle that the size of the control memory is determined by the number of instructions and the size of each control word. The control word size is the sum of the bits needed to address the instruction, the bits to represent the flag conditions, and the bits for the control signals. The solution is broken down into two logical steps: first, calculating the bits per control word, and second, calculating the total memory size by multiplying the number of instructions by the bits per word and converting to bytes. This approach effectively teaches the core concepts of control memory design in computer architecture.

Loading lesson…