Scribd
Upload
294 views5 pages

Important Repeated Topics For Exams COA

The document outlines important topics and repeated questions for exam preparation in computer organization and architecture, covering areas such as basic concepts, number systems, instruction sets, memory organization, and data transfer methods. It includes sections for short answer, medium-length, and long-answer questions, as well as frequently asked numerical problems. The topics listed are emphasized as crucial for understanding and success in examinations.

Uploaded by

devikas6387
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
294 views5 pages

Important Repeated Topics For Exams COA

The document outlines important topics and repeated questions for exam preparation in computer organization and architecture, covering areas such as basic concepts, number systems, instruction sets, memory organization, and data transfer methods. It includes sections for short answer, medium-length, and long-answer questions, as well as frequently asked numerical problems. The topics listed are emphasized as crucial for understanding and success in examinations.

Uploaded by

devikas6387
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Important Repeated Topics for Exams:

Basic Concepts:
• Functional units of a digital computer
• Bus and memory transfer
• Clock cycles vs. Clock frequency
• Program counter and its role
Number Systems & Arithmetic Operations:
• 1’s and 2’s complement representation
• Binary multiplication using Booth’s algorithm
• Signed multiplication and division methods
• Arithmetic logic operations (Carry generation & propagation)
• Floating-point representation (IEEE standard)
Instruction Set & Addressing Modes:
• Types of instructions (Register reference, Memory reference, I/O
instructions)
• Addressing modes (Immediate, Direct, Indirect, Register, Relative,
Indexed)
• Stack organization and operations
Processor & Control Unit:
• RISC vs. CISC architecture
• General register organization
• Hardwired vs. Microprogrammed control unit
• Microprogramming sequencing
• Flynn’s Classification (SISD, SIMD, MISD, MIMD)
Memory Organization:
• Memory hierarchy (Cache, RAM, ROM)
• Cache memory (Direct mapping, Associative mapping, Set associative
mapping)
• Write-back vs. Write-through in cache memory
• SRAM vs. DRAM
• Virtual memory and Page replacement policies (FIFO, LRU)
Input/Output & Data Transfer:
• I/O interface and methods (Programmed I/O, Interrupt-initiated I/O,
DMA)
• DMA controller and bidirectional control lines
• Serial vs. Parallel communication
• Asynchronous data transfer
Logic Circuits & ALU:
• Logic gates and their applications
• Design of half-adder and full-adder
• 4-bit fast adder
• Arithmetic unit operations
• Register transfer logic (RTL)
Pipeline & Multiprocessing:
• Concept of pipelining (Arithmetic, Instruction pipelining)
• Types of pipelines
• Parallel processing and processor organizations
These topics have been asked multiple times in different years, so they are
highly important for exam preparation. Let me know if you need detailed
explanations or solutions for any of these topics!
Important Repeated Questions for Practice
SECTION A (Short Answer Questions - 2 Marks Each)
1. How does computer organization affect the performance of a computer?
2. Differentiate between clock cycles and clock frequency.
3. Define bus and memory transfer.
4. What is the role of the program counter (PC)?
5. Explain the concept of Register Transfer Logic (RTL).
6. Differentiate between RISC and CISC architectures.
7. What are the different types of memory hierarchy?
8. What do you mean by page replacement?
9. Define maskable and non-maskable interrupts.
10.Explain the difference between SRAM and DRAM.
11.What is a cache memory? Differentiate between Write-Back and Write-
Through methods.
12.What do you mean by serial communication?
13.What is an Arithmetic Logic Unit (ALU)?
14.Explain the difference between burst transfer and cycle stealing method
in DMA.
15.Define pipelining. What are the different types of pipelines?

SECTION B (Medium-Length Questions - 10 Marks Each)


16.Explain the different types of addressing modes with suitable examples.
17.Perform the multiplication of (-7) and (5) using Booth’s Algorithm and
verify the result.
18.Describe the function of the Control Unit in general register organization
with a block diagram.
19.Explain the concept of 2D and 2½D memory organizations.
20.Compare different types of processor organizations.
21.Describe the concept of microprogrammed control unit and hardwired
control unit.
22.Explain various modes of data transfer in computer systems.
23.Describe FIFO and LRU page replacement policies with an example.
24.Explain the function of the DMA controller with a block diagram.
25.Discuss various I/O interfacing techniques such as Programmed I/O and
Interrupt Initiated I/O.

SECTION C (Long-Answer & Application-Based Questions - 10 Marks Each)


26.Design a 4-bit arithmetic unit and explain the various operations
performed by it.
27.Compare horizontal microprogramming and vertical microprogramming.
28.Implement a BUS system with 4 lines using a multiplexer.
29.What do you mean by pipeline processing? Discuss an arithmetic
pipeline with an example.
30.Evaluate the arithmetic expression X = (A + B) * (C + D) using:
• Three-address instruction format
• Two-address instruction format
• One-address instruction format
• Zero-address instruction format (Stack-based)
31.Explain the Booth’s multiplication algorithm in depth with a flowchart
and example.
32.Explain different types of computer instructions with examples.
33.What is memory hierarchy? Discuss it in detail with examples.
34.Explain the process of instruction execution in multiple-bus organization.
35.Explain the modes of transfer and discuss Programmed I/O, Interrupt-
Initiated I/O, and DMA.

Frequently Asked Numerical Problems


36.Represent -14 using 2’s complement method.
37.Solve (43)x = (y3)8 for unknown values of x and y.
38.Perform the division of 00001111 by 0011 using the division restore
method.
39.If a processor has 40 instructions and 24 registers, determine the
number of bits available for the immediate operand in a 32-bit
instruction format.
40.Consider a cache memory with 128 blocks divided into 4 block sets. If
the main memory has 16,384 blocks, calculate the number of bits
required for:
• Main memory address
• TAG, SET, and WORD fields

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy