Question 1 of 3 · No calculator needed
When does an XOR (EOR) gate output 1?
A two-input XOR gate outputs 1 for 01 and 10, but outputs 0 when its inputs are equal at 00 or 11.
Cambridge IGCSE · International GCSEComputer Science,
Computer Science,
one step at a time.
Specification 0478. Explore a topic, practise the skill, and see where to focus next.
Try three questions →Explore the topic map ↓120original questions
10mapped areas
Cambridge IGCSE · 0478LearningP is independent of Cambridge IGCSE. Use the current official documents for assessment requirements.
TRY IT TOGETHER · NO SIGN-UP
Three questions. See the difference.
Try three different Computer Science skills from this Cambridge IGCSE route. See what went right, understand a mistake, and find a useful next step.
3questions · 3 skills
A small preview of how LearningP turns answers into a clearer learning picture for students and parents.
Question 2 of 3 · No calculator needed
What denary value is represented by the positive binary integer 101101?
The place values set to 1 are 32, 8, 4 and 1. Their sum is 32 + 8 + 4 + 1 = 45.
Question 3 of 3 · No calculator needed
Seven data bits contain three 1s. An even-parity bit is added. What must the parity bit be?
Three 1s is odd. Setting the parity bit to 1 produces four 1s in total, which satisfies even parity.
These tiles show your answers to three questions. They are a starting point, not a mastery score or grade prediction.
Boolean logic
Correct answer: When its two inputs are different
A two-input XOR gate outputs 1 for 01 and 10, but outputs 0 when its inputs are equal at 00 or 11.
Data representation
Correct answer: 45
The place values set to 1 are 32, 8, 4 and 1. Their sum is 32 + 8 + 4 + 1 = 45.
Data transmission
Correct answer: 1
Three 1s is odd. Setting the parity bit to 1 produces four 1s in total, which satisfies even parity.
For parents: look at the explanation together. A correct answer is encouraging; a missed answer gives you something specific to work on. Broader practice over time is needed to understand progress.
YOUR TOPIC MAP
10 areasFind your starting point.
01Data representation
Specification reference: 1
A higher sample rate captures changes in the waveform more frequently, while greater resolution records amplitude more precisely. Both improve fidelity but increase storage and transmission requirements.
Watch for: Do not describe Data representation vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
02Data transmission
Specification reference: 2
USB standardises connection and communication, commonly supports plug-and-play detection and can provide power. Shared bandwidth and connector or version differences can still be limitations.
Watch for: Do not describe Data transmission vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
03Hardware
Specification reference: 3
Solid-state storage has no moving mechanical parts, making it more resistant to movement and typically faster than magnetic or optical alternatives, though cost per capacity may be higher.
Watch for: Do not describe Hardware vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
04Software
Specification reference: 4
The conflict is created by software processes competing for memory, so operating-system scheduling, protection and interrupt handling should be investigated rather than unrelated display or network hardware.
Watch for: Do not describe Software vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
05The internet and its uses
Specification reference: 5
Attackers can place convincing words before the true registered domain. Urgency and credential requests are warning signs, so the user should independently navigate to the genuine service.
Watch for: Do not describe The internet and its uses vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
06Automated and emerging technologies
Specification reference: 6
Automation can process traffic conditions consistently and continuously, but faulty inputs, software errors and exceptional events could create unsafe outputs unless redundancy and manual fallback exist.
Watch for: Do not describe Automated and emerging technologies vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
07Algorithm design and problem-solving
Specification reference: 7
The plan covers a normal accepted value, both accepted extremes, rejected values just outside both boundaries and abnormal type data, so it tests acceptance and rejection paths.
Watch for: Do not describe Algorithm design and problem-solving vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
08Programming
Specification reference: 8
Parameters make data flow explicit, while local variables exist only within the subroutine. Meaningful identifiers, appropriate procedures and relevant comments also make the redesigned program easier to maintain.
Watch for: Do not describe Programming vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
09Databases
Specification reference: 9
Codes can contain letters and leading zeros, descriptions are text, prices may contain fractions and stock is counted in whole units. ProductCode can uniquely identify rows.
Watch for: Do not describe Databases vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
10Boolean logic
Specification reference: 10
Both conditions must be true simultaneously, which is exactly the behaviour of AND. OR would also trigger when only one condition was true.
Watch for: Do not describe Boolean logic vaguely. Trace the algorithm, data or system state precisely and test boundary or failure cases.
No matching topics. Try another search.
The details, when you need them.
Your exact course
Cambridge IGCSE · International GCSE · Computer Science · 0478
2026-2028 syllabus, version 5; December 2025 web-link-only update applied
Source checked: 2026-08-28. The current official specification controls assessment requirements and option choices.
Can parents and students try LearningP before signing up?
Yes. This page offers three original questions from three different skills on this exact course. Each answer has an explanation, followed by a sample heatmap showing what was correct and what to revisit. No account is needed, and taster answers are not saved.
What does the three-question heatmap tell a parent?
It shows the outcome of these three answers and gives a specific skill to discuss or practise next. It is not a full assessment, a mastery score or a grade prediction. Broader practice over time is needed to understand progress.
What does the Cambridge IGCSE International GCSE Computer Science route cover?
LearningP currently maps 10 assessed areas for specification 0478. The visible topic map below is derived from the verified route; the current official specification remains controlling.
How many LearningP questions support this route?
The verified source bank contains 120 original LearningP question records for this route. Every mapped area meets the current publication minimum and passed the latest blocker and review audit.
Does LearningP reproduce official exam questions?
No. LearningP uses official specifications and assessment materials to map content and demand, while its practice questions and explanations are independently authored.
Can this page predict an exam grade?
No. LearningP reports practice evidence, coverage, strengths and gaps. It does not guarantee or automatically predict examination outcomes.
Where should current assessment information be checked?
Use the official Cambridge IGCSE specification and assessment-resource pages linked on this page, together with information supplied by the learner’s school.
ONE USEFUL NEXT STEP
Open practice ↗