Eduqas A-level Computer Science (A500QS): papers, programmed solution and grade boundaries
A-level Computer Science
Start today's paperPaper resets in
Eduqas A-level Computer Science at a glance
WJEC Eduqas is the exam board that offers WJEC qualifications in England. Its A-level Computer Science (entry code A500QS) is regulated by Ofqual, taught from 2015 and first awarded in 2017. It is linear, and the exams are sat in the summer series each year.
| Component | Title | Time | Share of A-level |
|---|---|---|---|
| 1 | Programming and System Development | 2 h 45 min | 40% |
| 2 | Computer Architecture, Data, Communication and Applications | 2 h 45 min | 40% |
| 3 | Programmed Solution to a Problem (non-exam assessment) | Over an extended period | 20% |
Each component is marked out of 100. Eduqas then applies a scaling factor of 2 to Components 1 and 2, so the qualification total is 500 marks: 200, 200 and 100.
What each component covers
Component 1: Programming and System Development
This paper investigates programs, data structures, algorithms, logic, programming methodologies and the impact of computer science on society. The headings are data structures, logical operations, algorithms and programs (including sorting, searching and Big O notation), principles of programming, systems analysis, system design, software engineering, program construction, and economic, moral, legal, ethical and cultural issues.
Component 2: Computer Architecture, Data, Communication and Applications
This paper investigates computer architecture, communication, data representation, the organisation and structure of data, programs, algorithms and software applications. The headings are hardware and communication, data transmission, data representation and data types, organisation and structure of data, databases and distributed systems, the operating system, the need for different types of software systems, and data security and integrity processes.
Component 3: Programmed Solution to a Problem
You choose a problem that must be solved with original code, then discuss, investigate, design, prototype, refine, implement, test and evaluate a computerised solution. It is marked against banded mark schemes and carries 100 raw marks. The evidence is a substantial piece of work, so start early and keep records of your test runs and feedback from third parties as you go.
Pseudocode and the maths of computing
Eduqas expects you to describe algorithms using pseudocode, including the DIV and MOD operators, and to use Big O notation to compare the efficiency of searches and sorts. Both papers can also test hexadecimal and binary, floating point form, normalisation to third normal form and SQL, so practise these by hand.
Worked examples in Eduqas style
Data representation: converting with DIV and MOD
Convert the denary number 37 to binary by repeatedly dividing by 2:
| Number | DIV 2 | MOD 2 |
|---|---|---|
| 37 | 18 | 1 |
| 18 | 9 | 0 |
| 9 | 4 | 1 |
| 4 | 2 | 0 |
| 2 | 1 | 0 |
| 1 | 0 | 1 |
Read the remainders from bottom to top: 37 = 100101 in binary. Check: 32 + 4 + 1 = 37. Practise searching algorithms in our course:
Type log base 2 of a list size, or the list size from a number of halvings.
Press Mark to have your answer marked in the Search Algorithms course.
Algorithms: a bubble sort pass
Sort 7, 3, 9, 4 into ascending order. In pass 1 compare each neighbouring pair and swap if the first is bigger: 7 and 3 swap, giving 3, 7, 9, 4; 7 and 9 stay; 9 and 4 swap, giving 3, 7, 4, 9. Pass 2 gives 3, 4, 7, 9, and pass 3 makes no swaps, so the list is sorted. Bubble sort compares neighbours in nested loops, so its time complexity is O(n²).
Efficiency: linear and binary search
A linear search of n items takes O(n) comparisons. A binary search needs a sorted list and halves the search space each step, so it takes O(log n): a list of 1000 items needs at most 10 comparisons, since 2¹⁰ = 1024. State the condition that the list must be sorted.
How Eduqas differs from OCR
Both boards offer a linear A-level in Computer Science with an extended programming project worth 20%. Eduqas has two 2 hour 45 minute papers and a project marked out of 100, while OCR has two 2 hour 30 minute papers of 140 marks and a project marked out of 70. The names and splits of the papers differ, so use past papers from your own board. The OCR A-level Computer Science guide covers the other course.
Grades and June 2026 grade boundaries
Eduqas scales your marks and adds them into a total out of 500, then compares it with the qualification boundaries. Component boundaries are on the raw 100 marks and are notional, a guide for analysis rather than official grades. This table is from Eduqas’ GCE A Level Grade Points document for June 2026. Eduqas says it releases boundaries on results day after awarding.
| Paper | Max | A* | A | B | C | D | E |
|---|---|---|---|---|---|---|---|
| Component 1 (A500U10) | 100 | 79 | 68 | 56 | 44 | 32 | 20 |
| Component 2 (A500U20) | 100 | 79 | 70 | 58 | 46 | 33 | 21 |
| Component 3 (A500U30) | 100 | 79 | 73 | 63 | 53 | 45 | 35 |
| Overall (A500QS) | 500 | 395 | 349 | 291 | 233 | 175 | 117 |
Worked through: raw marks of 70, 62 and 78 scale to 140, 124 and 78, giving 342 out of 500. That is above the grade B boundary of 291 and 7 marks short of an A (349).
Using the daily paper as a short timed mock
Uni-Sine publishes a free daily Computer Science Advanced paper, with a new one every day. It is a short timed paper of 8 questions worth 25 to 35 marks, marked instantly with worked answers. It is not an Eduqas paper and it is much shorter than a 2 hour 45 minute paper.
- It covers well: processor architecture, number representation and floating point, data structures, networking, databases and SQL, regular expressions, recursion, object oriented programming, searching and sorting, finite state machines and graph traversal.
- It does not cover: the programmed solution or the long structured questions of the written papers. Use Eduqas past papers for those. See our A-level mocks guide and the A-level Computer Science guide.
Exam answers
Uni-Sine does not publish official answers or mark schemes for Eduqas A-level Computer Science papers. The answers and a worked mark scheme for each question come with today’s paper once you have submitted it and it has been marked, so you can see where every mark was won or lost.
Common mistakes in Eduqas A-level Computer Science
- Forgetting that binary search needs a sorted list.
- Quoting Big O without justifying it. Say which loop or halving step gives the complexity.
- Writing code with no structure in extended answers. Use indentation and meaningful names.
- Leaving the programmed solution late. Testing and evaluation need real evidence and time.
- Mixing up normal forms. Learn what each of first, second and third normal form removes.
Common questions
Is Eduqas A-level Computer Science the same as WJEC A-level Computer Science?
How many papers are there in Eduqas A-level Computer Science?
How is Eduqas A-level Computer Science marked overall?
What were the Eduqas A-level Computer Science grade boundaries in June 2026?
What is the programmed solution?
Revision cards
Say the answer first, then flip the card to check it.
Where to go next
- Solve it
Number Base Converter
Convert between binary, hex and decimal and add in binary
Open the tool - Learn it
Search Algorithms
Linear, binary, depth-first and beyond: find data fast with the right algorithm
Start the course - Test it
A-level Computer Science
A new exam-style paper every day, with instant marking and a mark scheme
Start today's paper