IB Computer Science HL · 2027 specimen
Computer Science HL Paper 3
1 past paper questions from 1 papers across 1 exam session. See what repeats, then practise the same skills with AI marking.
Original Exam Vault questions with AI markscheme feedback for this topic.
By paper:Paper 1Paper 2Paper 3All papers
HL archive · from 2026
Paper 3
Latest exam session: May 2026
- questions
- questions
- papers
- papers
- exam session
- exam session
Where Paper 3 marks go, by unit
In syllabus order. The ring is the share of the marks each one carries.
Exam pattern
How often each micro-topic has been examined, year by year. Each label is explained under the grid.
Does it repeat?
Questions per year for each micro-topic, including those with no matches in this archive.
fewermore
| Micro-topic | 2014 | 2015 | 2016 | 2017 | 2019 | 2020 | 2023 | 2024 | 2025 | 2026 | 2027 |
|---|---|---|---|---|---|---|---|---|---|---|---|
| ·Network topologies, 2014: 0 questions | ·Network topologies, 2015: 0 questions | ·Network topologies, 2016: 0 questions | ·Network topologies, 2017: 0 questions | ·Network topologies, 2019: 0 questions | ·Network topologies, 2020: 0 questions | ·Network topologies, 2023: 0 questions | ·Network topologies, 2024: 0 questions | ·Network topologies, 2025: 0 questions | 1Network topologies, 2026: 1 question | ·Network topologies, 2027: 0 questions | |
| ·Static vs dynamic structures, 2014: 0 questions | ·Static vs dynamic structures, 2015: 0 questions | ·Static vs dynamic structures, 2016: 0 questions | ·Static vs dynamic structures, 2017: 0 questions | ·Static vs dynamic structures, 2019: 0 questions | ·Static vs dynamic structures, 2020: 0 questions | ·Static vs dynamic structures, 2023: 0 questions | ·Static vs dynamic structures, 2024: 0 questions | ·Static vs dynamic structures, 2025: 0 questions | ·Static vs dynamic structures, 2026: 0 questions | ·Static vs dynamic structures, 2027: 0 questions | |
| ·Functions and modularity, 2014: 0 questions | ·Functions and modularity, 2015: 0 questions | ·Functions and modularity, 2016: 0 questions | ·Functions and modularity, 2017: 0 questions | ·Functions and modularity, 2019: 0 questions | ·Functions and modularity, 2020: 0 questions | ·Functions and modularity, 2023: 0 questions | ·Functions and modularity, 2024: 0 questions | ·Functions and modularity, 2025: 0 questions | ·Functions and modularity, 2026: 0 questions | ·Functions and modularity, 2027: 0 questions | |
| ·Linear and binary search, 2014: 0 questions | ·Linear and binary search, 2015: 0 questions | ·Linear and binary search, 2016: 0 questions | ·Linear and binary search, 2017: 0 questions | ·Linear and binary search, 2019: 0 questions | ·Linear and binary search, 2020: 0 questions | ·Linear and binary search, 2023: 0 questions | ·Linear and binary search, 2024: 0 questions | ·Linear and binary search, 2025: 0 questions | ·Linear and binary search, 2026: 0 questions | ·Linear and binary search, 2027: 0 questions | |
| ·File processing, 2014: 0 questions | ·File processing, 2015: 0 questions | ·File processing, 2016: 0 questions | ·File processing, 2017: 0 questions | ·File processing, 2019: 0 questions | ·File processing, 2020: 0 questions | ·File processing, 2023: 0 questions | ·File processing, 2024: 0 questions | ·File processing, 2025: 0 questions | ·File processing, 2026: 0 questions | ·File processing, 2027: 0 questions | |
| ·Fundamentals of OOP, 2014: 0 questions | ·Fundamentals of OOP, 2015: 0 questions | ·Fundamentals of OOP, 2016: 0 questions | ·Fundamentals of OOP, 2017: 0 questions | ·Fundamentals of OOP, 2019: 0 questions | ·Fundamentals of OOP, 2020: 0 questions | ·Fundamentals of OOP, 2023: 0 questions | ·Fundamentals of OOP, 2024: 0 questions | ·Fundamentals of OOP, 2025: 0 questions | ·Fundamentals of OOP, 2026: 0 questions | ·Fundamentals of OOP, 2027: 0 questions | |
| ·Designing classes, 2014: 0 questions | ·Designing classes, 2015: 0 questions | ·Designing classes, 2016: 0 questions | ·Designing classes, 2017: 0 questions | ·Designing classes, 2019: 0 questions | ·Designing classes, 2020: 0 questions | ·Designing classes, 2023: 0 questions | ·Designing classes, 2024: 0 questions | ·Designing classes, 2025: 0 questions | ·Designing classes, 2026: 0 questions | ·Designing classes, 2027: 0 questions | |
| ·Functions of the OS, 2014: 0 questions | ·Functions of the OS, 2015: 0 questions | ·Functions of the OS, 2016: 0 questions | ·Functions of the OS, 2017: 0 questions | ·Functions of the OS, 2019: 0 questions | ·Functions of the OS, 2020: 0 questions | ·Functions of the OS, 2023: 0 questions | ·Functions of the OS, 2024: 0 questions | ·Functions of the OS, 2025: 0 questions | ·Functions of the OS, 2026: 0 questions | ·Functions of the OS, 2027: 0 questions | |
| ·CPU components, 2014: 0 questions | ·CPU components, 2015: 0 questions | ·CPU components, 2016: 0 questions | ·CPU components, 2017: 0 questions | ·CPU components, 2019: 0 questions | ·CPU components, 2020: 0 questions | ·CPU components, 2023: 0 questions | ·CPU components, 2024: 0 questions | ·CPU components, 2025: 0 questions | ·CPU components, 2026: 0 questions | ·CPU components, 2027: 0 questions | |
| ·Primary memory, 2014: 0 questions | ·Primary memory, 2015: 0 questions | ·Primary memory, 2016: 0 questions | ·Primary memory, 2017: 0 questions | ·Primary memory, 2019: 0 questions | ·Primary memory, 2020: 0 questions | ·Primary memory, 2023: 0 questions | ·Primary memory, 2024: 0 questions | ·Primary memory, 2025: 0 questions | ·Primary memory, 2026: 0 questions | ·Primary memory, 2027: 0 questions | |
| ·Fetch–decode–execute, 2014: 0 questions | ·Fetch–decode–execute, 2015: 0 questions | ·Fetch–decode–execute, 2016: 0 questions | ·Fetch–decode–execute, 2017: 0 questions | ·Fetch–decode–execute, 2019: 0 questions | ·Fetch–decode–execute, 2020: 0 questions | ·Fetch–decode–execute, 2023: 0 questions | ·Fetch–decode–execute, 2024: 0 questions | ·Fetch–decode–execute, 2025: 0 questions | ·Fetch–decode–execute, 2026: 0 questions | ·Fetch–decode–execute, 2027: 0 questions | |
| ·Secondary storage, 2014: 0 questions | ·Secondary storage, 2015: 0 questions | ·Secondary storage, 2016: 0 questions | ·Secondary storage, 2017: 0 questions | ·Secondary storage, 2019: 0 questions | ·Secondary storage, 2020: 0 questions | ·Secondary storage, 2023: 0 questions | ·Secondary storage, 2024: 0 questions | ·Secondary storage, 2025: 0 questions | ·Secondary storage, 2026: 0 questions | ·Secondary storage, 2027: 0 questions | |
| ·Firewalls, 2014: 0 questions | ·Firewalls, 2015: 0 questions | ·Firewalls, 2016: 0 questions | ·Firewalls, 2017: 0 questions | ·Firewalls, 2019: 0 questions | ·Firewalls, 2020: 0 questions | ·Firewalls, 2023: 0 questions | ·Firewalls, 2024: 0 questions | ·Firewalls, 2025: 0 questions | ·Firewalls, 2026: 0 questions | ·Firewalls, 2027: 0 questions | |
| ·Dimensionality reduction, 2014: 0 questions | ·Dimensionality reduction, 2015: 0 questions | ·Dimensionality reduction, 2016: 0 questions | ·Dimensionality reduction, 2017: 0 questions | ·Dimensionality reduction, 2019: 0 questions | ·Dimensionality reduction, 2020: 0 questions | ·Dimensionality reduction, 2023: 0 questions | ·Dimensionality reduction, 2024: 0 questions | ·Dimensionality reduction, 2025: 0 questions | ·Dimensionality reduction, 2026: 0 questions | ·Dimensionality reduction, 2027: 0 questions | |
| ·Servers, 2014: 0 questions | ·Servers, 2015: 0 questions | ·Servers, 2016: 0 questions | ·Servers, 2017: 0 questions | ·Servers, 2019: 0 questions | ·Servers, 2020: 0 questions | ·Servers, 2023: 0 questions | ·Servers, 2024: 0 questions | ·Servers, 2025: 0 questions | ·Servers, 2026: 0 questions | ·Servers, 2027: 0 questions |
97 more micro-topics have no matches in this archive.
- Less commonin fewer than one paper in fifteen
- No matches in this archiveon the syllabus, but has no question tagged to it in this archive. This does not mean it has never been examined
Past paper generator
Generate Computer Science HL past paper questions
Choose what to revise and build a set in one click. Every question stays whole, so multi-part questions come as they appeared in the exam.
- 1Pick any unit, topic or micro-topic
- 2Generate whole exam questions from the archive
- 3Practise the same skills with AI marking
Questions on Paper 3, by exam session
Which papers asked about Paper 3, and which question numbers. Open a paper to see them highlighted.
May 2026
1 paper
Every Paper 3 question, unlocked
Generate any unit, topic or micro-topic in full, practise every question with AI marking, and see how each mark is awarded.
- Every past-paper question in any unit, topic or micro-topic
- Generate sets of 20 or all questions, as often as you like
- Unlimited practice with AI marking and worked answers
- See how every mark is awarded for each question
- Predicted papers and crash courses built from the same data
Used by IB students preparing for Nov 2026, May 2027 and May 2028
From €8/mo. 14-day money-back guarantee. Cancel anytime.
Frequently asked questions
Short answers about this page.
Which Computer Science HL exam sessions are covered for Paper 3?
14 exam sessions from 2026, the latest May 2026. Every Paper 3 in every timezone is read and classified in full, which gives 1 paper in this archive.
Which Paper 3 topic comes up most?
Network topologies (2.2.1): in 5% of papers, last seen May 26 P3 TZ3. Usually "Identify", worth about 2 marks in a paper that includes it.
Can I see the original question and mark scheme?
No. The wording belongs to the IB. You get the citation, the marks, the command term and the skill tested, plus our own matched practice questions with worked answers and AI marking.
What do "banker", "due" and "rising" mean?
Banker: examined in at least one sitting in four and still appearing. Due: regular before, but absent for the last two exam sessions. Rising: clearly more common in the last two years. Our classification of real papers, not an IB statistic.
What is free and what needs Pro?
Reading this page and the exam pattern is free. A free account generates three sets of ten questions and launches one practice set. Pro opens every question in any scope, sets of twenty or all, and unlimited practice.
Keep going
More Computer Science HL exam preparation
Every question, by paper
What each Computer Science HL paper tests across all its sittings: the marks by unit and the micro-topics it keeps coming back to.
Open the paper analysis
All IB past papers
Every subject we have classified by topic, with the same exam-pattern analysis.
Browse subjects
Practise Paper 3 the way it is examined.
Pick any unit, topic or micro-topic, see what repeats, then practise the same skills with AI marking.