AQA GCSE Computer Science Paper 1 (1C), June 2025
Every question from AQA GCSE Computer Science Paper 1 (1C), June 2025 (8525): 11 questions, 90 marks, each with its mark scheme and topic.
- Question 1 7 marks
Analyze a VB.NET program featuring a while loop to identify operations and statements, identify the relational operator, and complete a trace table.
3.1 Fundamentals of algorithms · 3.2 Programming · 3.1.1 Representing algorithms · 3.2.2 Programming concepts · 3.2.3 Arithmetic operations in a programming language · 3.2.4 Relational operations in a programming language
- Question 2 7 marks
Complete a program using selection statements and write a program in VB.NET to calculate the total value of free food items based on user input.
3.2 Programming · 3.2.2 Programming concepts · 3.2.3 Arithmetic operations in a programming language · 3.2.4 Relational operations in a programming language · 3.2.7 Input/output
- Question 3 8 marks
Write a VB.NET program to calculate and output the total cost of a netball coaching session based on the number of students entered by the user.
3.2 Programming · 3.2.2 Programming concepts · 3.2.3 Arithmetic operations in a programming language · 3.2.4 Relational operations in a programming language · 3.2.7 Input/output
- Question 4 13 marks
Answer questions on input validation, test data types, writing a validation program in VB.NET, and completing a flowchart for username generation.
3.1 Fundamentals of algorithms · 3.2 Programming · 3.1.1 Representing algorithms · 3.2.2 Programming concepts · 3.2.7 Input/output · 3.2.8 String handling operations in a programming language · 3.2.11 Robust and secure programming
- Question 5 8 marks
Explain data types and rewrite a VB.NET program calculating the sum of five inputs using an iteration structure.
3.2 Programming · 3.2.1 Data types · 3.2.2 Programming concepts · 3.2.3 Arithmetic operations in a programming language · 3.2.7 Input/output
- Question 6 10 marks
Demonstrate the operation of bubble sort and merge sort on a list of numbers, compare the two sorting algorithms, and explain why binary search is preferable to linear search for a large sorted array.
3.1 Fundamentals of algorithms · 3.1.3 Searching algorithms · 3.1.4 Sorting algorithms
- Question 7 7 marks
Analyse a subroutine that uses the modulo operator to determine if an integer is even or odd, trace its outputs, identify its parameter, and state characteristics of the structured approach to programming.
3.1 Fundamentals of algorithms · 3.2 Programming · 3.1.1 Representing algorithms · 3.2.3 Arithmetic operations in a programming language · 3.2.7 Input/output · 3.2.10 Structured programming and subroutines (procedures and functions)
- Question 8 6 marks
Complete a trace table for an algorithm manipulating binary strings using nested selection and iteration, and explain why zero-based indexing requires the upper bound of the loop to be the length minus 1.
3.1 Fundamentals of algorithms · 3.2 Programming · 3.1.1 Representing algorithms · 3.2.2 Programming concepts · 3.2.5 Boolean operations in a programming language · 3.2.8 String handling operations in a programming language
- Question 9 2 marks
Determine whether each of five pseudo-code algorithms correctly calculates the sum of the five values in an array.
3.1 Fundamentals of algorithms · 3.2 Programming · 3.1.1 Representing algorithms · 3.2.2 Programming concepts · 3.2.6 Data structures
- Question 10 8 marks
Work with a record data structure in pseudo-code and write a VB.NET program to find the fastest time in an array.
3.2 Programming · 3.2.2 Programming concepts · 3.2.4 Relational operations in a programming language · 3.2.6 Data structures · 3.2.7 Input/output
- Question 11 14 marks
Trace a subroutine findLetter for a word-guessing game and extend the VB.NET program to manage player guesses, call the subroutine, and determine whether the player wins or loses.
3.1 Fundamentals of algorithms · 3.2 Programming · 3.1.1 Representing algorithms · 3.2.2 Programming concepts · 3.2.7 Input/output · 3.2.8 String handling operations in a programming language · 3.2.10 Structured programming and subroutines (procedures and functions)