Algorithms and programs: Eduqas A‑Level Computer Science questions

Every Eduqas A-Level Computer Science exam question on 1.3 Algorithms and programs, 2016–2025, with its mark scheme and examiner’s report.

All 149 questions on Algorithms and programs, as a list

June 2025, Component 1, Q3(a) (1 mark): Name the sort method used in the algorithm. [1]
June 2025, Component 1, Q3(b) (6 marks): Dry run the algorithm using the trace table with the given integers: [6] 54, 45, 13, 26 list counter swapped swaps 54, 45, 13, 26 0 TRUE 0
June 2025, Component 1, Q6(a) (2 marks): Describe one example where a shortest-path algorithm is appropriate. [2]
June 2025, Component 1, Q6(b)(i) (3 marks): Draw a labelled diagram of the network. [3]
June 2025, Component 1, Q6(b)(ii) (2 marks): State the shortest path from node A to node G and calculate its cost. [2]
June 2025, Component 1, Q8(a) (5 marks): Evaluate the efficiency of the search algorithm and, using Big O notation, determine the growth rate for time performance. [5]
June 2025, Component 1, Q8(b) (2 marks): Draw a graph to illustrate the order of time performance. [2]
June 2025, Component 1, Q10(a) (5 marks): Write an algorithm to search an unsorted one-dimensional array of integers. [5]
June 2025, Component 1, Q10(b) (2 marks): Give two advantages of a linear search algorithm. [2]
June 2025, AS Component 1, Q5 (6 marks): Explain the scope and lifetime of variables in a program. [6]
June 2025, AS Component 1, Q10 (8 marks): A well-known game called Battleships populates a 2D array with the following: • 0 – to represent an empty square • S – to represent one of the 10 battleship loc
June 2025, AS Component 1, Q12 (6 marks): Explain how an insertion sort algorithm operates. [6]
June 2025, AS Component 2, Q3(a) (8 marks): Copy and complete the table to show the contents of the costArray with the input timeOfDay = 4. [8] 1 2
June 2025, AS Component 2, Q3(b) (4 marks): PVLP is making additions to its algorithm to return the booking price in relation to the length of the session. 1 output “Please enter the booking length:” 2 in
June 2025, AS Component 2, Q5(b) (12 marks): Create a new form that will allow PVLP to: • input customer details including next appointment • validate customer details ensuring the next appointment date is
June 2025, AS Component 2, Q5(c) (4 marks): Using the internal facility of your language, add annotated listings to your code from question 5(b) that would clearly explain the design of your program to an
June 2024, Component 1, Q7(a) (5 marks): Evaluate the efficiency of the search algorithm and using Big O notation, determine the growth rate for time performance. [5]
June 2024, Component 1, Q7(b) (4 marks): Identify the type of time complexity and draw a graph of the algorithm above to illustrate the order of time performance. Graph paper is not required. [4]
June 2024, Component 1, Q7(c) (2 marks): Determine the growth rate of memory space during a single run of the algorithm. [2]
June 2024, Component 1, Q8 (9 marks): Write an algorithm in pseudo-code to calculate and output the count, sum and mean (average) of any odd values in an unsorted one-dimensional integer array (myAr
June 2024, Component 1, Q11(a) (4 marks): Explain the use of variables and constants in this algorithm. [4]
June 2024, Component 1, Q11(b) (4 marks): Explain the importance of self-documenting identifiers and annotation in this algorithm. [4]
June 2024, AS Component 1, Q7 (6 marks): Presence checks can be used to ensure that the required input is not empty or null. Describe, using examples, three other validation techniques. [6]
June 2024, AS Component 1, Q9(a) (1 mark): State the name given to this type of algorithm. [1]
June 2024, AS Component 1, Q9(b) (6 marks): Describe how this algorithm operates. [6]
June 2024, AS Component 1, Q9(c) (4 marks): Describe two constructs used in this algorithm. [4] CONSTRUCT 1 CONSTRUCT 2
June 2024, AS Component 1, Q10 (7 marks): An algorithm is required to translate English words into their Spanish equivalent. A partial example of the two-dimensional array, called translations, is shown
June 2024, AS Component 2, Q2 (6 marks): Construct a flowchart for the process of searching a list of customers for a specific ID. If the ID is found, the flowchart should output the customer details.
June 2024, AS Component 2, Q5 (8 marks): PVCC stores the details of its range of card prices in an array, which is sorted in order of price (lowest to highest). [8] stockArray[ ]: 0 1 2 3 4 5 6 7 … 0
June 2024, AS Component 2, Q6(b) (12 marks): Create a new form that will allow PVCC to: • input customer details • validate customer details • store customer details on disk in a text file called PVCustome
June 2024, AS Component 2, Q6(c) (4 marks): Using the internal facility of your language, add annotated listings to your code from question 6(b) that would clearly explain the design of your program to an
June 2023, Component 1, Q1(a) (2 marks): Define the term algorithm. [2]
June 2023, Component 1, Q1(b) (2 marks): Describe one method of defining algorithms. [2]
June 2023, Component 1, Q5(a) (5 marks): Evaluate the efficiency of the search algorithm and using Big O notation, determine the growth rate for time performance. [5]
June 2023, Component 1, Q5(b) (2 marks): Determine the rate of memory space used during a single run of the algorithm. [2]
June 2023, Component 1, Q5(c) (4 marks): Identify the type of time complexity and draw a graph of the algorithm above to illustrate the order of time performance. Graph paper is not required. [4]
June 2023, Component 1, Q9 (6 marks): Giving examples, explain the term data compression and describe how data compression algorithms are used. [6]
June 2023, Component 1, Q10 (9 marks): Write an Insertion Sort algorithm in pseudo-code that will sort the contents of a one- dimensional string array (myArray) into ascending order. [9]
June 2023, AS Component 1, Q5(a) (4 marks): Many high-level languages provide programmers with a suite of standard functions. Explain, giving an example, the possible benefits of standard functions. [4]
June 2023, AS Component 1, Q11(a) (2 marks): The algorithm does not work as intended. Identify the error and suggest a suitable change to the algorithm. [2]
June 2023, AS Component 1, Q11(b) (4 marks): Identify and describe the purpose of two different types of repetition used in this algorithm. [4] Repetition Type 1 Lines: to Repetition Type 2 Lines: to
June 2023, AS Component 1, Q11(c) (2 marks): Identify and describe the use of selection in this algorithm. [2] Lines: to
June 2023, AS Component 1, Q11(d) (3 marks): State an alternative type of sorting algorithm and describe the characteristics of your chosen type of sort. [3]
June 2023, AS Component 2, Q4(a) (8 marks): SpringZone stores the prices for booking time within the trampoline park in an array. The prices are calculated depending on how busy the time of year tradition
June 2023, AS Component 2, Q4(b) (8 marks): Each SpringZone customer (adult) is to be given a unique five-digit account number. This consists of a four-digit code and a check digit. To calculate the check
June 2023, AS Component 2, Q5(c)(ii) (12 marks): Create a new form that will allow SpringZone to: • Input child details. • Store the details on disk in a text file called child.txt. • Confirm storage of the de
June 2023, AS Component 2, Q5(c)(iii) (4 marks): Using the internal facility of the IDE, add annotation to your code from question 5(c)(ii) that would clearly explain your program to another software developer
June 2022, Component 1, Q3(a) (5 marks): Evaluate the efficiency of the algorithm and, using Big O notation, determine the growth rate for the time performance. [5]
June 2022, Component 1, Q3(b) (4 marks): Draw a graph of the algorithm above to illustrate its order of time efficiency. Graph paper is not required. [4]
June 2022, Component 1, Q3(c) (2 marks): Determine the growth rate of memory use during a single run of the algorithm. [2]
June 2022, Component 1, Q4(a) (2 marks): Describe the lifetime of variable m in the function straightLine. [2]
June 2022, Component 1, Q4(b) (2 marks): Describe the scope of variable y. [2]
June 2022, Component 1, Q6(a) (2 marks): 6. Describe the purpose of the following mathematical operations in algorithms. (a) DIV [2]
June 2022, Component 1, Q6(b) (2 marks): 6. Describe the purpose of the following mathematical operations in algorithms. (b) MOD [2]
June 2022, Component 1, Q6(c)(i) (2 marks): Explain the purpose of the algorithm. [2]
June 2022, Component 1, Q6(c)(ii) (2 marks): Explain the use of sequence in the algorithm. [2]
June 2022, Component 1, Q6(c)(iii) (2 marks): Explain the use of selection in the algorithm. [2]
June 2022, Component 1, Q10 (9 marks): Write a Bubble Sort algorithm in pseudo-code that will sort the contents of a one-dimensional integer array (myArray) into descending order. [9]
June 2022, AS Component 1, Q7(a) (1 mark): State the name given to this type of algorithm. [1]
June 2022, AS Component 1, Q7(b) (2 marks): Describe why the function DIV is used in line 7 instead of the division symbol /. [2]
June 2022, AS Component 1, Q7(c) (4 marks): Complete the following table by identifying two parameters used in Function X and their purpose. [4] Parameter Purpose
June 2022, AS Component 1, Q9 (7 marks): Write an algorithm, using pseudo-code, which converts a denary value between 0–1510 to a 4-bit binary value. [7]
June 2022, AS Component 2, Q4(a) (4 marks): PP uses wood in its stone ovens to cook the pizzas. Wood burns quickly (two and a half bags per hour) and so PP needs to keep sufficient stock of dried wood to
June 2022, AS Component 2, Q4(b) (8 marks): PP intends to use a linear search algorithm to search the array. Write a linear search algorithm that would be suitable for PP to use to search the array called
June 2022, AS Component 2, Q5(b) (12 marks): Create a new form that will allow PP to: • Input manager details • Store the details on disk in a text file called manager.txt • Confirm storage of the details
Autumn 2021, Component 1, Q3(a) (5 marks): Evaluate the efficiency of the search algorithm and, using Big O notation, determine the growth rate for time performance. [5]
Autumn 2021, Component 1, Q3(b) (2 marks): Determine the growth rate of memory space during a single run of the algorithm. [2]
Autumn 2021, Component 1, Q3(c) (4 marks): Identify the type of time complexity and draw a graph of the algorithm opposite to illustrate the order of time performance. Graph paper is not required. [4]
Autumn 2021, Component 1, Q10 (9 marks): Write a quicksort algorithm in pseudo-code that will sort the contents of a one-dimensional integer array (myArray) in ascending order. [9]
Autumn 2020, Component 1, Q1(a) (4 marks): Giving an example, describe the characteristics of a recursive sorting algorithm. [4]
Autumn 2020, Component 1, Q1(b) (2 marks): Describe two advantages of non-recursive sorting algorithms. [2]
Autumn 2020, Component 1, Q3 (8 marks): Giving one example for each, describe why the following are important in programs: • self-documenting identifiers • annotation • program layout [8]
Autumn 2020, Component 1, Q5(a) (5 marks): Evaluate the efficiency of the search algorithm and using Big O notation, determine the growth rate for time performance. [5]
Autumn 2020, Component 1, Q5(b) (2 marks): Determine the growth rate of memory space during a single run of the algorithm. [2]
Autumn 2020, Component 1, Q5(c) (4 marks): Identify the type of time complexity and draw a graph of the algorithm above to illustrate the order of time performance. Graph paper is not required. [4]
Autumn 2020, Component 1, Q10 (9 marks): Write a Binary Search algorithm in pseudo-code that will search the contents of a one-dimensional string array (myArray) for a key value, and if found output th
Autumn 2020, Component 1, Q11 (4 marks): This is an algorithm that validates an email address: Algorithm Validate declare email as char[] declare i as integer declare count1 as integer declare count2 a
Autumn 2020, AS Component 1, Q4 (6 marks): The following algorithm determines the highest mark from a series of marks input by a teacher. 1 set highest = 0 2 3 loop 4 input mark 5 6 if mark > highest the
Autumn 2020, AS Component 1, Q7 (7 marks): Parkwood Vale Primary School wants to create a computer program for its pupils which allows the user to input a number between 1 and 10 inclusive and output the
Autumn 2020, AS Component 1, Q9(a)(i) (3 marks): (3) (4) (5) (6) SearchValue = 8 (a) Explain how the following search algorithms would work with myArray when searching for SearchValue. (i) Linear search. [3]
Autumn 2020, AS Component 1, Q9(a)(ii) (4 marks): 9. The following data is stored in myArray. myArray 1 4 5 6 8 10 11 (0) (1) (2) (3) (4) (5) (6) SearchValue = 8 (ii) Binary search. [4]
Autumn 2020, AS Component 1, Q9(b) (2 marks): Give two conditions where a linear search would be preferred to a binary search. [2]
Autumn 2020, AS Component 2, Q3(a) (8 marks): Met wishes to model the potential increase in sales arising should it offer each tenant a discount for introducing Met to other potential customers. Met has the
Autumn 2020, AS Component 2, Q3(b) (8 marks): Met are considering using an array to store tenant data. They will need to search for items within the array. The array will not be sorted as data will be added
Autumn 2020, AS Component 2, Q4(c)(iii) (12 marks): Create a new form or program that will allow Met to: • Input tenant details • Validate tenant details • Store tenant details on disk in a text file called tenan
Autumn 2020, AS Component 2, Q4(c)(iv) (4 marks): Using the internal facility of the IDE, add annotation to your code from question 4(c)(iii) that would clearly explain the design of your program to another sof
June 2019, Component 1, Q2(a) (5 marks): Evaluate the efficiency of the algorithm and, using Big O notation, determine the growth rate for the time performance. [5]
June 2019, Component 1, Q2(b) (3 marks): Draw a graph of the algorithm above to illustrate its order of time efficiency. Graph paper is not required. [3]
June 2019, Component 1, Q2(c) (2 marks): Determine the growth rate of memory space during a single run of the algorithm. [2]
June 2019, Component 1, Q5(a) (4 marks): Explain the purpose of procedures in algorithms. [4]
June 2019, Component 1, Q5(b) (4 marks): Explain what is meant by parameter passing by reference and by value. [4] Below is an algorithm. Algorithm Trapezium declare function trapeziumArea(x,y,z) TArea
June 2019, Component 1, Q5(c) (2 marks): Describe the lifetime of variable TArea. [2]
June 2019, Component 1, Q5(d) (2 marks): Describe the scope of variable a. [2]
June 2019, Component 1, Q9 (7 marks): Write an insertion sort algorithm in pseudo-code that will sort the contents of a one-dimensional integer array (myArray) into ascending order. [7]
June 2019, Component 1, Q10(a) (2 marks): Giving an example, explain the purpose of validation. [2]
June 2019, Component 1, Q10(b) (2 marks): Giving an example, explain the purpose of verification. [2]
June 2019, AS Component 1, Q5 (7 marks): Write an algorithm, using pseudo-code, which will allow chemistry students to input the group number (1-18) and the period number (1-7) of an element in the par
June 2019, AS Component 2, Q3 (8 marks): IceZone wishes to avoid bookings being accidently entered twice by searching for identical booking IDs in sequential time slots. They have a pre-populated array
June 2019, AS Component 2, Q4 (8 marks): IceZone has to maintain strict temperature controls over the skating surface. Using a recognised convention, design an algorithm to help IceZone control the tem
June 2019, AS Component 2, Q5(c)(ii) (12 marks): Create a new form or program that will allow IceZone to implement the algorithm you designed as part of Question 4: • Input a temperature. • If the value is 100
June 2019, AS Component 2, Q5(c)(iii) (8 marks): Using the internal facility of the IDE, add annotation to your code from question 5(c)(ii) that would clearly explain the design of your program to another soft
June 2018, Component 1, Q6(a) (2 marks): Explain what is meant by a shortest path algorithm. [2]
June 2018, Component 1, Q6(b)(i) (3 marks): Draw a labelled diagram of the network. [3]
June 2018, Component 1, Q6(b)(ii) (2 marks): State the shortest path from node A to node G and calculate its cost. [2]
June 2018, Component 1, Q9(a) (2 marks): Describe the effect of the use of a selection construct. [2]
June 2018, Component 1, Q9(b) (2 marks): Explain, with reference to selection constructs, what is meant by the term nested. [2]
June 2018, Component 1, Q10 (9 marks): All employees who earn more than a certain amount must pay National Insurance, which is calculated as a percentage of their earnings. Monthly wage National Insu
June 2018, Component 1, Q12(a)(i) (1 mark): Identify the order of efficiency of the algorithm illustrated by the above graph. [1]
June 2018, Component 1, Q12(a)(ii) (1 mark): Give an example of an algorithm with this order of efficiency. [1]
June 2018, Component 1, Q12(b) (3 marks): Draw a graph of an algorithm with an order of efficiency O(N). Graph paper is not required. [3]
June 2018, Component 1, Q12(c) (2 marks): Describe an example of an algorithm with an order of efficiency O(N2). [2]
June 2018, Component 1, Q12(d) (3 marks): Explain the relationship between the size of the input data and the time required to complete the algorithm shown in the graph below. [3] Size of data
June 2018, AS Component 1, Q8 (7 marks): Betty’s Bakery wants to convert imperial measurements for weight (lb) into metric measurements (kg). The conversion from pounds into kilograms is: 1 lb = 0.4535
June 2018, AS Component 1, Q11(a) (2 marks): Describe the term sequence in algorithms. [2]
June 2018, AS Component 1, Q11(b) (2 marks): Describe how insertion sort algorithms operate. [2]
June 2018, AS Component 1, Q11(c) (2 marks): Explain why the insertion sort algorithm in this question will fail. [2]
June 2018, AS Component 1, Q11(d) (1 mark): Suggest a suitable change that could be made to the algorithm to overcome this problem. [1]
June 2018, AS Component 1, Q11(e) (3 marks): Name and describe a different sort algorithm. [3]
June 2018, AS Component 2, Q3 (8 marks): StarLight Coffee have decided to incentivise the purchase of certain products by offering differing numbers of points for different products. StarLight Coffee u
June 2018, AS Component 2, Q4 (12 marks): StarLight Coffee has decided to award a ‘pm bonus’ to customers who purchase coffees during the afternoon. Using a recognised convention, design an algorithm to
June 2018, AS Component 2, Q5(c)(ii) (12 marks): Create a new form that will allow StarLight Coffee to: • Input whole integer numbers 1 to 9 • Carry out the addition (+) operator • Carry out the subtraction (-
June 2018, AS Component 2, Q5(c)(iii) (4 marks): Using the internal facility of Python, add annotated listings to your code from question 5(c)(ii) that would clearly explain the design of your program to anoth
June 2017, Component 1, Q6(a) (2 marks): + Square(b)) output “The length of the hypotenuse is “, hypotenuse endproc start call MainProg end (a) Identify a variable and a parameter used in the algorithm
June 2017, Component 1, Q6(b) (2 marks): Explain when a value parameter is preferable to a reference parameter. [2]
June 2017, Component 1, Q9 (9 marks): Write a quicksort algorithm in pseudo-code that will sort the contents of a one-dimensional string array (myArray). [9]
June 2017, Component 1, Q10(a) (5 marks): Evaluate the efficiency of the algorithm and, using Big O notation, determine the growth rate for the time performance. [5]
June 2017, Component 1, Q10(b) (2 marks): Determine the growth rate of memory space used by the algorithm. [2]
June 2017, AS Component 1, Q5(a) (3 marks): State what is meant by the term algorithm and give two common methods of defining algorithms. [3]
June 2017, AS Component 1, Q5(b) (7 marks): Write an algorithm that will determine if a positive integer entered is odd or even. Your algorithm should output a suitable error message if the integer entere
June 2017, AS Component 1, Q7(a) (4 marks): The following data is stored in myArray: (0) (1) (2) (3) 1 3 9 2 myArray Show the four effects that this algorithm will have on the data within the array. [4] (
June 2017, AS Component 1, Q7(b) (2 marks): State the name given to this type of sort and describe its function. [2]
June 2017, AS Component 1, Q7(c) (1 mark): Name a logical operator used in the algorithm. [1]
June 2017, AS Component 1, Q7(d) (2 marks): Give an example of selection from the algorithm and state its purpose. [2]
June 2017, AS Component 1, Q7(e) (2 marks): Give an example of repetition from the algorithm and state its purpose. [2]
June 2017, AS Component 1, Q9 (4 marks): Explain lossy data compression techniques. [4]
June 2017, AS Component 2, Q4(a) (4 marks): Copy and complete the table below showing the outputs of the algorithm for the inputs provided. Write your answers correct to one decimal place. [4] Expected Cu
June 2017, AS Component 2, Q4(b) (11 marks): Using a recognised convention, design an algorithm to help Marble Garden Centre control the temperature within one of its greenhouses. The algorithm should repe
June 2017, AS Component 2, Q5(c)(ii) (12 marks): Create a new form that will allow Marble Garden Centre to: • Input customer details • Validate customer details • Store customer details on disc in a text file
June 2017, AS Component 2, Q5(c)(iii) (4 marks): Using the internal facility of your chosen IDE, add annotated listings to your code from question 5(c)(ii) that would clearly explain the design of your program
June 2016, AS Component 1, Q9 (7 marks): Write a linear search algorithm, using pseudo-code, for the following array. (0) (1) (2) (3) (4) (5) (6) 2 7 3 5 8 9 1 myArray Your algorithm should output the
June 2016, AS Component 1, Q13(a) (2 marks): State the name given to this type of sort and describe its function. [2]
June 2016, AS Component 1, Q13(b) (1 mark): The following data is stored in myArray: (0) (1) (2) (3) (4) 1 5 2 6 10 myArray Show the effect that this algorithm will have on the data in the array below. [1
June 2016, AS Component 1, Q13(c)(i) (3 marks): Explain why the algorithm will fail in this case. [3]
June 2016, AS Component 1, Q13(c)(ii) (1 mark): Suggest a suitable change that could be made to the algorithm to overcome this problem. [1]
June 2016, AS Component 2, Q2(a) (1 mark): Using the algorithm above, calculate the reading score for a passage of text where there are 60 syllables, 40 words and 4 sentences. [1]
June 2016, AS Component 2, Q2(c) (4 marks): Below is an improved algorithm, which calculates a reading score for a passage of text. 1 declare readingscore[1..99] is real {array} 2 syllablecount is integer
June 2016, AS Component 2, Q3 (11 marks): Myles-Hill Primary School is staging their annual sports day. Using a recognised convention, design an algorithm to help process the results of a race. There ar
June 2016, AS Component 2, Q4(c)(ii) (12 marks): Create a new file that will allow Myles-Hill Primary School to: • Input staff details • Validate staff details • Store staff details on disc in a text file call
June 2016, AS Component 2, Q4(c)(iii) (4 marks): Using the internal facility of your chosen language, add annotated listings to your code from question 4(c)(ii) that would clearly explain the design of your pr

Questions, mark schemes and examiner’s reports are © WJEC Eduqas, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Full past papers.

Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.

779 questions