Revision Library
Choose a subject
Menu
Computer Science
Need a new topic?
Missing a topic, found a bug, or want something added?

Book 2 of 4

GCSE Computer Science Exam Papers Set B

Year 10 Paper 4: Data and Algorithms, Year 10 Paper 5: Mixed Topics and Year 10 Paper 6: Full Course Review

Level
GCSE · AQA 8525 · OCR J277
Series
GCSE Computer Science Exam Papers, book 2 of 4
Suitable for
Years 10-11, AQA / OCR
FreePDF download · 2027 edition · 69 A4 pages
  • One file, prints straight to A4
  • No account, no password

3 papers, mark schemes at the back. This set is one of 558 free PDFs on the shelf.

Pages
69 A4 pages
Papers
3 papers
Questions
65 · 240 marks
Answers
From page 52

What is inside

3 papers · answers from p52

Each paper starts with a page showing its marks and a suggested time, followed by the questions. The mark schemes for all 3 papers are at the back, so you can sit each paper as a mock and mark it afterwards.

  1. 01Year 10 Paper 4: Data and Algorithms17 questions · 60 marksp3
  2. 02Year 10 Paper 5: Mixed Topics22 questions · 80 marksp15
  3. 03Year 10 Paper 6: Full Course Review26 questions · 100 marksp32
  4. AnswersMark schemes for every paperp52

Each paper is drawn from one of our worksheet packs. Follow a paper title for the full pack on its own page, or browse every GCSE Computer Science pack. Every book on the shelf is a complete printable workbook of up to 120 A4 pages.

Explore this volume

GCSE Computer Science Exam Papers Set B includes Year 10 Paper 4: Data and Algorithms (from page 3); Year 10 Paper 5: Mixed Topics (from page 15); Year 10 Paper 6: Full Course Review (from page 32).

Worked question 5 - Year 10 Paper 4: Data and Algorithms

The following pseudocode is run:

for i = 1 to 4

print i * 2

next i

State each value of i and its corresponding output, in order. The for loop includes both endpoint values.

Answer

The output, on separate lines, is 2,4,6,8. The inclusive loop uses i=1,2,3,4, multiplying each by 2.

Mark scheme

B1First output is 2
B1Middle outputs are 4 then 6
B1Final output is 8 and the loop stops

Question 17 - Year 10 Paper 4: Data and Algorithms

6 marks

Design pseudocode to count ten integer scores in these bands: below 40; 40 to 69 inclusive; 70 or above. Use scores[0] through scores[9] and output all three counts.

Check your counts for scores = [0, 39, 40, 69, 70, 100, 38, 41, 68, 71].

Answer

Pseudocode (zero-based list): low = 0 mid = 0 high = 0 for i = 0 to 9 if scores[i] < 40 then low = low + 1 elseif scores[i] < 70 then mid = mid + 1 else high = high + 1 endif next i print low, mid, high The branches are exclusive; 40 and 69 belong to mid and 70 to high. For the printed scores the band counts are 3 below 40, 4 in 40..69 and 3 at least 70. The band partition assumes integer scores; the original does not specify the behaviour for a fractional score between 69 and 70.

Mark scheme

B1Initialise all three counts to zero
B1Visit all ten scores exactly once
B1Increment low only for scores below 40
B1Increment mid only for 40 through 69
B1Increment high only for 70 or above
B1Output all three final counts after the loop

Question 11 - Year 10 Paper 4: Data and Algorithms

5 marks

A programmer declares a variable inside a subroutine, and a different variable outside any subroutine, in the main part of the program.

Explain where local and global variables are declared and where each is accessible. Then explain one risk of choosing a global for temporary subroutine data.

Answer

A local variable is declared inside a subroutine and is accessible only within that scope. A global variable is declared in an enclosing program-level scope and can be accessed by subroutines where the language scope rules allow it. Keeping temporary values local avoids accidental interference; a separate local binding with the same name may hide a global without changing it.

Mark scheme

B1Local is declared inside the subroutine
B1Local is accessible only within its scope
B1Global is declared at program scope
B1Global can be accessible across subroutines subject to language rules
B1Local temporary state reduces accidental interference

Question 4 - Year 10 Paper 4: Data and Algorithms

3 marks

Convert the denary number 91 into hexadecimal.

Answer

5B

Mark scheme

M1Divides 91 by 16 to obtain quotient 5 and remainder 11, or equivalent place-value work.
M1Maps 11 to hexadecimal B.
A15B, accepting 5b and clearly labelled hexadecimal forms; a correct final answer earns all conversion marks.

Question 13 - Year 10 Paper 5: Mixed Topics

4 marks

A security system unlocks a door only when a valid keycard is used (K) and the correct PIN is entered (P), or when a manager override is used (M).

Write a Boolean expression for unlock using K, P and M, and state whether the door unlocks when K=1, P=0 and M=1.

Answer

unlock = (K AND P) OR M; with K=1, P=0, M=1 the door unlocks (output 1)

Mark scheme

M1for combining K and P with AND, for example (K AND P)
M1for combining this with M using OR, for example unlock = (K AND P) OR M
M1for evaluating (K AND P) = (1 AND 0) = 0 when K=1 and P=0
A1for evaluating 0 OR 1 = 1, so the door unlocks

Question 10 - Year 10 Paper 5: Mixed Topics

4 marks

A NAND gate has two inputs, C and D, and its output is the opposite of what an AND gate would give for the same inputs.

Write a Boolean expression for the NAND gate's output using C and D, and state its output when C=1 and D=1.

Answer

output = NOT (C AND D); with C=1, D=1 the output is 0

Mark scheme

M1Combines C and D with AND, or uses an equivalent De Morgan form.
M1Negates the whole conjunction: NOT (C AND D), accepting NOT C OR NOT D.
M1Evaluates C AND D as 1 for C=D=1, or correctly substitutes into an equivalent expression.
A1Gives output 0; full evaluation credit for the correct stated output.

Question 15 - Year 10 Paper 5: Mixed Topics

4 marks

A fire alarm sounds when a smoke sensor detects smoke (S) and the alarm is switched on (P), or when a manual call point is pressed (M), regardless of the other inputs.

Write a Boolean expression for alarm using S, P and M, and state whether the alarm sounds when S=0, P=1 and M=1.

Answer

alarm = (S AND P) OR M; with S=0, P=1, M=1 the alarm sounds (output 1), because M=1 alone is enough

Mark scheme

M1Combines S and P with AND.
M1Uses alarm = (S AND P) OR M, accepting logically equivalent forms.
M1Correct substitution: (0 AND 1) OR 1, or observes that M=1 forces the OR output.
A1Output 1, so the alarm sounds; award both evaluation marks for a correct conclusion.

Question 16 - Year 10 Paper 6: Full Course Review

4 marks

A program should add up numbers entered by the user until the user enters 0, then output the total. Its pseudocode is:

total = 0

input number

while number != 0

total = total + number

input number

endwhile

print total

Trace this pseudocode for the inputs 5, 3, 0, entered in that order, and state the value of total after each number is added, and the value that is finally printed.

Answer

After adding 5, total = 5; after adding 3, total = 8; the 0 ends the loop; final printed value = 8.

Mark scheme

B1total = 5 after the first number, 5, is added
B1total = 8 after the second number, 3, is added
B1the loop ends when the number 0 is input, since the while condition becomes false
A1the value printed is 8

Question 26 - Year 10 Paper 6: Full Course Review

6 marks

Design an algorithm, in pseudocode, that repeatedly asks the user to enter a number, stopping when the user enters -1, and then outputs the smallest number entered (not counting the -1).

Answer

input number / if number == -1 then / print "No numbers entered; no smallest value" / else / smallest = number / input number / while number != -1 / if number < smallest then smallest = number / endif / input number / endwhile / print smallest / endif

Mark scheme

B1declares a variable to store the smallest value found so far
B1inputs the first number and checks it is not -1 before initialising smallest; handles an immediate -1 by reporting that no smallest value exists
B1uses a loop that continues to input further numbers until -1 is entered, excluding the sentinel from processing
B1inside the loop, compares each newly entered number with the current smallest value
B1updates the smallest variable whenever a newly entered number is less than the current smallest value
B1outputs the smallest value once the loop ends if at least one non-sentinel number was entered

GCSE Computer Science Exam Papers runs to 4 volumes

Book 2 of 4 · 261 pages in the set

Each set is a separate free PDF with its own mark schemes at the back.

Volume 1

59 pp · 58 Qs

Year 10 Paper 1: Core Skills, Year 10 Paper 2: Software and Networks and Year 10 Paper 3: Systems and Algorithms

Volume 2 · this book

69 pp · 65 Qs

Year 10 Paper 4: Data and Algorithms, Year 10 Paper 5: Mixed Topics and Year 10 Paper 6: Full Course Review

Volume 3

63 pp · 57 Qs

Year 11 Paper 1: Systems and Security, Year 11 Paper 2: Programming and Data and Year 11 Paper 3: Systems and Programming

Volume 4

70 pp · 68 Qs

Year 11 Paper 4: Algorithms and Ethics, Year 11 Paper 5: Systems and Data and Year 11 Paper 6: Revision Mix

More GCSE books

Want a different mix of topics?

Sitting an exam soon? Build a GCSE Computer Science mock paper or print a ready-made one.