0478 · Cambridge IGCSE
0478/23
Algorithms, Programming and Logic
Computer Science · June 2024 · Variant 3
Relative difficulty
Analysis source: Cambridge Assessment International Education
3.2 / 5
150
210 min
Algorithm Design, Tracing, and Parallel Arrays Sorting
Cohort performance
Session statistics from official examination reports
Total marks
150
Duration
210 min
Session difficulty
3.2 / 5
Key examiner messages
Top priorities from the principal examiner before you revise
In Paper 13, significant marks were concentrated in the high-tariff Web Page Retrieval Process (DNS) question (6 marks) and CPU Architecture / Performance Factors (13 marks total).
Students who memorized precise sequences for DNS lookup and the role of the FDE cycle secured easy marks.
Conversely, marks were frequently lost in the Two's Complement calculation and the Serial Half-Duplex Diagram annotation due to sloppy wire labelling and missing directional arrows.
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.
Precise Technical Description
Weight: 8100%Processing Mathematical
Weight: 675%Array Manipulation
Weight: 450%Syntax Execution
Weight: 225%
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
Cambridge Principal Examiner Report — component performance and international standards
Level A*
Approx. 73% of maximum mark
Level A
Approx. 59% of maximum mark
Level B
Approx. 45% of maximum mark
Level C
Approx. 31% of maximum mark
Level D
Approx. 26% of maximum mark
Level E
Approx. 21% 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
Match the expected response style for “State” questions.
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.
Name or point to the specific feature asked for — avoid extra explanation.
Match the expected response style for “Give” questions.
Match the expected response style for “Write” questions.
Time traps
Sections where candidates spent disproportionate time relative to marks
Min per mark: 2
Min per mark: 1.5
Min per mark: 1.3
Min per mark: 1.2
Min per mark: 1.2
Syllabus traceability
Topics linked to questions and mark weighting in this session
Algorithm design and problem-solving
34 marks this session
Number systems
13 marks this session
Computer architecture
13 marks this session
Arrays
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
Algorithm design and problem-solving
Programming concepts
Arrays
Cyber security
Robotics
Methods of error detection
The internet and the world wide web
Data storage
Paper comparison
Marks and duration breakdown across papers in this session
Paper 1 Computer Systems (0478/13):
Paper 2 Algorithms, Programming and Logic (0478/23):
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
Algorithm design and problem-solving
34 marks this session
Practise in RevuiNumber systems
13 marks this session
Practise in RevuiComputer architecture
13 marks this session
Practise in RevuiArrays
12 marks this session
Practise in RevuiSelf-diagnostic checklist
Key actions before you sit this paper — copy and tick off as you revise
- 1Message
In Paper 13, significant marks were concentrated in the high-tariff Web Page Retrieval Process (DNS) question (6 marks) and CPU Architecture / Performance Factors (13 marks total).
- 2Message
Students who memorized precise sequences for DNS lookup and the role of the FDE cycle secured easy marks.
- 3Message
Conversely, marks were frequently lost in the Two's Complement calculation and the Serial Half-Duplex Diagram annotation due to sloppy wire labelling and missing directional arrows.
Teacher briefing pack
One-page session summary for tutors and classroom review
June 2024 2024
Computer Science
In Paper 13, significant marks were concentrated in the high-tariff Web Page Retrieval Process (DNS) question (6 marks) and CPU Architecture / Performance Factors (13 marks total). Students who memorized precise sequences for DNS lookup and the role of the FDE cycle secured easy
In Paper 13, significant marks were concentrated in the high-tariff Web Page Retrieval Process (DNS) question (6 marks) and CPU Architecture / Performance Factors (13 marks total).
Students who memorized precise sequences for DNS lookup and the role of the FDE cycle secured easy marks.
Conversely, marks were frequently lost in the Two's Complement calculation and the Serial Half-Duplex Diagram annotation due to sloppy wire labelling and missing directional arrows.
- Total marks
- 150
- Duration
- 210 min
- Session difficulty
- 3.2 / 5
Session analysis
In Paper 13, significant marks were concentrated in the high-tariff Web Page Retrieval Process (DNS) question (6 marks) and CPU Architecture / Performance Factors (13 marks total). Students who memorized precise sequences for DNS lookup and the role of the FDE cycle secured easy marks. Conversely, marks were frequently lost in the Two's Complement calculation and the Serial Half-Duplex Diagram annotation due to sloppy wire labelling and missing directional arrows.
Updated Jun 13, 2026
Paper breakdown
Paper 1 Computer Systems (0478/13):
Paper 2 Algorithms, Programming and Logic (0478/23):
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.
77% 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.
Descriptive / Short Answer
62·22·41%
Pseudocode Bug Fixing & Writing
19·5·13%
Matching & Checkboxes
17·4·11%
Conversions & Calculations
15·6·10%
Large Scenario Programming
15·1·10%
Trace Tables & Diagram Completion
14·3·9%
SQL Queries
8·2·5%
Study ROI
Bigger bubbles recur more often; higher bubbles carry more marks, helping you rank revision priorities.
Difficulty trend
Compare difficulty across recent years.
Time vs marks
Compare marks with suggested time allocation to plan exam pacing.
P1 Data representat
0.83 m/minP1 Networks, Securi
0.67 m/minP2 Boolean Logic, D
0.86 m/minP2 Flowchart Trace,
0.75 m/minP2 Q9 Scenario sort
0.50 m/minTotal marks
150
Total time
210 min
Avg pace
0.71
Next-year prediction
Topics worth watching next year, with the reason shown directly below each bar.
Robotics & Artificial Intelligence
5%5%
Methods of Error Detection (Parity, Checksum, Check digit)
5%5%
Translators (Compilers vs Interpreters vs Assemblers)
4%4%
Examiner notes & key calculations
- Binary vs. Denary Prefixes: Confusing kibibytes (KiB) and kilobytes (KB). Calculating 2×10002 \times 10002×1000 instead of 2×10242 \times 10242×1024 for kibibytes in a mebibyte is a common error.
- Operating System Roles: Confusing memory management with file storage or device driver coordination.
- SQL WHERE Clause Strings: Writing text criteria without quotes (e.g., WHERE Airworthy = Y instead of 'Y') or mismatching fields.
- Flowchart Trace Division: Truncating decimals or omitting the final output line after loop termination in the trace table.
Exam tips
Paper format
- Duration
- 1h 45min
- Total marks
- 75
- Weighting
- 50%
- Question types
- Trace tables & Diagrams, Pseudocode writing, Scenario-based coding (2D Array), SQL and Database tasks
Analysis is paraphrased for study purposes. Always verify against the official examiner report and mark scheme.