7517 · AQA A Level
7517/21
Paper 2
Computer Science · June 2022 · Variant 1
Relative difficulty
Analysis source: AQA
Analysis aligned to the official syllabus and assessment design.
3.6 / 5
200
300 min
Skeleton Program Code Modification and OOP Paradigm Implementation
Cohort performance
Session statistics from official examination reports
Total marks
200
Duration
300 min
Session difficulty
3.6 / 5
Key examiner messages
Top priorities from the principal examiner before you revise
A staggering portion of Paper 1's marks are tied directly to Code Modification (Section D).
The 13-mark TrapCard question (Q14) is where high-performing students shine; it requires overriding the parent class's Process method and handling random collection selection without corrupting parallel states.
In Paper 2, databases (Q7) and floating-point arithmetic (Q5) command the highest technical weight.
Many students drop marks on relational query design, specifically failing to link tables through foreign keys or misapplying date comparison boundaries like 01/01/0001.
Question difficulty map
How candidates performed on each question in this series
No data available in official reports
Assessment objectives
Skill and AO weighting from official examiner commentary
Skill weighting
Shows the skill mix this paper tested most heavily.
Mathematical
Weight: 10100%Logical
Weight: 990%Analysis
Weight: 880%Structured Synthesis
Weight: 770%Modification Algorithmic Construction
Weight: 550%Database &
Weight: 220%Query
Weight: 110%
Method marks watchlist
Where working, steps, or method marks were commonly lost
No data available in official reports
Recurring mistakes across years
Themes examiners flag in multiple recent sessions for this subject
No data available in official reports
Question choice intelligence
Mean scores and popularity for optional questions (HKDSE electives)
No data available in official reports
Level exemplars
What candidate scripts at each grade level looked like
No data available in official reports
Grade & admission context
How marks relate to grade thresholds and entry standards
Report type
Examiner report — national grade boundaries and question-level commentary
Level A*
Approx. 74% of maximum mark
Level A
Approx. 60% of maximum mark
Level B
Approx. 48% of maximum mark
Level C
Approx. 36% of maximum mark
Level D
Approx. 25% of maximum mark
Level E
Approx. 13% of maximum mark
Deep insights
What top candidates did
Techniques and approaches examiners rewarded in this series
No data available in official reports
Command word playbook
How to match each command word to the expected response style
State features in sequence or list observable properties — do not explain causes unless asked.
Give reasons and link mechanism to outcome; each point needs a because/so chain.
Show formula, substitution, and unit; method marks need visible working.
Match the expected response style for “State” questions.
Match the expected response style for “Write” questions.
Match the expected response style for “Complete” questions.
Identify similarities and differences explicitly — paired sentences or a table helps.
Time traps
Sections where candidates spent disproportionate time relative to marks
Min per mark: 2
Min per mark: 1.9
Min per mark: 1.5
Min per mark: 1.5
Min per mark: 1
Syllabus traceability
Topics linked to questions and mark weighting in this session
Programming (Fundamentals of programming)
42 marks this session
Programming paradigms (Fundamentals of programming)
18 marks this session
Graph-traversal (Fundamentals of algorithms)
15 marks this session
Individual (moral), social (ethical), legal and cultural issues and opportunities
12 marks this session
MCQ trap analytics
Commonly chosen wrong options from examiner commentary
No data available in official reports
Topic heatmap across years
Mark concentration by topic and exam year for this subject
Mark intensity
Programming (Fundamentals of programming)
Programming paradigms (Fundamentals of programming)
Structure and role of the processor and its components (Fundamentals of computer organisation and architecture)
The Internet (Fundamentals of communication and networking)
Graph-traversal (Fundamentals of algorithms)
Individual (moral), social (ethical), legal and cultural issues and opportunities
Difficulty trend
How session difficulty has shifted across recent years
Paper comparison
Marks and duration breakdown across papers in this session
Paper 1 (7517/1):
Paper 2 (7517/2):
Marks you can still earn
Where valid approaches outside the mark scheme may still gain credit
No data available in official reports
Practise what examiners flagged
Target weak topics from this report inside the Revui app
Programming (Fundamentals of programming)
42 marks this session
Practise in RevuiProgramming paradigms (Fundamentals of programming)
18 marks this session
Practise in RevuiGraph-traversal (Fundamentals of algorithms)
15 marks this session
Practise in RevuiIndividual (moral), social (ethical), legal and cultural issues and opportunities
12 marks this session
Practise in RevuiSelf-diagnostic checklist
Key actions before you sit this paper — copy and tick off as you revise
- 1Message
A staggering portion of Paper 1's marks are tied directly to Code Modification (Section D).
- 2Message
The 13-mark TrapCard question (Q14) is where high-performing students shine; it requires overriding the parent class's Process method and handling random collection selection without corrupting parallel states.
- 3Message
In Paper 2, databases (Q7) and floating-point arithmetic (Q5) command the highest technical weight.
- 4Message
Many students drop marks on relational query design, specifically failing to link tables through foreign keys or misapplying date comparison boundaries like 01/01/0001.
Teacher briefing pack
One-page session summary for tutors and classroom review
June 2022 2022
Computer Science
A staggering portion of Paper 1's marks are tied directly to Code Modification (Section D). The 13-mark TrapCard question (Q14) is where high-performing students shine; it requires overriding the parent class's Process method and handling random collection selection without corru
A staggering portion of Paper 1's marks are tied directly to Code Modification (Section D).
The 13-mark TrapCard question (Q14) is where high-performing students shine; it requires overriding the parent class's Process method and handling random collection selection without corrupting parallel states.
In Paper 2, databases (Q7) and floating-point arithmetic (Q5) command the highest technical weight.
- Total marks
- 200
- Duration
- 300 min
- Session difficulty
- 3.6 / 5
Session analysis
A staggering portion of Paper 1's marks are tied directly to Code Modification (Section D). The 13-mark TrapCard question (Q14) is where high-performing students shine; it requires overriding the parent class's Process method and handling random collection selection without corrupting parallel states. In Paper 2, databases (Q7) and floating-point arithmetic (Q5) command the highest technical weight. Many students drop marks on relational query design, specifically failing to link tables through foreign keys or misapplying date comparison boundaries like 01/01/0001.
Updated Jun 14, 2026
Paper breakdown
Paper 1 (7517/1):
Paper 2 (7517/2):
Top chapters
Exam structure insights
Marks by chapter
See where the marks were concentrated so revision time goes to the highest-value topics.
Mark accessibility
Estimate which marks were basic, mid-level, or high-difficulty.
80% within easy or medium reach
Command word frequency
Spot common command words so answers match the expected response style.
Question type mix
Compare the mark share of each paper section and question type.
Structured / Short Answer
114·25·57%
Programming / Code Modification
52·5·26%
Multiple Choice / Lozenges
22·10·11%
Extended Essay
12·1·6%
Study ROI
Bigger bubbles recur more often; higher bubbles carry more marks, helping you rank revision priorities.
Time vs marks
Compare marks with suggested time allocation to plan exam pacing.
Paper 1 Section A (
1.00 m/minPaper 1 Section B (
0.65 m/minPaper 1 Section C (
0.50 m/minPaper 1 Section D (
0.53 m/minPaper 2 Theory Block
0.67 m/minTotal marks
200
Total time
300 min
Avg pace
0.67
Cumulative marks ladder
The line is your running mark total question by question; dashed lines are the estimated grade cut-offs. See which question the line crosses your target grade at, so you know how far you must answer cleanly and which questions decide a band.
Next-year prediction
Topics worth watching next year, with the reason shown directly below each bar.
Regular Expressions and State Machines
85%85%
A* Search and Optimisation Algorithms
80%80%
Big Data Characteristics
75%75%
Examiner notes & key calculations
- The 'Hex is Compact' Misconception: Examiners frequently note that students falsely claim hexadecimal 'takes up less memory/storage' than binary. Hexadecimal is simply a human-friendly notation; in storage, the data remains identical binary bits.
- De Morgan's Simplification: When simplifying A‾+B⋅C+B⋅C‾ \overline{A} + B \cdot C + B \cdot \overline{C} A+B⋅C+B⋅C, candidates often break bars incorrectly or lose track of intermediate logical operations instead of grouping the common B B B term to find C+C‾=1 C + \overline{C} = 1 C+C=1.
- Entity Relationship Lines: Failing to place the 'crows-foot' (many side) on the correct table. The junction table AnimalLocation must contain the 'many' indicators linking to both parent tables.
Analysis is paraphrased for study purposes. Always verify against the official examiner report and mark scheme.