CS-404 Computer Organization & Architecture - Nov 2023 Question Paper

Under each question, How to answer lists the points an answer should cover, outlined by CampusPrep from the syllabus. Check the details against your textbook.

1. 7 Marks
   aDraw and explain the architecture of a computer system.
   How to answer

   • Block diagram of computer system with CPU, memory, I/O
   • Function of each unit: ALU, CU, registers, buses
   • Data flow between units
2. 7 Marks
   bExplain the addressing modes with suitable examples.
   How to answer

   • Definition of addressing mode
   • List types: immediate, direct, indirect, register, etc.
   • Example for each mode
   • Effective address calculation
3. 7 Marks
   aDiscuss the Booth's algorithm for multiplication of signed numbers.
   How to answer

   • Need for Booth's algorithm for signed numbers
   • Recoding rule based on Q0, Q-1 bits
   • Steps: add/subtract, arithmetic shift
   • Example flow
4. 7 Marks
   bWhat do you understand by direct memory access? Explain with block diagram how DMA operation is carried out.
   How to answer

   • Definition of DMA and need to bypass CPU
   • Block diagram: DMA controller, CPU, memory, I/O
   • DMA transfer steps: request, grant, transfer, interrupt
   • Cycle stealing / burst modes
5. 7 Marks
   aExplain the concept of pipelining.
   How to answer

   • Definition of pipelining
   • Stages: fetch, decode, execute etc.
   • Speedup and throughput improvement
   • Diagram of pipeline stages
6. 7 Marks
   bDifferentiate between vectored and non-vectored interrupts.
   How to answer

   • Definition of vectored interrupt
   • Definition of non-vectored interrupt
   • Differences in address handling, response time
   • Examples
7. 7 Marks
   aExplain the instruction formats for computer system.
   How to answer

   • Structure: opcode plus address fields
   • Zero, one, two, three address formats
   • Example instruction for each
   • Advantages/trade-offs
8. 7 Marks
   bList the differences between volatile and non-volatile memories?
   How to answer

   • Definition of volatile vs non-volatile
   • Examples: RAM vs ROM/flash
   • Comparison on retention, speed, use
   • Tabular differences
9. 7 Marks
   aDiscuss memory hierarchy in computer system.
   How to answer

   • Levels: registers, cache, main, secondary
   • Pyramid with speed, cost, capacity trade-off
   • Locality principle
   • Diagram of hierarchy
10. 7 Marks
    bExplain the mapping techniques in cache memory.
    How to answer

    • Direct mapping formula and example
    • Associative mapping operation
    • Set-associative mapping
    • Comparison of hit rate, complexity
11. 7 Marks
    aExplain the following terms: i) Cache hit and Cache miss ii) Cache coherency
    How to answer

    • Definition of cache hit vs miss and hit ratio
    • Causes of misses
    • Definition of cache coherency problem
    • Solutions: snooping, directory protocols
12. 7 Marks
    bWrite short notes on the USB interface.
    How to answer

    • USB features and purpose
    • Architecture, host, hubs, endpoints
    • Transfer types and speeds
    • Applications
13. 7 Marks
    aExplain the following: a) RISC Vs CISC
    How to answer

    • RISC characteristics: simple, fixed instructions
    • CISC characteristics: complex, variable instructions
    • Tabular comparison on performance, design
    • Examples
14. 7 Marks
    bMicro-program sequencer
    How to answer

    • Role of micro-program sequencer in control unit
    • Block components: control memory, next-address logic
    • Working steps
    • Diagram
15. 7 Marks
    aWhat is memory organization? Discuss the different types of memory organization in computer system.
    How to answer

    • Definition of memory organization
    • Types: main, cache, virtual, associative
    • Organization structure and access
    • Role in performance
16. 7 Marks
    bExplain the PCI, BUS and LRU algorithm in briefly.
    How to answer

    • PCI bus features and architecture
    • BUS concept and types
    • LRU page replacement algorithm steps
    • Example of LRU