Computer engineering · Practice test · Updated November 2026
A computer engineering practice test is a quiz on how a computer works, from logic gates and binary numbers up to the CPU, memory, I/O, operating system and network. A good one mixes short concept questions with worked problems such as two’s complement, CPI, cache access time, scheduling and subnetting. It is a knowledge check for students, junior engineers and interview candidates, not a certification. This guide covers what to study, how it compares with the 110-question NCEES FE Electrical and Computer exam, a three-week plan and 10 free computer engineering practice questions with full answers.
At a glance
| Topic | Computer engineering fundamentals |
| Who it suits | Students, junior engineers, interview candidates |
| Core topics | CPU, memory, I/O, digital logic, OS, networks |
| Question style | Concepts plus worked numerical problems |
| Related exam | NCEES FE Electrical and Computer: 110 questions |
| Exametics set | 6 practice tests, 281 questions |
- This is a knowledge test, not a vendor certification exam. No official body sets a passing score for it.
- Expect calculation questions: you need to work numbers out, not just recognise terms.
- Free in this post: 10 practice questions with answers, one or more from each topic area.
Source: NCEES FE exam page and FE Electrical and Computer exam specifications (PDF). Checked on 9 November 2026.
What a good computer engineering practice test covers
A good computer engineering practice test covers six connected areas: CPU organisation and architecture, memory and storage, buses and I/O, digital logic and number systems, operating systems, and computer networks. It should test reasoning across those layers, not isolated definitions, and include worked problems you solve on paper.
The layers depend on each other: a cache question needs binary addresses, a scheduling question needs to know what an interrupt does, and a subnetting question is really a number systems question. That is why the strongest tests mix the topics rather than keep them in neat blocks.
| Topic area | What you should be able to do |
|---|---|
| Digital logic and number systems | Convert between bases, use two’s complement, simplify Boolean expressions, read flip-flop and counter behaviour |
| CPU organisation and architecture | Explain the datapath, compare ISAs, calculate CPI and CPU time, reason about pipelines and hazards, apply Amdahl’s law |
| Memory and storage | Work out cache hits and misses, average memory access time, virtual memory and paging, and compare storage interfaces |
| Buses and I/O | Compare polling, interrupts and DMA, and explain how devices connect to the CPU and memory |
| Operating systems | Calculate scheduling waiting times, trace page replacement, explain processes, threads, deadlock and the boot process |
| Computer networks | Use the OSI and TCP/IP models, subnet IPv4 addresses, and explain what TLS protects |
Digital logic, number systems and the CPU
Number systems are the base layer. You should convert between binary, decimal and hexadecimal without a calculator, form the two’s complement of a negative number and spot overflow. In digital logic, expect Boolean algebra, Karnaugh maps, multiplexers, flip-flops and simple state machines.
CPU questions move from structure to performance. Know the fetch–decode–execute cycle, the role of registers, the ALU and the control unit, and the difference between RISC and CISC designs.
Current questions use real ISAs. The RISC-V ratified specifications page describes RISC-V as an open-standard instruction set architecture. The RV32I base integer specification gives it 32 integer registers and says register x0 is hardwired to zero.
- Performance: CPU time = instruction count × CPI ÷ clock rate. Many questions are this formula in disguise.
- Pipelines: a k-stage pipeline with no stalls finishes n instructions in k + (n − 1) cycles. Hazards add stall cycles.
- Amdahl’s law: overall speed-up = 1 ÷ ((1 − f) + f ÷ s), where f is the fraction you speed up and s is its speed-up.
Memory, storage, buses and I/O
Memory questions test the hierarchy: registers, cache, main memory and storage, each larger and slower than the one above. The core calculation is average memory access time: hit time + miss rate × miss penalty. You should also split an address into tag, index and offset bits for a given cache.
Storage and I/O questions now use current technology. The NVM Express specifications page says NVMe defines how host software communicates with non-volatile memory across transports such as PCIe, RDMA and TCP. For I/O, know when polling, interrupt-driven I/O and DMA make sense, and why DMA frees the CPU during large transfers.
Operating systems and networks
Operating systems questions are mostly traces. You are given processes and burst times, or a page reference string, and asked for waiting times or page faults. Learn FCFS, SJF, priority and round robin scheduling, and FIFO, LRU and optimal page replacement. Know the four conditions for deadlock.
Network questions start with layers and addressing. RFC 4632 on CIDR defines the prefix length as the number of significant leading bits, so a /26 block holds 64 addresses. Security basics matter too. RFC 9846, which now defines TLS 1.3, says static RSA and Diffie-Hellman cipher suites have been removed and all handshake messages after the ServerHello are encrypted.
Exametics practice tests
Computer Engineering Practice Tests
- 6 practice tests and 281 questions (five of 47 and one of 46)
- Rebuilt for 2026 with worked problems on two’s complement, pipelines, CPI, Amdahl’s law, caches, scheduling, subnetting and page replacement
- Every answer explained, with a hint, and tagged with one of ten topic areas (finer-grained than the six areas above)
- Timed Exam Mode test
- Lifetime access
30-day refund. Instant access after payment.
Who these computer engineering practice tests are for
These practice tests suit anyone who needs to show they understand how computer systems work: computer engineering and computer science students, junior engineers and candidates preparing for technical interviews. They check knowledge; they do not lead to a certificate.
The depth you need depends on where you are. The table below shows what each group should aim for.
| You are | What to aim for |
|---|---|
| A first- or second-year student | Confident number conversions, Boolean simplification, the basic CPU cycle and the memory hierarchy |
| A final-year student | Fast, accurate worked problems: CPI, pipelines, caches, scheduling, paging and subnetting under time pressure |
| A junior engineer | Linking theory to real systems: where NVMe fits in storage, what UEFI does at boot, what changed in TLS 1.3 |
| An interview candidate | Clear spoken explanations of trade-offs, plus the ability to work a numerical question on a whiteboard |
If you are preparing for technical interviews, expect the interviewer to ask “why” after every answer. Knowing that an LRU cache is better than FIFO is not enough; you need to explain when it is, and what it costs to implement.
Computer engineering practice test vs the FE exam: which first?
For most students and interview candidates, computer engineering fundamentals come first. There is no single vendor certification called “computer engineering”; the best-known formal exam in the field is the NCEES Fundamentals of Engineering (FE) Electrical and Computer exam, a US licensure exam with a much wider scope than these practice tests.
The NCEES FE exam page says the FE exam has 110 questions, a 6-hour appointment that includes 5 hours and 20 minutes of exam time, and a $225 fee. It is computer-based and given year-round at NCEES-approved Pearson test centres. Results are reported as pass or fail, so NCEES does not publish a passing score.
| Item | Exametics computer engineering tests | NCEES FE Electrical and Computer |
|---|---|---|
| Purpose | Check computer systems knowledge for study and interviews | Generally the first step towards professional engineer (P.E.) licensure |
| Questions | 6 tests, 281 questions | 110 questions |
| Time | Includes a timed Exam Mode test | 6-hour appointment, 5 hours 20 minutes of exam time |
| Scope | CPU, memory, I/O, digital logic, operating systems, networks | 17 knowledge areas, from mathematics and circuits to power and software |
| Scoring | Every answer explained, with a hint | Pass or fail; passing score not published |
The overlap is real but partial. The FE Electrical and Computer specification (effective from the July 2020 exams) lists 17 knowledge areas. These are the computing ones:
| FE knowledge area | FE questions | What the specification lists |
|---|---|---|
| Digital Systems | 8–12 | Number systems, Boolean logic, logic minimisation, flip-flops and counters, state machines, timing |
| Computer Systems | 5–8 | Microprocessors, memory technology and systems, interfacing |
| Computer Networks | 4–6 | Routing and switching, topologies, OSI and TCP/IP models, intrusion detection and prevention, security |
| Software Engineering | 4–6 | Algorithms, complexity and big-O, data structures, software implementation |
Watch out
These practice tests are not an FE exam simulator. The FE specification also covers circuit analysis, power systems, electromagnetics and control systems, which this set does not. Operating systems, which this set does cover, is not an FE knowledge area.
If you are a student or interview candidate, start with computer engineering fundamentals. They are the core of your degree and of most technical interviews. If you plan to sit the FE, use these tests for the computer half of the specification and add circuits, signals and power from other material.
Next on your computer engineering path
- Computer Architecture practice tests: go deeper on ISAs, pipelining, caches, virtual memory and parallelism.
- Data Structures and Algorithms practice tests: the software side of most technical interviews, from arrays to graphs.
- CompTIA Network+ (N10-009) practice tests: turn your networking basics into a recognised certification.
How to prepare for a computer engineering test in 3 weeks
Three weeks of steady daily study is enough to refresh the fundamentals if you have taken the courses before: two weeks working up through the layers, then a week of networks and timed practice. Work problems by hand every day, because speed with the arithmetic is what most candidates lack.
- Week 1: Number systems, digital logic and the CPU Drill base conversions, two’s complement and overflow, and simplify Boolean expressions with algebra and Karnaugh maps. Then learn the datapath and practise CPU time, CPI, pipeline cycle counts and Amdahl’s law until you can do each in under two minutes. Read one real ISA summary, such as RISC-V RV32I.
- Week 2: Memory, storage, I/O and operating systems Work cache and AMAT problems, virtual memory and paging. Trace scheduling algorithms and page replacement on paper. Compare polling, interrupts and DMA.
- Week 3: Networks and timed practice Subnet IPv4 addresses, review the OSI and TCP/IP models and TLS basics. Then take the timed Exam Mode test in the Exametics computer engineering practice tests and revise every topic area where you scored lowest.
Tip
Keep an error log. For each wrong answer, write the topic area and the step where you went wrong: the formula, the arithmetic or the concept. After a week, the pattern tells you exactly what to revise.
To go deeper, our guides to computer architecture practice tests, data structures and algorithms practice tests and C interview questions on pointers and memory pair well with this plan. For networking, see the CompTIA Network+ (N10-009) study guide.
Planning more than one exam?
If you are preparing for several technical interviews or certifications, the All-Access Pass covers every practice test on Exametics, including new exams as they are added, with lifetime access. It costs less than buying about six single practice tests.
Free computer engineering practice questions (10 with answers)
Try these 10 free computer engineering practice questions, written for this post and spread across the six topic areas. Treat them as a short quiz: work each one on paper before you open the answer. The full Exametics computer engineering practice tests have 281 more, each with a hint and a full explanation.
Practice question 1 · Digital logic and number systems
What is the 8-bit two’s complement representation of −45?
- A. 10101101
- B. 11010010
- C. 11010011
- D. 00101101
Show answer
Answer: C. +45 is 00101101. Invert every bit to get 11010010, then add 1 to get 11010011 (0xD3). A is the sign-magnitude form: the sign bit set on +45. B is the one’s complement, which forgets to add 1. D is +45 itself.
Practice question 2 · Digital logic and number systems
Which expression is the simplest form of F = A′B + AB + AB′?
- A. A + B
- B. AB
- C. A ⊕ B
- D. 1
Show answer
Answer: A. A′B + AB = B(A′ + A) = B, so F = B + AB′. By the absorption rule, B + AB′ = A + B. F is 0 only when A = 0 and B = 0, which is OR. Option B (AB) is true only when both inputs are 1. Option C (A ⊕ B) equals A′B + AB′ and misses the AB term. Option D would need the A′B′ term as well.
Practice question 3 · CPU organisation and architecture
A program spends 40% of its run time in a routine that you make 4 times faster. The rest is unchanged. What is the overall speed-up?
- A. About 1.11
- B. About 1.67
- C. 4.00
- D. About 1.43
Show answer
Answer: D. By Amdahl’s law, the new time is 0.6 + 0.4 ÷ 4 = 0.7 of the old time, so the speed-up is 1 ÷ 0.7 ≈ 1.43. A comes from removing only a quarter of the routine’s time (1 ÷ 0.9) instead of three quarters. B is the upper limit if the routine took no time at all (1 ÷ 0.6). C assumes the whole program gets 4 times faster, which ignores the 60% that did not change.
Practice question 4 · CPU organisation and architecture
A 2 GHz processor runs a program of 1 billion instructions: 50% ALU instructions (CPI 1), 30% loads and stores (CPI 2) and 20% branches (CPI 3). What is the CPU time?
- A. 0.50 s
- B. 0.85 s
- C. 1.70 s
- D. 3.40 s
Show answer
Answer: B. Average CPI = 0.5 × 1 + 0.3 × 2 + 0.2 × 3 = 1.7. CPU time = instructions × CPI ÷ clock rate = 109 × 1.7 ÷ (2 × 109) = 0.85 s. A assumes a CPI of 1. C uses a 1 ns cycle time, as if the clock were 1 GHz. D mistakes 2 GHz for a 2 ns cycle time; 2 GHz means a cycle time of 0.5 ns.
Practice question 5 · CPU organisation and architecture
An ideal 5-stage pipeline with no stalls or hazards executes 100 instructions. How many clock cycles does it take, counting until the last instruction completes?
- A. 100
- B. 500
- C. 104
- D. 520
Show answer
Answer: C. The first instruction needs 5 cycles to fill the pipeline; after that one instruction completes per cycle, so the total is 5 + (100 − 1) = 104. A ignores the fill time. B is the unpipelined time, 5 cycles per instruction. D multiplies the correct answer by the number of stages for no reason.
Practice question 6 · Memory and storage
A cache has a hit time of 1 ns, a miss rate of 5% and a miss penalty of 60 ns. What is the average memory access time?
- A. 3 ns
- B. 61 ns
- C. 1.05 ns
- D. 4 ns
Show answer
Answer: D. AMAT = hit time + miss rate × miss penalty = 1 + 0.05 × 60 = 4 ns. A leaves out the hit time, which every access pays. B adds the full penalty as if every access missed. C multiplies the miss rate by 1 ns instead of by the miss penalty.
Practice question 7 · Operating systems
A process has 3 page frames, all empty at the start, and uses FIFO page replacement. How many page faults occur for the reference string 1, 3, 5, 1, 4, 3, 6, 1, 5, 4?
- A. 8
- B. 9
- C. 6
- D. 10
Show answer
Answer: A. The first 1, 3 and 5 are cold misses, and the second 1 is a hit. Then 4 faults and evicts 1, the oldest page; 3 is a hit; 6 faults and evicts 3. The remaining 1, 5 and 4 each fault, evicting 5, 4 and 6 in turn: 8 faults in total. B is the count for LRU, which evicts the least recently used page instead of the oldest. C is the count for the optimal (OPT) algorithm, which FIFO cannot match here. D treats every reference as a fault, but the second 1 and the second 3 are hits.
Practice question 8 · Operating systems
Four processes arrive at time 0 with CPU bursts P1 = 5, P2 = 9, P3 = 4 and P4 = 2 ms. Using non-preemptive shortest job first (SJF), what is the average waiting time?
- A. 9.25 ms
- B. 4.75 ms
- C. 4 ms
- D. 11.5 ms
Show answer
Answer: B. SJF runs P4 (0–2), P3 (2–6), P1 (6–11) and P2 (11–20). The waiting times are 0, 2, 6 and 11 ms, so the average is 19 ÷ 4 = 4.75 ms. A is the FCFS result in the order P1, P2, P3, P4 (waits 0, 5, 14 and 18 ms). C is impossible, because SJF gives the lowest average waiting time when all jobs arrive together. D is impossible too: even the worst order, longest job first, gives only 10.25 ms.
Practice question 9 · Computer networks
A host has the address 192.168.10.77/26. What is the broadcast address of its subnet?
- A. 192.168.10.255
- B. 192.168.10.63
- C. 192.168.10.64
- D. 192.168.10.127
Show answer
Answer: D. A /26 leaves 6 host bits, so each subnet has 64 addresses: .0–.63, .64–.127, .128–.191 and .192–.255. Address .77 falls in .64–.127, so the broadcast address is 192.168.10.127. A is the broadcast address of a /24. B is the broadcast address of the previous subnet. C is the network address of the correct subnet, not its broadcast. The address sits in the private 192.168.0.0/16 range from RFC 1918, but the subnet arithmetic is the same for any IPv4 address.
Practice question 10 · Buses and I/O
A disk controller must move a 64 KB block into main memory. Which method lets the transfer happen without the CPU copying each word, and interrupts the CPU only when the block is complete?
- A. Programmed I/O with polling
- B. Interrupt-driven I/O, one interrupt per word
- C. Direct memory access (DMA)
- D. Memory-mapped I/O
Show answer
Answer: C. With DMA, the CPU sets up the transfer and a DMA controller moves the data between the device and memory, raising one interrupt at the end. A keeps the CPU busy checking the device and copying data. B frees the CPU between words but still needs it for every word. D is a way of addressing device registers through memory addresses; it does not by itself move data without the CPU.
How did you score?
8–10 correct on these sample questions: you are ready for a full timed test, so try Exam Mode next. Under 8: note which topic areas your misses came from and revise those first. The Exametics computer engineering practice tests have 281 more questions like these, each with a hint and an explanation.
Common mistakes in computer engineering tests
Most lost marks come from small slips in method, not from missing knowledge. These are the mistakes that show up most often in worked problems.
- Mixing up one’s and two’s complement. Two’s complement is invert and add 1. Check your answer by adding it to the positive value: the result should be zero with a carry out.
- Forgetting the hit time in AMAT. Every access pays the hit time; only misses add the penalty.
- Dropping the pipeline fill. n instructions on a k-stage pipeline take k + (n − 1) cycles, not n cycles.
- Treating Amdahl’s law as multiplication. Speeding up part of a program by 4 never speeds up the whole program by 4. The unchanged part sets the limit.
- Confusing the network and broadcast addresses. The network address is the first address in the block, the broadcast address the last. In an ordinary subnet, neither can be given to a host.
- Quoting outdated technology. TLS 1.3 removed static RSA key exchange, and NVMe, not older interfaces, is the standard for current SSDs. Answer for current systems unless the question says otherwise.
Computer engineering practice tests: FAQs
What does a computer engineering practice test cover?
A good computer engineering practice test covers CPU organisation and architecture, memory and storage, buses and I/O, digital logic and number systems, operating systems and computer networks. It should mix concept questions with worked problems such as two’s complement, CPI, cache access time, scheduling and subnetting.
Are there free computer engineering practice questions?
Yes. This post includes 10 free computer engineering sample questions with answers and explanations, spread across the six topic areas. For full practice, the Exametics computer engineering practice tests have 6 tests and 281 questions, including a timed Exam Mode test.
How many questions are in the Exametics computer engineering practice tests?
There are 6 practice tests with 281 questions in total: five tests of 47 questions and one of 46. Every question explains why the right answer is right and why the others are wrong, and includes a hint.
Is there an official computer engineering certification exam or passing score?
There is no single vendor certification called computer engineering, so no official passing score exists for a computer engineering practice test. The closest formal exam is the NCEES FE Electrical and Computer exam; the NCEES FE exam page says it has 110 questions in a 6-hour appointment and reports results only as pass or fail, so no passing score is published.
Is a computer engineering practice test hard, and how long should I prepare?
A computer engineering practice test is hard mainly because its worked problems punish small arithmetic and method errors; the concepts themselves are manageable. If you have taken the courses before, about three weeks of daily practice is a realistic plan: logic, number systems and the CPU, then memory and operating systems, then networks and timed tests.
Which should I study first: computer engineering fundamentals or the FE exam?
Start with computer engineering fundamentals if you are a student or preparing for interviews. The FE Electrical and Computer specification from NCEES also covers circuits, power, electromagnetics and control systems, so FE candidates need extra material beyond these topics.
Can I take the computer engineering practice tests online?
Yes. The Exametics computer engineering practice tests run online with instant access after payment and lifetime access. The NCEES FE exam is different: the NCEES FE exam page says it is given at NCEES-approved Pearson test centres.
Official exam page: NCEES FE exam. Checked on 9 November 2026.
Practise computer engineering with worked problems
If the free practice questions above showed gaps, close them here. Work through 281 computer engineering questions in six practice tests, with a hint and a full explanation for every answer and a timed Exam Mode test.
✓ Every answer explained · ✓ Timed exam mode · ✓ 30-day refund