IB DP · Analysis & Prediction

2023 IB DP Computer Science Past Paper Analysis

The May 2023 Standard Level Paper 1 represents a highly structured, standard-difficulty assessment. It features a balanced split between theoretical computer systems knowledge and classic core algorithmic problems, notably array searching and bubble sorting.

Updated: 14 Jun 2026

Analysis Sample paper

Difficulty 3.0/5

Total marks

Duration

90 mins

Most tested

Computational thinking

Paper breakdown

Paper 1 (Standard Level): 70 marks · 90 mins

Top chapters

Computational thinking · 25 marksNetworks · 19 marksSystem fundamentals · 15 marks

Difficulty Verdict

The May 2023 Standard Level Paper 1 is rated as a moderate (3/5) exam. It strictly adheres to the core IB SL syllabus guidelines, balancing predictable, high-scoring definition questions in Section A with challenging scenario-based design questions in Section B. There are no sudden shocks, but candidates must possess high technical precision in algorithmic writing to secure a top grade.

Where the Marks Are

Marks are heavily concentrated in two main areas: Computational Thinking (Chapter 4) with 25 marks, and Networks (Chapter 3) with 19 marks. Section B allocates a massive 15 marks per question across three themed scenarios: System Design & Lifecycle (Q10), Network Administration & Virtual Private Networks (Q11), and Array Manipulation & Algorithm Construction (Q12). In particular, the pseudocode writing questions in Q12 (sequential search and descending bubble sort) account for 11 marks, which directly separates grade 6 and 7 candidates.

Examiner Pitfalls & Crucial Mistakes

Unordered Search Assumptions: In Q12(c), many students attempted to use a binary search algorithm. However, as the ROOMNUMS array was unsorted, binary search is mathematically incorrect and scored zero. Only a sequential (linear) search is robust here.
Wrong Sort Implementations: In Q12(d), candidates who constructed a selection sort or insertion sort instead of the explicitly requested bubble sort lost major marks.
Out-of-Bounds Indexing: When comparing adjacent elements in bubble sort (\( ROOMNUMS[I] < ROOMNUMS[I+1] \)), failing to adjust loop boundaries (e.g., iterating up to \( N \) instead of \( N-1 \)) resulted in runtime errors and lost marks.
Generic Answers: For evaluations like remote training (Q10f) or VPN benefits (Q11), vague or non-technical answers failed to score. Candidates must map their responses to concrete computer science concepts (e.g., latency, bandwidth, encryption protocols).

Preparation Strategy & Prediction

For the upcoming sessions, students should expect a rotation back toward Logic Gate Circuit Diagrams (as this paper only featured a NAND/NOR truth table) and the complete Fetch-Decode-Execute (FDE) cycle of the CPU. Focus heavily on tracing nested loops with standard dry-run tables, and master the exact syntax of the IB Pseudocode approved notation guide, especially regarding flag-based loop termination and array boundary limits.

Charts

Marks by chapter

See where the marks were concentrated so revision time goes to the highest-value topics.

Question type mix

Compare the mark share of each paper section and question type.

Short Answer (Identify, State, Outline)28 marks · 17 questions
Extended Response (Explain, Evaluate, Discuss)19 marks · 6 questions
Analytical/Logical (Trace & Truth Tables)10 marks · 3 questions
Algorithm Design (Pseudocode)11 marks · 2 questions

Mark accessibility

Estimate which marks were basic, mid-level, or high-difficulty.

79%within easy or medium reach

easy: 25 marksmedium: 30 markshard: 15 marks

Difficulty trend

Compare difficulty across recent years.

Command word frequency

Spot common command words so answers match the expected response style.

Skill weighting

Shows the skill mix this paper tested most heavily.

Study ROI

Bigger bubbles recur more often; higher bubbles carry more marks, helping you rank revision priorities.

System Fundamentals & Lifecycle

15 marks · Difficulty 2.2 · recurrence 100%

Basic Network Technologies & VPNs

19 marks · Difficulty 2.5 · recurrence 100%

Array Searching and Traversal

11 marks · Difficulty 3.4 · recurrence 95%

Processor Registers & Architecture

11 marks · Difficulty 3.8 · recurrence 80%

Time vs marks

Compare marks with suggested time allocation to plan exam pacing.

marksmins

Next-year prediction

Topics worth watching next year, with the reason shown directly below each bar.

Logic Gate Circuit Construction90%

This paper only evaluated logical structures through truth tables. Traditional gate/logic circuit conversions are highly likely in the next cycle.

CPU Fetch-Execute Cycle Sequence85%

Only MAR and Cache registers were isolated here. A step-by-step sequential cycle question of register operations is overdue.

Network Topology Design75%

Network questions concentrated almost exclusively on VPN, encryption, and firewalls. Traditional WAN/LAN topologies and packet routing are highly anticipated.

Cumulative marks ladder

The line is your running mark total question by question; dashed lines are the estimated grade cut-offs. See which question the line crosses your target grade at, so you know how far you must answer cleanly and which questions decide a band.

Topic-year heatmap

Compare topic weight by year to spot recurring and returning areas.

May 2023 HL (TZ1)

May 2023 HL (TZ2)

May 2023 SL (TZ1)

Case Study (Recommender Systems & Machine Learning)

Computational thinking

Control

Networks

Abstract data structures

System fundamentals

Computer organization

Resource management

Object-oriented programming (OOP)

Case Study (Recommender Systems)

Examiner insights

Official report

Common pitfalls

Attempting to use a binary search algorithm on an unsorted array (such as the given ROOMNUMS array), which is logical error and yields zero marks.
Implementing alternative sorting algorithms like Selection Sort when the prompt explicitly requests Bubble Sort.
Omitting the temp storage swap variable when constructing sorting swaps in pseudocode, resulting in data loss inside the simulation.

Misconceptions

Assuming firewalls prevent all viruses, rather than recognizing their real role in filtering incoming and outgoing network traffic based on predefined rules.
Confusing the role of the Memory Address Register (MAR) with the Program Counter (PC) or the Memory Data Register (MDR).

Where marks are lost

Failing to define array boundary limits correctly, leading to off-by-one index mistakes (e.g., looping to K=9 instead of K=999 to cover the full capacity of college rooms).
Vague descriptions of social impacts of home working that lack clear Computer Science perspective or balance of positive and negative sides.

Estimated grade cut-off

Updated: 14 Jun 2026

Source: the IB (International Baccalaureate)

Level	Mark	Percentage
7	83/115	72%
6	73/115	64%
5	63/115	55%
4	53/115	46%
3	37/115	32%
2	19/115	17%
1	0/115	0%

Official grade boundaries published by the IB (International Baccalaureate).

Know what the examiners want — now go get those marks

Thinka is an AI practice app used by 100,000+ DSE students to drill questions and get instant feedback on every answer. You already know the high-frequency topics and where marks are lost — now practice those specifically on Thinka and turn this analysis into actual marks.

Start Practising Free See pricing

Know what's tested? Drill those topics on Thinka — AI questions, instant marking.

Start Practising Free