FE · 5% of the exam
Computer Systems practice questions
10 free Computer Systems questions for the FE Electrical and Computer Exam (FE) exam, each with the correct answer and an explanation for every option.
What this domain covers
How computers are organised: processor architecture, memory hierarchy, microcontrollers and interfacing.
- Exam weight
- 5%
- On a real exam
- ≈ 6 questions
- In our bank
- 30 questions
Topics that come up most
- CPU architecture and instruction cycles
- Pipelining and performance
- Cache and memory hierarchy
- Memory types and addressing
- Microprocessor interfacing
How to study it
Work through cache hit-rate and average access time problems, and learn how address bits divide into tag, index and offset.
Sample Computer Systems questions
Try each one before opening the answer. Original questions written to the official exam objectives.
Question 1
A designer keeps a cache's total capacity and block size fixed but changes it from direct-mapped to 4-way set associative. Which quantity is this change mainly intended to reduce?
- AConflict misses
- BCompulsory misses
- CCapacity misses
- DCache hit time
Show answer and explanation
Answer: A) Conflict misses
Raising associativity at a fixed capacity mainly reduces conflict misses, because blocks that map to the same set can coexist. It does not reduce compulsory or capacity misses, and it tends to increase hit time slightly.
- ACorrect. With more ways per set, blocks that map to the same set can stay in the cache together instead of evicting one another. This reduces conflict misses.
- BIncorrect. Compulsory (cold) misses happen on the first access to a block, whatever the cache organization. Larger blocks or prefetching address them, not associativity.
- CIncorrect. Capacity misses are the ones that would happen even in a fully associative cache of the same size, because the working set does not fit. With capacity fixed, adding associativity does not reduce them.
- DIncorrect. Higher associativity usually increases hit time slightly, because more tags must be compared and a way must be selected through a multiplexer.
Question 2
A processor's stack pointer register mainly:
- AHolds the address of the next instruction
- BTracks the top of the call stack in memory
- CStores floating-point results
- DControls the clock speed
Show answer and explanation
Answer: B) Tracks the top of the call stack in memory
- AIncorrect. That's the program counter.
- BCorrect. It changes on push, pop, calls and returns.
- CIncorrect. That's a data register.
- DIncorrect. That isn't its role.
Question 3
A processor's clock runs at 2 GHz. Its clock period is:
- A2 ns
- B0.5 ns
- C5 ns
- D0.05 ns
Show answer and explanation
Answer: B) 0.5 ns
- AIncorrect. That's for 500 MHz.
- BCorrect. 1/(2 × 10⁹ Hz).
- CIncorrect. Recheck the reciprocal.
- DIncorrect. Recheck the reciprocal.
Question 4
How do assembly language instructions generally relate to the processor's machine instructions?
- AEach typically corresponds one-to-one with a machine instruction, produced by an assembler
- BEach typically compiles into many machine instructions, as with high-level language statements
- CEach is translated into portable bytecode that a virtual machine interprets at run time
- DEach is loaded directly into the control unit's microcode store, bypassing machine code
Show answer and explanation
Answer: A) Each typically corresponds one-to-one with a machine instruction, produced by an assembler
Assembly language is a symbolic form of machine code. An assembler generally translates each instruction into exactly one machine instruction, with exceptions such as macros and pseudo-instructions.
- ACorrect. An assembly mnemonic and its operands usually encode exactly one machine instruction. Macros and some pseudo-instructions can expand into several instructions, but these are exceptions to the general one-to-one rule.
- BIncorrect. One-to-many translation is typical of high-level language statements processed by a compiler, not of ordinary assembly instructions.
- CIncorrect. Bytecode and virtual-machine interpretation belong to languages such as Java. Assembly is specific to one processor and is assembled into native machine code.
- DIncorrect. Microcode is internal to the processor's implementation and is not written by the programmer. Assembly targets the instruction set architecture, meaning the machine instructions.
Question 5
By Amdahl's law, a program that is 50% parallelizable runs on 2 processors with a speedup of about:
- A0.75
- B2.00, perfect scaling
- C1.50
- D1.33
Show answer and explanation
Answer: D) 1.33
- AIncorrect. That would be a slowdown.
- BIncorrect. The serial part limits speedup.
- CIncorrect. That isn't the calculation.
- DCorrect. 1/(0.5 + 0.5/2).
Question 6
Main memory built from DRAM is:
- AVolatile
- BNonvolatile like flash memory
- CRead-only
- DSlower than a hard disk
Show answer and explanation
Answer: A) Volatile
- ACorrect. It loses data without power.
- BIncorrect. DRAM is volatile.
- CIncorrect. It's read-write.
- DIncorrect. It's much faster.
Question 7
In a write-back cache, a modified block is written to main memory:
- ANever
- BOn every store instruction
- COnly when it's evicted
- DOnly when the program ends
Show answer and explanation
Answer: C) Only when it's evicted
- AIncorrect. It's written when evicted.
- BIncorrect. That's write-through.
- CCorrect. Write-through writes on every store.
- DIncorrect. It's written at eviction.
Question 8
Ideally, with no hazards or overhead, a k-stage pipeline speeds up instruction throughput by a factor of about:
- A1/k
- B1, with no speedup
- Ck², the square of the stages
- Dk
Show answer and explanation
Answer: D) k
- AIncorrect. That would slow it down.
- BIncorrect. Pipelining overlaps instructions.
- CIncorrect. That isn't realistic.
- DCorrect. Each stage works on a different instruction.
Question 9
A cache has a 1-ns hit time, 5% miss rate and 100-ns miss penalty. The average memory access time is:
- A5 ns
- B6 ns
- C101 ns
- D1.05 ns
Show answer and explanation
Answer: B) 6 ns
- AIncorrect. Add the hit time.
- BCorrect. 1 + 0.05(100).
- CIncorrect. Weight the miss penalty by the miss rate.
- DIncorrect. Multiply the penalty by the miss rate.
Question 10
Virtual memory lets a process use an address space larger than the installed physical RAM mainly by:
- AKeeping active pages in RAM and the rest on disk, loading them on page faults
- BKeeping frequently used data in a cache hierarchy between the CPU and RAM
- CStoring data words that do not fit in RAM inside the translation lookaside buffer
- DInterleaving memory banks so several RAM modules can be accessed in parallel
Show answer and explanation
Answer: A) Keeping active pages in RAM and the rest on disk, loading them on page faults
Virtual memory uses paging to keep only the active pages in physical RAM and the rest on disk, swapping pages in on demand. Caches, TLBs and interleaving improve speed but do not add addressable capacity.
- ACorrect. Virtual memory maps virtual pages to physical frames. Pages that are not resident sit on secondary storage and are brought into RAM when a page fault occurs, so the disk works as an extension of main memory.
- BIncorrect. Caches hold copies of data that is already in main memory to cut access time. They do not let a program address more memory than physical RAM.
- CIncorrect. The TLB is a small cache of recent virtual-to-physical address translations. It speeds up address translation but stores no program data.
- DIncorrect. Interleaving improves memory bandwidth by overlapping accesses to different banks. Total capacity stays at the installed physical RAM.
Computer Systems: FAQs
How much of the FE exam is Computer Systems?
Computer Systems is 5% of the FE exam by the official exam guide's weighting, which on a 110-question form works out to roughly 6 questions. The real exam's exact split varies by form.
What does the Computer Systems domain cover?
How computers are organised: processor architecture, memory hierarchy, microcontrollers and interfacing.
How should I study Computer Systems for FE?
Work through cache hit-rate and average access time problems, and learn how address bits divide into tag, index and offset.
Where can I practise more Computer Systems questions?
This page has 10 free Computer Systems questions with answers. The ExamWize FE question bank has 30 questions in this domain. Every practice exam result breaks your score down by domain, and Review Mode re-drills the questions you missed.
Other FE topics
- Mathematics11% of the exam
- Probability and Statistics4% of the exam
- Ethics and Professional Practice4% of the exam
- Engineering Economics5% of the exam
- Properties of Electrical Materials4% of the exam
- Circuit Analysis (DC and AC Steady State)11% of the exam
- Linear Systems5% of the exam
- Signal Processing5% of the exam
- Electronics7% of the exam
- Power Systems8% of the exam
- Electromagnetics4% of the exam
- Control Systems6% of the exam
- Communications5% of the exam
- Computer Networks4% of the exam
- Digital Systems8% of the exam
- Software Engineering4% of the exam
Also: 15 free questions across all topics, the FE cheat sheet and the study guide.
Get Computer Systems exam-ready
The full FE bank has 30 Computer Systems questions. Timed practice exams match the real exam's length and domain weights, every result shows your score per domain, and Review Mode re-drills the questions you missed.
Not affiliated with NCEES; questions are original, written from the official exam outline, and never copied from the real exam.