UniGeniusIGCSE Computer Science

IGCSE Computer Science

IGCSE Computer Science Paper 2 and pseudocode

Short-answer and structured questions on topics 7 to 10, then a 15-mark scenario question. Everywhere except the scenario question, code must be written in pseudocode.

Topics7 to 10: algorithms, programming, databases, Boolean logic
Time1 hour 45 minutes for 75 marks
Final question15 marks: an unseen problem, in pseudocode, Python, Visual Basic or Java
CalculatorNot allowed

The pseudocode style

  • Assignment with ←, keywords in capitals, and blocks that close: IF ... THEN ... ELSE ... ENDIF, FOR ... TO ... NEXT, WHILE ... DO ... ENDWHILE, REPEAT ... UNTIL.
  • Arrays declared with their bounds, such as DECLARE Score : ARRAY[1:30] OF INTEGER, and indexes that start where the declaration says.
  • Library routines written as functions: DIV(17, 5) is 3, MOD(17, 5) is 2, LENGTH, SUBSTRING, UCASE, LCASE, ROUND and RANDOM.

The 15-mark scenario question

You are given a problem, the arrays and variables to use, and a list of what the program must do. Up to 9 marks are for the techniques and data structures you use; up to 6 are for comments, meaningful names, logic and accuracy. Plan the loops first, then add the validation, the totals and the output.

Trace tables

Work line by line, add a new row only when a value changes, and keep each column to one variable. Most lost marks come from running a loop one time too many or too few.

Try 4 questions

Question 1
A program accepts the number of guests at a table from 1 to 8. Which value is extreme test data?
Question 2
A library program records whether each book is on loan. Which data type is most suitable?
Question 3
Why does a game store its high scores in a file?
Question 4
In a database table, what is a record?

Next step

Take the free testStart the standard methods lesson

Questions people ask

Can I write Python in Paper 2?

Only in the 15-mark scenario question. Elsewhere in the 2026 to 2028 papers, solutions must be in pseudocode.

Do I need to learn sorting algorithms?

Yes: linear search, bubble sort, totalling, counting, and finding the maximum, minimum and average.