Study Material

Bihar STET Computer Science Computer Organization Notes & MCQs 2026

Read the important current affairs of 15 July 2026 for SSC, Banking, UPSC, Railway and all competitive exams.

18 Aug 2026 5 Min Read Quizer Team 188 Views

18

August 2026

High-Yield Revision Notes (Quick Theory)

1. Computer System Hardware Architecture

Modern computers Von Neumann Architecture par kaam karte hain jisme Program Instructions aur Data dono same memory space me store hote hain.

  • Central Processing Unit (CPU):

    • ALU (Arithmetic Logic Unit): Mathematical (+, -, *) aur Logical (AND, OR, NOT) operations execute karta hai.

    • Control Unit (CU): System ke sare hardware component signals ko coordinate aur control karta hai.

    • Special CPU Registers:

      • Program Counter (PC): Next execute hone wale instruction ka address hold karta hai.

      • Instruction Register (IR): Memory se fetch kiye gaye current instruction ko hold karta hai.

      • MAR (Memory Address Register): Memory access hone wale location ka physical address hold karta hai.

      • MDR / MBR (Memory Data/Buffer Register): Memory se read ya write kiye ja rahe data ko holding area me rakhta hai.

      • Accumulator (AC): ALU ke immediate calculation results ko hold karta hai.

  • System Buses:

    • Address Bus: Unidirectional (CPU $\rightarrow$ Memory/IO). Address width ($N$ bits) se memory size define hota hai ($2^N$).

    • Data Bus: Bidirectional (CPU $\leftrightarrow$ Memory/IO). Data transfer karta hai.

    • Control Bus: Control signals transfer karta hai (Read, Write, Interrupt, Clock).

2. Instruction Cycle & Pipelining

  • Instruction Cycle Flow: Fetch $\rightarrow$ Decode $\rightarrow$ Read Effective Address $\rightarrow$ Execute $\rightarrow$ Write Back / Store Result.

  • Instruction Pipelining: Multiple instructions ki processing stages ko overlap karke execution speed badhane ki technique.

    • Ideal speedup of $k$-stage pipeline = $k$ times.

    • Hazards (Performance Bottlenecks):

      • Structural Hazard: Jab 2 instructions ko same hardware resource simultaneously chahiye hota hai.

      • Data Hazard: Dependency issue (e.g., RAW - Read After Write).

      • Control/Branch Hazard: Branching or conditional jump instructions ke karan hone wale stalls.

3. Control Unit: Hardwired vs Microprogrammed

FeatureHardwired Control UnitMicroprogrammed Control Unit
ImplementationFixed Logic Gates, Flip-Flops, Decoders.Microinstructions in Control Memory (ROM).
SpeedExtremely Fast (Direct Circuit Propagation).Slower (Control memory lookup required).
FlexibilityDifficult to modify/redesign.Easily upgradable by updating microcode.
ArchitecturePreferred in RISC architectures.Preferred in CISC architectures.

4. Memory Hierarchy & Cache Mapping

  • Hierarchy: Registers $>$ Cache (SRAM) $>$ Main Memory (DRAM) $>$ Secondary Storage (SSD/HDD).

  • Cache Mapping Techniques:

    1. Direct Mapping: Har Main Memory block strictly ek particular Cache Line me hi map ho sakta hai. ($\text{Line} = \text{Block} \bmod \text{Total Lines}$). High conflict miss rate.

    2. Fully Associative Mapping: Block Cache ke kisi bhi free line me store ho sakta hai. No conflict misses; costly hardware logic needed.

    3. Set-Associative Mapping: Cache sets me divided hota hai. Block assigned set ke kisi bhi line me map ho sakta hai. ($\text{Set} = \text{Block} \bmod \text{Total Sets}$).

5. Input/Output (I/O) Transfer Modes

  1. Programmed I/O: CPU continuously I/O device ka status check (polling) karta hai. High CPU idle time.

  2. Interrupt-Driven I/O: Device ready hone par CPU ko hardware interrupt bhejta hai. CPU context switch karke Interrupt Service Routine (ISR) execute karta hai.

  3. Direct Memory Access (DMA): Dedicated DMA controller without CPU intervention memory aur I/O ke beech direct high-speed data transfer karta hai.

    • Burst Mode: Pure data block ko ek saath bina bus release kiye transfer karta hai.

    • Cycle Stealing Mode: Single word/byte transfer ke liye ek clock cycle steal karta hai.

Part 2: Top 30 Important MCQs (With Solutions)

  1. CPU ka kaun sa register next execute hone wale instruction ka address hold karta hai?

    • Answer: Program Counter (PC)

  2. System bus me kaun sa bus strictly Unidirectional hota hai?

    • Answer: Address Bus

  3. In a 16-bit address bus, total kitne memory locations ko directly address kiya ja sakta hai?

    • Answer: $2^{16} = 65,536$ locations ($64\text{ KB}$)

  4. Zero-Address Instruction format me operations kis data structure ka use karke perform kiye jate hain?

    • Answer: Stack (PUSH aur POP operations)

  5. Direct Cache Mapping me Memory Block $13$ total $4$ Cache Lines me kis line index par map hoga?

    • Answer: Line $1$ ($13 \bmod 4 = 1$)

  6. Cache Hit ka matlab kya hota hai?

    • Answer: Jab CPU dwara requested data direct Cache memory me mil jaye.

  7. SRAM (Static RAM) aur DRAM (Dynamic RAM) me mukhya antar kya hai?

    • Answer: SRAM Flip-Flops se banta hai aur fast hota hai, jabki DRAM Capacitors se banta hai aur periodic refresh ki zaroorat hoti hai.

  8. Booth's Algorithm kis operation ke hardware implementation ke liye use hota hai?

    • Answer: Signed Binary Multiplication (2's complement representation)

  9. RISC (Reduced Instruction Set Computer) ki sabse mukhya visheshata kya hai?

    • Answer: Simple, fixed-length instructions aur Memory access strictly LOAD aur STORE se hota hai.

  10. Hardwired Control Unit ki sabse badi khubi kya hai?

    • Answer: High Execution Speed (bina kisi microcode lookup latency ke).

  11. DMA transfer me jab controller continuously pure data block ko bina bus release kiye send karta hai, use kya kehte hain?

    • Answer: Burst Mode (ya Block Transfer Mode)

  12. RAW (Read-After-Write) Hazard ko aur kis naam se jana jata hai?

    • Answer: True Data Dependency

  13. Interrupt Service Routine (ISR) ka initial starting address kahan se milta hai?

    • Answer: Interrupt Vector Table (IVT)

  14. Write-Through Cache Policy me update kaise hota hai?

    • Answer: Data Cache aur Main Memory dono me simultaneously write/update hota hai.

  15. Write-Back Policy me Main Memory kab update hota hai?

    • Answer: Jab modified cache line ko overwrite/replace (evict) kiya jata hai.

  16. Stack-based execution architecture me operand explicit specifications ki zaroorat kyun nahi hoti?

    • Answer: Kyunki Top of Stack (TOS) implicit operand hota hai.

  17. Which microinstruction format doesn't require decoders and offers maximum speed?

    • Answer: Horizontal Microinstruction (unencoded control signals)

  18. Pipeline me Branch / Jump Instructions ke karan hone wale delays ko kya kehte hain?

    • Answer: Control Hazards (ya Branch Hazards)

  19. CPU dwara Arithmetic result me Overflow detect karne ke liye kis flag register ka use hota hai?

    • Answer: Overflow Flag (OF)

  20. Interrupt jise CPU dwara disable ya ignore nahi kiya ja sakta, use kya kehte hain?

    • Answer: Non-Maskable Interrupt (NMI)

  21. Daisy Chaining method kis purpose ke liye use hoti hai?

    • Answer: Bus Arbitration (Priority-based Bus Allocation)

  22. 2's complement system me $-8$ ko 4-bit binary me kaise represent karenge?

    • Answer: 1000

  23. Data bus ki width CPU ki kis capacity ko determine karti hai?

    • Answer: Single cycle me transfer hone wale word length (8-bit, 32-bit, 64-bit) ko.

  24. Which Cache Mapping provides zero conflict miss?

    • Answer: Fully Associative Mapping

  25. Control Memory (ROM) me store hone wale individual sequence operations ko kya kehte hain?

    • Answer: Microprogram / Microinstructions

  26. Address Decoding circuit me $N$ input lines kitne output selection lines me decode hote hain?

    • Answer: $2^N$ selection lines

  27. Programmed I/O me CPU ka kaun sa sabse bada drawback hota hai?

    • Answer: CPU Polling Loop (busy waiting) me time waste hota hai.

  28. Accumulator (AC) register ka mukhya kaam kya hai?

    • Answer: ALU ke dwara kiye gaye intermediate results ko temporarily hold karna.

  29. 32-bit Address Bus wala System maximum kitni Main Memory address kar sakta hai?

    • Answer: $2^{32} \text{ bytes} = 4 \text{ GB}$

  30. Instructions ke Fetch, Decode aur Execute phases ko overlap karne ki technique ko kya kehte hain?

    • Answer: Instruction Pipelining

Why This Content Matters

This content is prepared to help students and competitive-exam aspirants understand important topics, revise key information, and strengthen their exam preparation.

  • Quickly revise important facts and concepts
  • Improve General Knowledge and exam awareness
  • Support preparation for competitive and government exams
  • Build a consistent and effective study routine
Quizer Team
About the Author

Quizer Team

The Quizer Team creates exam-focused educational content, current affairs, general knowledge, study notes, and preparation resources to help students and competitive-exam aspirants learn, practice, and stay updated.

Educational Content Exam Focused Learning Resources

Related Post

Study Material
30 Sep 2026 36
Read More
Study Material
30 Sep 2026 25
Read More
Study Material
30 Sep 2026 24
Read More