Exam Strategy

How to Study for IB Computer Science: Complete Strategy Guide | LearnByTeaching.ai

IB Computer Science uniquely combines theoretical knowledge with practical programming skills, testing everything from abstract data structures to object-oriented programming in Java. Success requires balancing two very different skill sets: the ability to reason about computational concepts on paper and the ability to write working code under time pressure, all while navigating IB-specific pseudocode conventions.

Exam Overview

Format

Paper 1 (short-answer and structured questions on theory), Paper 2 (object-oriented programming in pseudocode and Java), Paper 3 (HL only — pre-released case study); plus an Internal Assessment (programming solution)

Duration

SL: Paper 1 (1 hr 30 min) + Paper 2 (1 hr); HL: Paper 1 (2 hr 10 min) + Paper 2 (1 hr 20 min) + Paper 3 (1 hr)

Scoring

1–7 scale; external papers are ~70-80% and IA is ~20-30%

Passing Score

4 is generally considered passing; CS programs value the IA project as evidence of coding ability

Section	Weight	Description
Paper 1 — Computer Science Theory	40%	Short-answer and structured questions covering system fundamentals, networking, databases, computational thinking, and abstract data structures (HL)
Paper 2 — Object-Oriented Programming	25%	Programming questions using IB pseudocode and Java, testing algorithm design, OOP concepts, and problem-solving
Paper 3 — Case Study (HL only)	15%	Questions based on a pre-released case study exploring a real-world computing scenario, requiring analysis and evaluation
Internal Assessment — Programming Solution	20%	A coded program solving a real problem for an identified client, documented with planning, design, development, and evaluation

Study Phases

Theory Foundations

Weeks 1-2

Goals

Revise all Paper 1 topics: system fundamentals, networking, databases, web science, computational thinking
Create summary notes with diagrams for system architecture and networking
Review HL topics: abstract data structures, recursion, resource management

Daily Schedule

3-4 hours: 2 hours of theory revision with notes, 1 hour of past question practice, 30 min of vocabulary/definition review

Resources

Oxford IB Computer Science Course Companion
CompSciHub resources
IB CompSci Hub (YouTube)
IB CS topic notes

Techniques

Draw system diagrams (network topologies, CPU architecture) from memoryCreate comparison tables (e.g., serial vs parallel processing, LAN vs WAN)Practice explaining concepts in your own words — many Paper 1 questions ask you to 'outline' or 'describe'

Programming Practice

Weeks 3-4

Goals

Master IB pseudocode syntax and conventions
Practice writing algorithms: searching, sorting, traversals
Build confidence with OOP concepts: classes, inheritance, polymorphism
Complete at least 3 full Paper 2s under timed conditions

Daily Schedule

3-4 hours: 1.5 hours of coding practice (Paper 2 style questions), 1 hour of trace table exercises, 1 hour of algorithm design

Resources

Past Paper 2 questions and mark schemes
Java practice problems
IB pseudocode reference guide
Online coding platforms for algorithm practice

Techniques

Practice writing code on paper — the exam does not allow a computerComplete trace tables for every algorithm you study to verify understandingMemorize IB pseudocode conventions (loop syntax, collection methods, output format)

Case Study and HL Depth (HL only)

Week 5

Goals

Thoroughly analyze the pre-released case study
Identify potential exam questions from the case study themes
Connect case study scenarios to core CS concepts
Practice evaluating technologies discussed in the case study

Daily Schedule

3-4 hours: 2 hours of case study analysis and research, 1 hour of practice writing extended responses, 1 hour of past Paper 3 practice

Resources

IB pre-released case study document
Related articles and resources on the case study topic
Past Paper 3 questions for format familiarity

Techniques

Annotate the case study with connections to every relevant syllabus topicPrepare 'for and against' arguments for technologies mentioned in the case studyPractice writing evaluative responses that consider social, ethical, and technical perspectives

Mock Exams and Final Review

Week 6

Goals

Complete 2 full mock exams under timed conditions
Review and memorize key algorithm patterns
Ensure fluency with pseudocode syntax
Build confidence with time management

Daily Schedule

3-4 hours: Full mock exams on simulation days, targeted review on other days

Resources

Full past exam sets
Condensed topic summaries
Algorithm reference sheets

Techniques

Simulate real exam conditions — paper only, no computerReview mark schemes to understand exactly what examiners expectFocus on the topics that carry the most marks

Section Strategies

Paper 1 — Computer Science Theory

40%

Time Allocation

SL: 1 hour 30 minutes. HL: 2 hours 10 minutes. Allocate roughly 1.5 minutes per mark.

Key Topics

System fundamentals (hardware, software, OS)Computer networking and protocolsDatabases and data modelingWeb scienceComputational thinking and problem-solvingHL: Abstract data structures (linked lists, stacks, queues, trees)HL: Resource management and control

Study Approach

Paper 1 tests breadth of knowledge across the entire syllabus. Create revision notes organized by topic and practice past questions focusing on command terms. Many questions require diagrams — practice drawing system architectures, network topologies, and data structure diagrams from memory.

Common Mistakes to Avoid

✗Giving vague definitions instead of precise technical descriptions
✗Not drawing diagrams when they would clarify your answer
✗Confusing HL-only concepts with SL content
✗Not addressing all parts of multi-part questions

Paper 2 — Object-Oriented Programming

25%

Time Allocation

SL: 1 hour. HL: 1 hour 20 minutes. Read the entire paper first to identify easier questions.

Key Topics

Arrays and collectionsSearching algorithms (linear, binary)Sorting algorithms (bubble, selection, insertion)Object-oriented design (classes, objects, methods)Inheritance and polymorphismString manipulationRecursion (HL)

Study Approach

Practice writing code on paper using IB pseudocode conventions. Complete trace tables for every algorithm to verify your understanding. Focus on clean, readable code with meaningful variable names — examiners award marks for correct logic even if syntax is imperfect.

Common Mistakes to Avoid

✗Not using proper IB pseudocode conventions (loop syntax, method calls)
✗Weak trace table skills leading to logic errors
✗Forgetting to initialize variables before loops
✗Not handling edge cases (empty arrays, single elements)

Paper 3 — Case Study (HL only)

15%

Time Allocation

1 hour. Allocate 10 minutes for reading and planning, 50 minutes for writing. Address every part of each question.

Key Topics

Pre-released case study themesSocial and ethical implications of technologyTechnical evaluation of systems described in the case studyConnections between case study and syllabus conceptsEmerging technologies relevant to the case study

Study Approach

Read the case study multiple times and annotate it thoroughly. Research the technologies and scenarios described in depth. Prepare balanced arguments about the social, ethical, and technical implications. Practice writing extended evaluative responses.

Common Mistakes to Avoid

✗Not preparing the case study thoroughly before the exam
✗Writing generic answers that do not reference specific details from the case study
✗Failing to evaluate — presenting only benefits or only drawbacks
✗Not connecting case study scenarios to core syllabus concepts

Internal Assessment — Programming Solution

20%

Time Allocation

Allocate 3-4 months. Spend roughly 30-40 hours across planning, development, testing, and documentation.

Key Topics

Problem identification with a real clientPlanning and design (flowcharts, UML diagrams)Development using appropriate programming techniquesTesting with a comprehensive test planEvaluation against success criteria

Study Approach

Choose a project scope that is achievable within the time frame — a well-executed simple project scores higher than an incomplete ambitious one. Identify a real client and gather genuine requirements. Document your process thoroughly with screenshots, code snippets, and testing evidence.

Common Mistakes to Avoid

✗Overscoping the project and running out of time
✗Not having a real client with genuine feedback
✗Insufficient testing documentation
✗Weak evaluation that does not reference original success criteria

Score Improvement Tactics

2-3→4-5

Master fundamental programming constructs (loops, conditionals, arrays)
Learn key definitions for all Paper 1 topics
Practice basic algorithms (linear search, bubble sort) until fluent
Complete at least 4 past Paper 1 short-answer sections

Est. 60h of study

4-5→6

Strengthen OOP concepts and practice class design on paper
Master trace tables for complex algorithms including recursion (HL)
Improve Paper 1 extended-response technique
Prepare the case study thoroughly (HL)

Est. 50h of study

5-6→7

Perfect algorithm design for novel problems under time pressure
Master HL data structures (linked lists, trees) with code and trace tables
Polish IA documentation to maximize internal marks
Practice writing evaluative responses for Paper 3

Est. 40h of study

Test Day Tips

1
For Paper 2, read all questions before starting and tackle the ones you find easiest first — this builds confidence and ensures you collect available marks.
2
When writing code on paper, leave space between lines so you can insert corrections without messy crossings-out — examiners need to read your code clearly.
3
For trace tables, set up your columns carefully before starting and work through each iteration methodically — rushing trace tables leads to cascading errors.
4
On Paper 1, always attempt to draw a diagram if the question involves a data structure, network, or system — visual answers often earn marks that text alone would not.
5
For Paper 3 (HL), reference specific details from the case study in every answer — generic responses about technology receive minimal credit.
6
Manage your time strictly — if a question is worth 4 marks, spend roughly 6 minutes on it. Do not spend 15 minutes perfecting a 2-mark answer.
7
If you cannot remember exact pseudocode syntax, write clear logic with comments explaining your intent — examiners can award marks for correct algorithmic thinking even with minor syntax issues.

Pro Tips

✓

Practice writing code on paper every day — the gap between typing code with autocomplete and writing it by hand under exam conditions is much larger than most students expect.

✓

Create a one-page IB pseudocode syntax reference and memorize it — the specific conventions (loop, end loop, collection.addItem()) differ from standard Java and marks depend on using the IB format correctly.

✓

For the IA, interview your client at least three times: once for requirements, once for feedback on a prototype, and once for final evaluation — genuine client interaction is what separates a 4 from a 7 on the IA.

✓

Teach algorithms to someone by walking them through a trace table step by step. If you can explain why a binary search halves the search space each iteration, you understand it deeply enough for any exam question.

✓

For the HL case study, create a two-column document mapping every paragraph of the case study to relevant syllabus topics — this preparation means you can answer any Paper 3 question by combining case study knowledge with core concepts.

More IB Computer Science Resources

Study PlanIB Computer Science Study Plan Practice QuestionsIB Computer Science Practice Questions FlashcardsIB Computer Science Flashcards

Prepare for the IB Computer Science by teaching it

Upload your IB Computer Science study materials and teach concepts to AI students. Explaining what you know is the fastest way to find gaps before exam day.

Try LearnByTeaching.ai — It's Free