COMPUTER ORGANIZATION AND
ARCHITECTURE EXAM QUESTIONS
WITH VERIFIED ANSWERS. A+ GRADE
2025/2026.
Computer Components - ANS Motherboard, Hard Drive (HDD), Random Access Memory
(RAM), Processor, PCI Cards
Central Processing Unit (CPU) - ANS The computer component responsible for fetching
instructions, decoding them, and performing the indicated sequence of operations on the
correct data. The CPU consists of:
Arithmetic Logic Unit
Registers
Control unit.
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED
, Arithmetic Logic Unit (ALU) - ANS The combinational circuit responsible for performing the
arithmetic and logic functions in a CPU.
Scheduling Algorithms - ANS Definition: Pre-emptive - Scheduler may pre-empt a processor
before it is blocked or terminated
Algorithms:
First Come First served
Jobs processed in order they are received
Favours CPU bound processes
I/O bound process execute briefly then are blocked for I/O
Queue builds up of I/O Bound processes
Algorithms - Shortest Job First - ANS Can starve long jobs of CPU time
In case of a tie FCFS used
Algorithms - Shortest Time Remaining - ANS Pre-emptive
New job arrives -> expected process time compared with that of currently Running Process.
2 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED
ARCHITECTURE EXAM QUESTIONS
WITH VERIFIED ANSWERS. A+ GRADE
2025/2026.
Computer Components - ANS Motherboard, Hard Drive (HDD), Random Access Memory
(RAM), Processor, PCI Cards
Central Processing Unit (CPU) - ANS The computer component responsible for fetching
instructions, decoding them, and performing the indicated sequence of operations on the
correct data. The CPU consists of:
Arithmetic Logic Unit
Registers
Control unit.
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED
, Arithmetic Logic Unit (ALU) - ANS The combinational circuit responsible for performing the
arithmetic and logic functions in a CPU.
Scheduling Algorithms - ANS Definition: Pre-emptive - Scheduler may pre-empt a processor
before it is blocked or terminated
Algorithms:
First Come First served
Jobs processed in order they are received
Favours CPU bound processes
I/O bound process execute briefly then are blocked for I/O
Queue builds up of I/O Bound processes
Algorithms - Shortest Job First - ANS Can starve long jobs of CPU time
In case of a tie FCFS used
Algorithms - Shortest Time Remaining - ANS Pre-emptive
New job arrives -> expected process time compared with that of currently Running Process.
2 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED
