International Baccalaureate · IB Diploma
Computer Science · HL
Papers, samples and curriculum documents for this course.
Handouts, exercise sheets and slides
Shared topic documents retain their source course and topic titles. Use your chosen board’s specification for coverage, tier and exam requirements.
Handouts · International Baccalaureate · IB Diploma · Computer Science · HL (10)
Exercise sheets · International Baccalaureate · IB Diploma · Computer Science · HL (26)
- 1.1 Computer hardware: the CPU, memory, storage and the cloud
- 1.2 Data representation: binary, hexadecimal and how data is stored
- 1.3 Logic gates and truth tables
- 1.4 Operating systems, control systems and translation
- 2.1 Networks: types, devices, topologies and models
- 2.2 Protocols, IP addressing and data transmission
- 2.3 Network security: firewalls, encryption and certificates
- 3.1 Database design: ERDs, keys and normalization to 3NF
- 3.2 SQL: queries, updates, aggregates and transactions
- 4.1 Machine learning: types, hardware and ethics
- 4.2 Machine learning: data preprocessing and approaches
- 5.1 Computational thinking and problem specification
- 5.2 Flowcharts and trace tables
- 6.1 Programming fundamentals: variables, strings, exceptions and debugging
- 6.2 Data structures: lists, 2D lists, stacks and queues
- 6.3 Algorithms: searching, sorting and Big O
- 6.4 Programming constructs, functions and file processing
- 6.5 Recursion
- 7.1 Classes and objects
- 7.2 Encapsulation and UML class diagrams
- 7.3 Inheritance and polymorphism
- 8.1 Abstract data types and linked lists
- 8.2 Binary search trees
- 8.3 Sets and hash tables
- 9.1 Case study skills
- 10.1 Computational solution skills
Presentation slides · International Baccalaureate · IB Diploma · Computer Science · HL (10)
Exercise walk-through slides · International Baccalaureate · IB Diploma · Computer Science · HL (26)
- 1.1 Computer hardware: the CPU, memory, storage and the cloud · Walk-through
- 1.2 Data representation: binary, hexadecimal and how data is stored · Walk-through
- 1.3 Logic gates and truth tables · Walk-through
- 1.4 Operating systems, control systems and translation · Walk-through
- 2.1 Networks: types, devices, topologies and models · Walk-through
- 2.2 Protocols, IP addressing and data transmission · Walk-through
- 2.3 Network security: firewalls, encryption and certificates · Walk-through
- 3.1 Database design: ERDs, keys and normalization to 3NF · Walk-through
- 3.2 SQL: queries, updates, aggregates and transactions · Walk-through
- 4.1 Machine learning: types, hardware and ethics · Walk-through
- 4.2 Machine learning: data preprocessing and approaches · Walk-through
- 5.1 Computational thinking and problem specification · Walk-through
- 5.2 Flowcharts and trace tables · Walk-through
- 6.1 Programming fundamentals: variables, strings, exceptions and debugging · Walk-through
- 6.2 Data structures: lists, 2D lists, stacks and queues · Walk-through
- 6.3 Algorithms: searching, sorting and Big O · Walk-through
- 6.4 Programming constructs, functions and file processing · Walk-through
- 6.5 Recursion · Walk-through
- 7.1 Classes and objects · Walk-through
- 7.2 Encapsulation and UML class diagrams · Walk-through
- 7.3 Inheritance and polymorphism · Walk-through
- 8.1 Abstract data types and linked lists · Walk-through
- 8.2 Binary search trees · Walk-through
- 8.3 Sets and hash tables · Walk-through
- 9.1 Case study skills · Walk-through
- 10.1 Computational solution skills · Walk-through
Handouts · A-Level Computer Science (20)
- 1. Information representation
- 2. Communication
- 3. Hardware
- 4. Processor Fundamentals
- 5. System Software
- 6. Security, privacy and data integrity
- 7. Ethics and Ownership
- 8. Databases
- 9. Algorithm Design and Problem-solving
- 10. Data Types and Structures
- 11. Programming
- 12. Software Development
- 13. Data Representation
- 14. Communication and internet technologies
- 15. Hardware and Virtual Machines
- 16. System Software
- 17. Security
- 18. Artificial Intelligence (AI)
- 19. Computational thinking and Problem-solving
- 20. Further Programming
Exercise sheets · A-Level Computer Science (88)
- 1.1 Data Representation
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used
- 1.2 Multimedia
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling
- 1.3 Compression
- 2.1 Networks including the internet
- 2.1.1 Network types, client-server and peer-to-peer models, and topologies
- 2.1.2 Cloud computing, transmission media, Ethernet and CSMA/CD, and internet hardware
- 2.1.3 Finding a server: URLs, the Domain Name Service and IP addressing
- 3.1 Computers and their components
- 3.1.1 Primary memory: RAM, ROM and their types
- 3.1.2 Secondary storage: magnetic, solid state and optical
- 3.1.3 Input and output devices, and buffers
- 3.1.4 Embedded systems, monitoring and control
- 3.2 Logic Gates and Logic Circuits
- 3.2.1 Truth tables and expressions from a logic circuit
- 3.2.2 Building logic circuits from expressions, problems and truth tables
- 4.1 Central Processing Unit (CPU) Architecture
- 4.1.1 Registers, interrupts, ports and performance
- 4.2 Assembly Language
- 4.3 Bit manipulation
- 4.3.1 Arithmetic and cyclic shifts, and when a shift stops being a multiply or a divide
- 5.1 Operating Systems
- 5.1.1 Utility software
- 5.1.2 Program libraries and DLL files
- 5.2 Language Translators
- 5.2.1 Partial compilation (Java) and the IDE
- 6.1 Data Security
- 6.2 Data Integrity
- 7.1 Ethics and Ownership
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI
- 8.1 Database Concepts
- 8.1.1 Relationships and E-R diagrams
- 8.1.2 Normalisation from UNF to 3NF
- 8.2 Database Management Systems (DBMS)
- 8.3 Data Definition Language (DDL) and Data Manipulation Language (DML)
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types
- 9.1 Computational Thinking Skills
- 9.1.1 Abstraction and decomposition in practice
- 9.2 Algorithms
- 9.2.1 Logic statements and decisions in an algorithm
- 9.2.2 Flowcharts: reading, drawing and converting
- 9.2.3 Structured English, stepwise refinement and describing an algorithm
- 10.1 Data Types and Records
- 10.2 Arrays
- 10.2.1 Bubble sort, array bounds and the standard array routines
- 10.2.2 Arrays - combined exam practice
- 10.3 Files
- 10.4 Introduction to Abstract Data Types (ADT)
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT
- 11.1 Programming Basics
- 11.1.1 Operators and expressions
- 11.1.2 Built-in functions and library routines
- 11.2 Constructs
- 11.2.1 CASE structures, and choosing between IF and CASE
- 11.2.2 Count-controlled loops: FOR ... NEXT, totals and counts
- 11.2.3 WHILE and REPEAT loops, and choosing the right loop
- 11.2.4 Trace tables: dry-running an algorithm and finding logic errors
- 11.3 Structured Programming
- 11.3.1 Functions, and choosing between a procedure and a function
- 11.3.2 Parameters by value and by reference, and variable scope
- 11.3.3 Efficient pseudocode and breaking a task into modules
- 12.1 Program Development Life cycle
- 12.2 Structure Charts
- 12.2.1 State-transition Diagrams
- 12.3 Program Testing and Maintenance
- 12.3.1 Test strategy, test plans and choosing a testing method
- 13.1 User-defined data types
- 13.1.1 Designing a user-defined type for a problem, and the linked list
- 13.2 File organisation and access
- 13.3 Floating-point numbers, representation and manipulation
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow
- 14.1 Protocols
- 14.2 Circuit switching, packet switching
- 15.1 Processors, Parallel Processing and Virtual Machines
- 15.2 Boolean Algebra and Logic Circuits
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps
- 16.1 Purposes of an Operating System (OS)
- 16.2 Translation Software
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions
- 17.1 Encryption, Encryption Protocols and Digital Certificates
- 18.1 Artificial Intelligence (AI)
- 19.1 Algorithms
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O
- 19.2 Recursion
- 20.1 Programming Paradigms
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals
- 20.2 File Processing and Exception Handling
Presentation slides · A-Level Computer Science (20)
- 1. Information representation
- 2. Communication
- 3. Hardware
- 4. Processor Fundamentals
- 5. System Software
- 6. Security, privacy and data integrity
- 7. Ethics and Ownership
- 8. Databases
- 9. Algorithm Design and Problem-solving
- 10. Data Types and Structures
- 11. Programming
- 12. Software Development
- 13. Data Representation
- 14. Communication and internet technologies
- 15. Hardware and Virtual Machines
- 16. System Software
- 17. Security
- 18. Artificial Intelligence (AI)
- 19. Computational thinking and Problem-solving
- 20. Further Programming
Exercise walk-through slides · A-Level Computer Science (167)
- 1.1 Data Representation · Walk-through
- 1.1 Data Representation · Past-paper walk-through
- 1.1.1 Data Representation · Past-paper walk-through
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used · Walk-through
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used · Past-paper walk-through
- 1.2 Multimedia · Walk-through
- 1.2 Multimedia · Past-paper walk-through
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling · Walk-through
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling · Past-paper walk-through
- 1.3 Compression · Walk-through
- 1.3 Compression · Past-paper walk-through
- 1.3.1 Compression · Past-paper walk-through
- 2.1 Networks including the internet · Walk-through
- 2.1 Networks including the internet · Past-paper walk-through
- 2.1.1 Network types, client-server and peer-to-peer models, and topologies · Walk-through
- 2.1.1 Network types, client-server and peer-to-peer models, and topologies · Past-paper walk-through
- 2.1.2 Cloud computing, transmission media, Ethernet and CSMA/CD, and internet hardware · Walk-through
- 2.1.3 Finding a server: URLs, the Domain Name Service and IP addressing · Walk-through
- 2.1.3 Finding a server: URLs, the Domain Name Service and IP addressing · Past-paper walk-through
- 3.1 Computers and their components · Walk-through
- 3.1 Computers and their components · Past-paper walk-through
- 3.1.1 Primary memory: RAM, ROM and their types · Walk-through
- 3.1.1 Primary memory: RAM, ROM and their types · Past-paper walk-through
- 3.1.2 Secondary storage: magnetic, solid state and optical · Walk-through
- 3.1.2 Secondary storage: magnetic, solid state and optical · Past-paper walk-through
- 3.1.3 Input and output devices, and buffers · Walk-through
- 3.1.3 Input and output devices, and buffers · Past-paper walk-through
- 3.1.4 Embedded systems, monitoring and control · Walk-through
- 3.1.4 Embedded systems, monitoring and control · Past-paper walk-through
- 3.2 Logic Gates and Logic Circuits · Walk-through
- 3.2 Logic Gates and Logic Circuits · Past-paper walk-through
- 3.2.1 Truth tables and expressions from a logic circuit · Walk-through
- 3.2.1 Truth tables and expressions from a logic circuit · Past-paper walk-through
- 3.2.2 Building logic circuits from expressions, problems and truth tables · Walk-through
- 3.2.2 Building logic circuits from expressions, problems and truth tables · Past-paper walk-through
- 4.1 Central Processing Unit (CPU) Architecture · Walk-through
- 4.1 Central Processing Unit (CPU) Architecture · Past-paper walk-through
- 4.1.1 Registers, interrupts, ports and performance · Walk-through
- 4.1.1 Registers, interrupts, ports and performance · Past-paper walk-through
- 4.2 Assembly Language · Walk-through
- 4.2 Assembly Language · Past-paper walk-through
- 4.3 Bit manipulation · Walk-through
- 4.3 Bit manipulation · Past-paper walk-through
- 4.3.1 Arithmetic and cyclic shifts, and when a shift stops being a multiply or a divide · Walk-through
- 5.1 Operating Systems · Walk-through
- 5.1 Operating Systems · Past-paper walk-through
- 5.1.1 Utility software · Walk-through
- 5.1.1 Utility software · Past-paper walk-through
- 5.1.2 Program libraries and DLL files · Walk-through
- 5.1.2 Program libraries and DLL files · Past-paper walk-through
- 5.2 Language Translators · Walk-through
- 5.2 Language Translators · Past-paper walk-through
- 5.2.1 Partial compilation (Java) and the IDE · Walk-through
- 5.2.1 Partial compilation (Java) and the IDE · Past-paper walk-through
- 6.1 Data Security · Walk-through
- 6.1 Data Security · Past-paper walk-through
- 6.2 Data Integrity · Walk-through
- 6.2 Data Integrity · Past-paper walk-through
- 7.1 Ethics and Ownership · Walk-through
- 7.1 Ethics and Ownership · Past-paper walk-through
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI · Walk-through
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI · Past-paper walk-through
- 8.1 Database Concepts · Walk-through
- 8.1 Database Concepts · Past-paper walk-through
- 8.1.1 Relationships and E-R diagrams · Walk-through
- 8.1.1 Relationships and E-R diagrams · Past-paper walk-through
- 8.1.2 Normalisation from UNF to 3NF · Walk-through
- 8.1.2 Normalisation from UNF to 3NF · Past-paper walk-through
- 8.2 Database Management Systems (DBMS) · Walk-through
- 8.2 Database Management Systems (DBMS) · Past-paper walk-through
- 8.3 Data Definition Language (DDL) and Data Manipulation Language (DML) · Walk-through
- 8.3 Data Definition Language (DDL) and Data Manipulation Language (DML) · Past-paper walk-through
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types · Walk-through
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types · Past-paper walk-through
- 9.1 Computational Thinking Skills · Walk-through
- 9.1 Computational Thinking Skills · Past-paper walk-through
- 9.1.1 Abstraction and decomposition in practice · Walk-through
- 9.1.1 Abstraction and decomposition in practice · Past-paper walk-through
- 9.2 Algorithms · Walk-through
- 9.2 Algorithms · Past-paper walk-through
- 9.2.1 Logic statements and decisions in an algorithm · Walk-through
- 9.2.1 Logic statements and decisions in an algorithm · Past-paper walk-through
- 9.2.2 Flowcharts: reading, drawing and converting · Walk-through
- 9.2.2 Flowcharts: reading, drawing and converting · Past-paper walk-through
- 9.2.3 Structured English, stepwise refinement and describing an algorithm · Walk-through
- 9.2.3 Structured English, stepwise refinement and describing an algorithm · Past-paper walk-through
- 10.1 Data Types and Records · Walk-through
- 10.1 Data Types and Records · Past-paper walk-through
- 10.2 Arrays · Walk-through
- 10.2 Arrays · Past-paper walk-through
- 10.2.1 Bubble sort, array bounds and the standard array routines · Walk-through
- 10.2.1 Bubble sort, array bounds and the standard array routines · Past-paper walk-through
- 10.2.2 Arrays - combined exam practice · Walk-through
- 10.3 Files · Walk-through
- 10.3 Files · Past-paper walk-through
- 10.4 Introduction to Abstract Data Types (ADT) · Walk-through
- 10.4 Introduction to Abstract Data Types (ADT) · Past-paper walk-through
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT · Walk-through
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT · Past-paper walk-through
- 11.1 Programming Basics · Walk-through
- 11.1 Programming Basics · Past-paper walk-through
- 11.1.1 Operators and expressions · Walk-through
- 11.1.2 Built-in functions and library routines · Walk-through
- 11.1.2 Built-in functions and library routines · Past-paper walk-through
- 11.2 Constructs · Walk-through
- 11.2 Constructs · Past-paper walk-through
- 11.2.1 CASE structures, and choosing between IF and CASE · Walk-through
- 11.2.1 CASE structures, and choosing between IF and CASE · Past-paper walk-through
- 11.2.2 Count-controlled loops: FOR ... NEXT, totals and counts · Walk-through
- 11.2.3 WHILE and REPEAT loops, and choosing the right loop · Walk-through
- 11.2.3 WHILE and REPEAT loops, and choosing the right loop · Past-paper walk-through
- 11.2.4 Trace tables: dry-running an algorithm and finding logic errors · Walk-through
- 11.2.4 Trace tables: dry-running an algorithm and finding logic errors · Past-paper walk-through
- 11.3 Structured Programming · Walk-through
- 11.3 Structured Programming · Past-paper walk-through
- 11.3.1 Functions, and choosing between a procedure and a function · Walk-through
- 11.3.1 Functions, and choosing between a procedure and a function · Past-paper walk-through
- 11.3.2 Parameters by value and by reference, and variable scope · Walk-through
- 11.3.2 Parameters by value and by reference, and variable scope · Past-paper walk-through
- 11.3.3 Efficient pseudocode and breaking a task into modules · Walk-through
- 11.3.3 Efficient pseudocode and breaking a task into modules · Past-paper walk-through
- 12.1 Program Development Life cycle · Walk-through
- 12.1 Program Development Life cycle · Past-paper walk-through
- 12.2 Program Design · Walk-through
- 12.2 Program Design · Past-paper walk-through
- 12.2.1 State-transition Diagrams · Walk-through
- 12.2.1 State-transition Diagrams · Past-paper walk-through
- 12.3 Program Testing and Maintenance · Walk-through
- 12.3 Program Testing and Maintenance · Past-paper walk-through
- 12.3.1 Test strategy, test plans and choosing a testing method · Walk-through
- 12.3.1 Test strategy, test plans and choosing a testing method · Past-paper walk-through
- 13.1 User-defined data types · Walk-through
- 13.1 User-defined data types · Past-paper walk-through
- 13.1.1 Designing a user-defined type for a problem, and the linked list · Walk-through
- 13.2 File organisation and access · Walk-through
- 13.2 File organisation and access · Past-paper walk-through
- 13.3 Floating-point numbers, representation and manipulation · Walk-through
- 13.3 Floating-point numbers, representation and manipulation · Past-paper walk-through
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow · Walk-through
- 14.1 Protocols · Walk-through
- 14.1 Protocols · Past-paper walk-through
- 14.2 Circuit switching, packet switching · Walk-through
- 14.2 Circuit switching, packet switching · Past-paper walk-through
- 15.1 Processors, Parallel Processing and Virtual Machines · Walk-through
- 15.1 Processors, Parallel Processing and Virtual Machines · Past-paper walk-through
- 15.2 Boolean Algebra and Logic Circuits · Walk-through
- 15.2 Boolean Algebra and Logic Circuits · Past-paper walk-through
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps · Walk-through
- 16.1 Purposes of an Operating System (OS) · Walk-through
- 16.1 Purposes of an Operating System (OS) · Past-paper walk-through
- 16.2 Translation Software · Walk-through
- 16.2 Translation Software · Past-paper walk-through
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions · Walk-through
- 17.1 Encryption, Encryption Protocols and Digital Certificates · Walk-through
- 17.1 Encryption, Encryption Protocols and Digital Certificates · Past-paper walk-through
- 18.1 Artificial Intelligence (AI) · Walk-through
- 18.1 Artificial Intelligence (AI) · Past-paper walk-through
- 19.1 Algorithms · Walk-through
- 19.1 Algorithms · Past-paper walk-through
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O · Walk-through
- 19.2 Recursion · Walk-through
- 19.2 Recursion · Past-paper walk-through
- 20.1 Programming Paradigms · Walk-through
- 20.1 Programming Paradigms · Past-paper walk-through
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals · Walk-through
- 20.2 File Processing and Exception Handling · Walk-through
- 20.2 File Processing and Exception Handling · Past-paper walk-through
Course units and learning goals
These lessons teach selected course objectives. Check the remaining coverage gaps; the material is not a complete preparation programme.
A.1 · Computer fundamentals
- Checking an asserted identity.
- Separate authentication from authorization. Authentication checks identity; authorization determines permitted actions. A threat model connects a valuable asset, a possible attack and an appropriate control.
- Use a fictitious school dataset to define users and permissions. Draw data flows, compare validation and verification, and specify tests for normal, boundary and invalid input. Do not use real credentials or student records in exercises.
- authentication
- Checking an asserted identity
- authorization
- Determining permitted actions
A.2 · Networks
- Achieved rate of useful data transfer.
- Transmission time depends on data size and rate. Total delay may also include propagation, processing and queueing. Encryption protects content under its assumptions but does not remove congestion or every metadata exposure.
- Trace a message route using a documented local model. Record payload size, units and measured time. Use school-approved networks and synthetic messages; do not scan or intercept another user traffic.
- throughput
- Achieved rate of useful data transfer
- latency
- Delay experienced in communication
A.3 · Databases
- Attribute set uniquely identifying a table row.
- A join combines rows according to a specified condition. The result count depends on relationship cardinality and filters. A foreign key constraint enforces a relationship rule; it does not automatically encrypt personal data.
- Design a small synthetic user-order dataset with no real personal information. Declare keys, test duplicate and missing-reference inserts, then check a query result against a hand-worked expected table.
- primary key
- Attribute set uniquely identifying a table row
- foreign key
- Attribute set referencing a key in another table
A.4 · Machine learning
- An attribute set uniquely identifying a record.
- A primary key uniquely identifies a record; a foreign key relates records. In prediction, leakage can expose information unavailable at the real decision time. Accuracy alone may hide an unbalanced target distribution.
- Use fictional booking records to identify entities, attributes and relationships. For a learning exercise, use a public non-sensitive dataset, separate training and test data, and describe who may be affected by errors. The current 2027 CS objective scope awaits the acquired guide.
- primary key
- An attribute set uniquely identifying a record
- data leakage
- Use of information unavailable at the intended prediction time
B.1 · Computational thinking
- A finite procedure solving a stated task.
- State input conditions and expected outputs. Use boundary cases, empty collections where allowed, duplicates and invalid values. Distinguish a wrong algorithm from a wrong implementation or an incomplete requirement.
- Trace a search over a small fictional sorted list. State the indexing convention. For binary search, update bounds so the remaining interval shrinks and reject unsorted input unless sorting is part of the task.
- algorithm
- A finite procedure solving a stated task
- boundary test
- A test at a limit of the allowed input range
B.2 · Programming
- A finite procedure solving a stated task.
- State input conditions and expected outputs. Use boundary cases, empty collections where allowed, duplicates and invalid values. Distinguish a wrong algorithm from a wrong implementation or an incomplete requirement.
- Trace a search over a small fictional sorted list. State the indexing convention. For binary search, update bounds so the remaining interval shrinks and reject unsorted input unless sorting is part of the task.
- algorithm
- A finite procedure solving a stated task
- boundary test
- A test at a limit of the allowed input range
B.3 · Object-oriented programming
- Controlling access to state through an interface.
- A method call acts on a particular instance. State changes should satisfy preconditions and postconditions. Polymorphism lets code use a common interface with different implementations when the contract is respected.
- Implement a small synthetic account or inventory model. Test two independent instances, rejected invalid operations and boundary values. Keep the model away from real financial accounts and credentials.
- encapsulation
- Controlling access to state through an interface
- instance
- An individual object of a class
B.4 · Abstract data types (HL only)
- A last-in-first-out abstract data type.
- Choose the structure for the required access pattern. Complexity depends on implementation and assumptions: removing the first item from a shifting array differs from advancing a head pointer in a queue.
- Trace operation sequences by hand, then compare a program with the expected states. Test empty, singleton and repeated operations. State overflow behaviour if capacity is fixed.
- stack
- A last-in-first-out abstract data type
- queue
- A first-in-first-out abstract data type
Case study · Case study
- Completed work per unit time under a stated workload.
- A recommendation should connect a requirement to a mechanism and an observable test. For example, a concurrency problem requires a strategy that prevents conflicting updates, plus tests demonstrating the invariant. A claim about faster response requires comparable workload measurements rather than only a complexity label. Evaluate alternatives under the same stated conditions.
- Use an original school-approved scenario and synthetic data. Build a matrix of claim, supporting scenario evidence, technical explanation, limitation and acceptance test. Mark missing facts explicitly and show how the recommendation would change if an assumption failed. This prepares case-based reasoning without reproducing an unavailable IB assessment case study or inventing its examination rubric.
- throughput
- Completed work per unit time under a stated workload
- acceptance test
- A test of whether a specified user requirement is met
IA · Computational solution
- A finite procedure solving a stated task.
- State input conditions and expected outputs. Use boundary cases, empty collections where allowed, duplicates and invalid values. Distinguish a wrong algorithm from a wrong implementation or an incomplete requirement.
- Trace a search over a small fictional sorted list. State the indexing convention. For binary search, update bounds so the remaining interval shrinks and reject unsorted input unless sorting is part of the task.
- algorithm
- A finite procedure solving a stated task
- boundary test
- A test at a limit of the allowed input range
Preparing for this qualification
- This ordering records the 2027 A/B structure separately from the 2014 course final assessment in 2026.
- Do not carry forward old Options A–D or the old assessment weights. A.4 machine learning and B.3 OOP are in the new public structure; B.4 is HL-only.
- Current paper marks, case-study assessment differences, approved language conventions and IA rubric remain blocked pending the current guide.
- The project is a school-supervised working computational solution with requirements, tests and user evaluation, never an invented written replacement.
Teaching coverage still needed
- 2027 exact objectives/rubrics not verified from an acquired guide. These original foundation cases do not establish full current-course parity.
Specifications and sample documents
Course materials
Course preparation
Documents are available. Board-specific notes, assessments and interactive past-paper practice are not yet available for every course.
Lessons →