Computer Architecture Revision Questions
Computer Architecture Revision Questions
• a) Store data
• b) Process data
• c) Input data
• d) Output data
• a) Mainframe
• b) Supercomputer
• c) Microcontroller
• d) Microwave
• a) Transistors
• b) Vacuum tubes
• c) Microprocessors
• d) Integrated circuits
• a) RAM
• b) CPU
• c) Hard drive
• d) Motherboard
5. What does RAM stand for?
• a) First
• b) Second
• c) Third
• d) Fourth
7. Which part of the computer is responsible for arithmetic and logic operations?
• a) ALU
• b) CU
• c) RAM
• d) ROM
• a) Secondary storage
• b) Auxiliary storage
• c) Primary storage
• d) External storage
• a) To perform calculations
• b) To store data
5. Describe the evolution of the computer from the first generation to the fourth
generation.
Structural Questions
2. Explain the differences between first, second, third, and fourth generation
computers.
3. Illustrate the function of the ALU and control unit within the CPU.
1. Given a brief history of computer architecture, identify and analyze the main
technological advancements that led to the development of modern computers.
• a) 1010
• b) 1001
• c) 1100
• d) 1011
• a) 1G
• b) 1A
• c) 1H
• d) 1P
• a) 9
• b) 10
• c) 11
• d) 12
• c) Store data
• d) Manage memory
5. Which logic gate outputs true only when both inputs are true?
• a) OR
• b) AND
• c) NOT
• d) XOR
• a) 1111
• b) 1010
• c) 1100
• d) 1001
• a) 89
• b) 77
• c) 1A
• d) 1G
8. What is the hexadecimal equivalent of the binary number 1101?
• a) B
• b) C
• c) D
• d) E
• a) A'
• b) A+
• c) A*
• d) A/
• a) AND
• b) OR
• c) NAND
• d) XOR
Structural Questions
1. Explain the differences between binary, octal, decimal, and hexadecimal number
systems.
3. Illustrate the truth tables for AND, OR, and NOT gates.
1. Given a series of binary numbers, convert them to their equivalent decimal, octal,
and hexadecimal representations and explain the process.
2. Design a simple digital circuit using basic logic gates to perform a specific logical
function and explain how it works.
• c) Storing data
• a) Store data
• b) Execute instructions
• a) MAR
• b) PC
• c) IR
• d) MDR
• a) Memory management
• b) Instruction execution
• a) Execution cycle
• b) Machine cycle
• c) Instruction cycle
• d) Fetch cycle
10. The component that decodes the instruction in the CPU is:
• a) ALU
• b) CU
• c) MAR
• d) MDR
Structural Questions
1. Given a set of instructions, simulate the instruction cycle and describe the role of
each CPU component at each stage.
2. Design a simplified CPU architecture, including the data path, control unit, and
main registers, and explain how it would execute a basic instruction.
• a) Immediate
• b) Direct
• c) Indirect
• d) Fast
• a) A set of instructions
• b) A set of registers
• a) Complex instructions
• b) Simple instructions
• c) More instructions
• d) Fewer registers
• a) Operand code
• b) Operation code
• c) Address code
• d) Data code
5. Which addressing mode uses the value directly specified in the instruction?
• a) Direct
• b) Indirect
• c) Immediate
• d) Register
• b) Transfer data
• c) Control flow
• d) Manage memory
• a) ADD
• b) MOV
• c) JMP
• d) CMP
1. Define opcode.
Structural Questions
• d) Memory operations
• a) Addition
• b) Subtraction
• c) Multiplication
• d) Data storage
• a) Memory
• b) Register
• c) ALU itself
• d) Control unit
• b) Arithmetic operations
• d) Control operations
• a) AND
• b) ADD
• c) SUB
• d) MUL
• a) Control unit
• b) Memory
• c) Data path
• d) Register file
• a) Store instructions
• a) Shift operations
• b) Logical NOT
• c) Program execution
• a) Instructions
• b) Data
• c) Addresses
• d) Flags
Structural Questions
1. Describe the design and function of the ALU within a CPU.
2. Explain the difference between arithmetic and logic operations performed by the
ALU.
3. Illustrate how the ALU performs an addition operation using binary numbers.
4. Discuss the significance of the status register and its role in the ALU.
1. Given a set of binary numbers, simulate the addition and subtraction operations
performed by the ALU and explain each step.
2. Design a basic ALU that can perform addition, subtraction, and basic logic
operations (AND, OR, NOT), and describe how it handles carry and overflow.
• a) RAM
• b) ROM
• c) Cache
• d) Hard drive
• d) Backup data
3. What is the memory hierarchy from fastest to slowest?
4. Which cache mapping technique uses a fixed position in cache for each block of
memory?
• a) Direct mapping
• b) Associative mapping
• c) Set-associative mapping
• d) Random mapping
• a) RAM
• b) ROM
• c) Hard drive
• d) DVD
• a) Reduced cost
• c) Simplified design
• a) RAM
• b) Cache
• c) ROM
• d) Register
Structural Questions
4. Discuss the concept of hit ratio and its impact on cache performance.
5. Outline the differences between volatile and non-volatile memory with examples.
1. Given a set of memory addresses, demonstrate how they are mapped in a direct-
mapped cache and calculate the hit ratio.
Week 7: Pipelining
• a) Data hazard
• b) Control hazard
• c) Structural hazard
• a) Data conflicts
• b) Branch hazards
• c) Memory hazards
• d) Instruction hazards
• a) Pipelining
• b) Branch prediction
• c) Forwarding
• d) Caching
1. Define pipelining.
Structural Questions
3. Illustrate how a data hazard can occur in a pipeline and how it can be resolved.
4. Discuss the concept of branch prediction and its role in minimizing control
hazards.
5. Outline the impact of pipeline stalls on CPU performance and how they can be
mitigated.
• a) Polling
• b) Interrupt-driven I/O
• a) Keyboard
• b) Monitor
• c) Printer
• d) Speaker
8. Which type of I/O operation allows the CPU to execute other instructions while
waiting for I/O operations to complete?
• a) Synchronous I/O
• b) Asynchronous I/O
• c) Direct I/O
• d) Indirect I/O
2. What is an interrupt?
Structural Questions
1. Describe the different I/O techniques and their advantages and disadvantages.
2. Given a scenario with multiple I/O devices, propose a method to optimize data
transfer and minimize CPU load, considering different I/O techniques.
• c) Increased cost
• d) Simplified programming
5. Which type of parallelism involves dividing a task into smaller subtasks that are
processed simultaneously?
• a) Data parallelism
• b) Task parallelism
• c) Memory parallelism
• d) Instruction parallelism
• b) Shared memory
• a) Data synchronization
• c) Complex programming
1. Define SIMD.
2. What is MIMD?
Structural Questions
3. Illustrate how data parallelism and task parallelism are implemented in parallel
processing.
• a) General-purpose computing
• b) Graphics processing
• c) Memory management
• d) Data storage
• b) Qubits
• c) Analog signals
• d) Digital signals
• a) RISC
• b) CISC
• c) VLIW
• d) SIMD
10. Which type of computing architecture is expected to solve problems that are
currently unsolvable by classical computers?
• a) RISC
• b) CISC
• c) VLIW
• d) Quantum computing
1. Define RISC.
2. What is CISC?
Structural Questions
4. Discuss the principles of quantum computing and its potential impact on future
technologies.
• a) Clock speed
• b) Instruction throughput
• c) Latency
• b) A type of processor
• a) Cache size
• b) Clock speed
• c) Instruction set
• d) All of the above
• a) Speedup
• b) Latency
• c) Clock speed
1. Define benchmarking.
2. Explain the principles of Amdahl's Law and its implications for parallel
processing.
4. Discuss the factors that influence processor performance and how they can be
optimized.
2. Using Amdahl's Law, analyze the potential performance improvement for a task
with different levels of parallelization, and propose strategies to maximize
efficiency.
• a) ALU
• b) Control unit
• c) Registers
• c) To execute instructions
• c) Store data
• d) Manage memory
• a) Classical bits
• b) Qubits
• c) Analog signals
• d) Digital signals
4. What is an interrupt?
5. Describe SIMD.
7. Define throughput.
Structural Questions
5. Outline the principles of Amdahl's Law and its implications for parallel processing.