CAPE Computer Science Practice Questions

What CAPE Computer Science practice questions teach you

Past-paper-style questions help students understand how examiners test important syllabus concepts. Consistent multiple-choice practice improves accuracy, speed and confidence before the CAPE examination.

Instead of simply reading answers, practice with explanations helps students understand why an option is correct and why the alternatives are not.

CAPE Computer Science CAPE Practice Questions

Browse questions based on common CAPE formats. Select a question to review its answer options.

1. Question 1 — A workstation must continue operating long enough to save open files after a brief power failure. Which device is most appropriate?
2. Question 2 — Which number system is used internally by a digital computer to represent instructions and data?
3. Question 3 — Which is a typical use of registers in a processor?
4. Question 4 — What does the following instruction sequence accomplish?
5. Question 5 — The diagram shows two inputs entering an AND-shaped gate followed by an inversion bubble. Which logic operation is represented?
6. Question 6 — Clock speed is best described as the
7. Question 7 — How many selection lines are required for an 8-to-1 multiplexer?
8. Question 8 — For the multiplexer shown, how many distinct data inputs can be selected?
9. Question 9 — Which statement about bits and bytes is correct?
10. Question 10 — What is the 8-bit two's-complement representation of -5?
11. Question 11 — Which sequence correctly describes the basic instruction cycle?
12. Question 12 — Which component reduces the effect of the speed difference between the processor and main memory?
13. Question 13 — Which level in the memory hierarchy shown normally has the smallest capacity and the fastest access time?
14. Question 14 — Which statements about read-only memory are correct?
15. Question 15 — In a floating-point representation, which component stores the significant digits of a number?
16. Question 16 — A programmer identifies the required inputs, expected outputs and limitations of a proposed solution. Which stage of problem solving is being carried out?
17. Question 17 — According to the flowchart, what is printed when N has the value 11?
18. Question 18 — Which control structure is represented by an IF-THEN-ELSE statement?
19. Question 19 — Which algorithm correctly calculates the sum of all positive even integers from 2 to N?
20. Question 20 — What is the purpose of the assignment statement represented by the lines below?
21. Question 21 — What output is produced by the algorithm?
22. Question 22 — Which programming constructs are present in the algorithm?
23. Question 23 — What is the final value of x after the algorithm terminates?
24. Question 24 — Which is NOT normally an advantage of pseudocode?
25. Question 25 — What value should replace the blank so that the algorithm calculates the average correctly?
26. Question 26 — Which statement correctly describes top-down design?
27. Question 27 — Which sequence of values is printed by the algorithm?
28. Question 28 — Which control structure is most appropriate when the exact number of repetitions is known before execution begins?
29. Question 29 — Which sequence gives the most appropriate order for a systematic problem-solving process?
30. Question 30 — Which algorithms print the values 2, 3, 4 and 5 in that order?

Frequently Asked Questions