aimnova.
DashboardMy LearningPaper MasteryStudy Plan

Aimnova site navigation

Stay in the loop

Get the latest study resources and updates

New features, study tips and exam insights — straight to your inbox.

IB Diploma

  • IB Past Papers
  • IB Study Notes
  • IB Question Bank
  • IB Mock Exams
  • IB Revision

IB Subjects

  • IB Math AA
  • IB Math AI
  • IB Economics
  • IB Business Management
  • IB Physics
  • IB Biology
  • View all IB subjects→

IB Past Papers

  • IB Math AA HL Past Papers
  • IB Math AA SL Past Papers
  • IB Math AI HL Past Papers
  • IB Math AI SL Past Papers
  • IB Economics HL Past Papers
  • IB Economics SL Past Papers
  • IB ESS Past Papers
  • View all past papers→

Study Resources

  • Study Notes
  • Question Bank
  • Mock Exams
  • Flashcards
  • Revision Guide
  • Exam Skills
  • Command Terms
  • Grade Calculator
  • Exam Timetable 2026

Aimnova

  • Features
  • Pricing
  • For Schools
  • For Parents
  • About Us
  • Blog
  • Contact
aimnova.

AI-powered study platform for smarter revision, past-paper analysis and examiner-style feedback.

TermsPrivacyCookies·© 2026 Aimnova. All rights reserved.8afc4e3

Aimnova is not affiliated with or endorsed by the International Baccalaureate Organization (IB).

IB Computer Science SL

Computer Science SL Exam Skills & Techniques

Master the IB Computer Science exam on the 2027 guide. Both paper structures, command terms, marking criteria, trace-table technique, and how to write the code that earns the marks.

150 teaching hours • 2 external papers • 1 internal assessment (computational solution)

Start Studying Computer Science SL

Computer Science SL Assessment at a Glance

35%
Paper 1
Short answers • 1h 15m
35%
Paper 2
Applied programming • 1h 15m
30%
Internal Assessment
Computational solution

Computer Science SL Paper Structure

Two papers of equal length and weight — know what each tests and how to maximise your marks.

Paper 1

Short answers and structured questions
1 hour 15 minutes•35% of final grade

Two sections sat together. Section A (38 of 50 marks) is extended response on theme A — computer fundamentals, networks, databases and machine learning. Section B (12 marks) asks three questions on the pre-seen case study. The case study itself carries two challenge questions — those tell you what to research; they are not the exam questions.

What to expect:

Answer every question — there is no choice
Section A is theme A only; theme B is examined on Paper 2
Section B asks three questions; the two challenge questions tell you what to research
Diagram construction appears here: truth tables, logic diagrams, ERDs

Key Tips

  • Read the command term first and answer exactly that
  • For a 1-mark state question, one precise line is the whole answer
  • Show conversions and calculations step by step for method marks
  • Label every part of a diagram you are asked to construct

Easy Marks

  • Definitions — learn them word-perfect
  • Naming components, devices, protocols or data types
  • Base conversions where the working is shown
  • Completing a truth table row by row

Watch Out

  • Explain questions answered as if they said outline — no mechanism, no marks
  • Comparisons that describe only one side
  • Binary and hex conversions with no working when the answer is wrong
  • Running out of time on the diagram questions at the end
  • Arriving at section B without having researched the case study

Paper 2

Applied programming and problem-solving
1 hour 15 minutes•35% of final grade

Extended, scenario-based questions — tracing algorithms, writing code, and designing or normalising a database. The paper comes in a Python version and a Java version; sit the one your school teaches.

What to expect:

One scenario runs through several linked parts
Code is written from scratch, not selected from options
Trace tables are expected to be drawn out in full
Later parts often depend on getting an earlier one right

Key Tips

  • Draw the trace table with one column per variable and one row per step
  • Add a column for the loop condition — it shows why the loop stopped
  • Decide what goes inside the loop and what goes outside before writing
  • Name your variables meaningfully; it earns clarity marks and prevents mistakes

Easy Marks

  • Initialising an accumulator correctly — 0 for a sum, 1 for a product
  • Handling the empty case before dividing
  • Identifying the entities and keys in a database scenario
  • Stating the normal form broken and naming the dependency

Watch Out

  • Off-by-one errors in loop bounds and array indices
  • Outputting inside a loop when one answer was wanted
  • Forgetting to re-read input inside a validation loop — an infinite loop
  • Normalising without saying which dependency you removed

Computer Science SL Command Terms

Command terms tell you exactly what the examiner expects. Filter by Assessment Objective (AO).

State / Identify1 mark

Give a specific name, value or answer with no supporting reasoning.

Define1–2 marks

Give the precise meaning of a word, phrase or concept.

Describe / Outline2–3 marks

Give a detailed account (describe) or a summary of the main points (outline).

Explain3–4 marks

Give a detailed account including reasons or causes — the mechanism AND its consequence.

Compare / Distinguish3–4 marks

Give an account of similarities and differences, referring to BOTH throughout.

Construct3–6 marks

Display information in a diagrammatic or logical form — a truth table, an ERD, a flowchart or a working program.

Trace3–5 marks

Follow and record the action of an algorithm step by step, usually in a trace table.

Suggest / Evaluate3–6 marks

Propose a solution or judge one against alternatives, giving reasons for the choice.

What Examiners Expect

Match your answer depth to the marks available.

1–2 marksA specific, correct fact or definition.

Example questions:

  • "Naming a component, protocol or data type"
  • "Stating what a term means"
  • "A single conversion with its working"

One precise line. Padding earns nothing and wastes time you need later.

3–4 marksA mechanism explained, or two sides genuinely compared, with consequences.

Example questions:

  • "Why an SSD has a lower access time than a hard disk"
  • "How a stack manages function calls"
  • "Comparing static and dynamic data structures"

Count the marks and make that many distinct points — one point per mark.

5–6 marksAn applied answer that reaches a justified conclusion or a working construction.

Example questions:

  • "Designing tables in 3NF for a given scenario"
  • "Writing code that handles the edge cases"
  • "Choosing a topology or scheduling rule and defending it"

Justify against the alternative — saying what would go wrong with the option you rejected is usually where the last marks are.

Computer Science SL-Specific Skills

These concepts appear throughout Computer Science SL exams. Master them to score higher.

Answer the command term

Outline wants the shape of the idea; explain wants the mechanism and its consequence; evaluate wants a judgement. Writing more than the term asks for earns nothing extra.

Show every conversion

Write the place values or the division remainders. A wrong final answer with correct method still earns method marks; a bare wrong number earns none.

Trace on paper, never in your head

One column per variable, one row per step, plus a column for the loop condition. It is slow on purpose — the value is that you never guess what happens next.

Test the boundaries

Empty input, a single item, and the value exactly on the boundary. Off-by-one errors are the commonest lost marks in Paper 2.

Common Computer Science SL Mistakes to Avoid

Learn from others' mistakes. These cost students marks every exam session.

Treating "explain" as "outline" — naming a thing without its mechanism.

Say what happens AND what follows from it. Two sentences, not one.

Comparing two things by describing each separately.

Write point against point: "A does X, whereas B does Y."

Losing an element at the start or end of a loop.

Check the bound on an example: an array of n has indices 0 to n − 1.

Dividing to find an average without checking for an empty list.

Handle the empty case first — it is the edge case that breaks every average.

Using AND where the logic needs OR when testing an invalid range.

A valid range needs AND; testing for invalid needs OR. "< 0 AND > 100" is never true.

Normalising a table without naming the dependency that was removed.

State it explicitly: "ProductName depends on ProductID, part of the key — a partial dependency."

Internal Assessment — the computational solution

30% of final grade • Developed over 35 hours

A working solution built for a real client, documented from the problem definition through design and development to testing and evaluation against your own success criteria.

Marking Criteria

A: Problem specification4 marks
B: Planning4 marks
C: System overview6 marks
D: Development12 marks
E: Evaluation4 marks

Tips for Top Marks

  • Find a real client early — the whole assessment rests on their requirements
  • Write success criteria you can actually test, not aspirations
  • Record the design decisions as you make them, not afterwards
  • Evaluate against YOUR criteria, naming what was not met and why

Ready to Practice?

Apply these exam skills with our Computer Science SL practice questions. Get instant AI feedback that shows exactly what scored marks and how to improve.

Start Computer Science SL PracticeAsk AI Tutor