A1.1.1 — Describe functions and interactions of main CPU components
A1.1.2 — Describe the role of a GPU
A1.1.3 [HL] — Explain differences between CPU and GPU (HL only)
A1.1.4 — Explain purposes of primary memory types
A1.1.5 — Describe the fetch-decode-execute cycle
A1.1.6 [HL] — Describe pipelining in multi-core architectures (HL only)
A1.1.7 — Describe internal and external secondary storage
A1.1.8 — Describe compression
A1.1.9 — Describe cloud computing service types
A1.2.1 — Describe principal methods of representing data
A1.2.2 — Explain how binary is used to store data
A1.2.3 — Describe purpose and use of logic gates
A1.2.4 — Construct and analyse truth tables
A1.2.5 — Construct logic diagrams
A1.3.1 — Describe the role of operating systems
A1.3.2 — Describe functions of an operating system
A1.3.3 — Compare scheduling approaches
A1.3.4 — Evaluate polling and interrupt handling
A1.3.5 [HL] — Explain OS management of multitasking and resource allocation (HL only)
A1.3.6 [HL] — Describe control system components (HL only)
A1.3.7 [HL] — Explain control systems in real-world applications (HL only)
A1.4.1 [HL] — Evaluate interpreters and compilers (HL only)
A2.1.1 — Describe purpose and characteristics of networks
A2.1.2 — Describe modern digital infrastructures
A2.1.3 — Describe functions of network devices
A2.1.4 — Describe transport and application protocols
A2.1.5 [HL] — Describe the TCP/IP model (HL only)
A2.2.1 — Describe functions and applications of network topologies
A2.2.2 [HL] — Describe server functions (HL only)
A2.2.3 — Compare and contrast networking models
A2.2.4 — Explain network segmentation
A2.3.1 — Describe types of IP addressing
A2.3.2 — Compare media for data transmission
A2.3.3 — Explain packet switching
A2.3.4 [HL] — Explain static and dynamic routing (HL only)
A2.4.1 — Discuss effectiveness of firewalls
A2.4.2 [HL] — Describe network vulnerabilities (HL only)
A2.4.3 [HL] — Describe network countermeasures (HL only)
A2.4.4 — Describe encryption and digital certificates
A3.1.1 — Explain relational database features, benefits and limitations
A3.2.1 — Describe database schemas
A3.2.3 — Outline relational database data types
A3.2.4 — Construct tables for relational databases
A3.2.5 — Explain differences between normal forms
A3.2.6 — Construct a database normalized to 3NF
A3.2.7 — Evaluate denormalization
A3.3.1 — Outline SQL data language types
A3.3.2 — Construct SQL queries between two tables
A3.3.3 — Explain updating data in SQL
A3.3.4 [HL] — Construct aggregate calculations in SQL (HL only)
A3.3.5 [HL] — Describe database views (HL only)
A3.3.6 [HL] — Describe transactions and data integrity (HL only)
A3.4.1 [HL] — Outline alternative database models (HL only)
A3.4.2 [HL] — Explain data warehouse objectives (HL only)
A3.4.3 [HL] — Explain OLAP and data mining (HL only)
A3.4.4 [HL] — Describe distributed database features (HL only)
A4.1.1 — Describe types of machine learning and applications
A4.1.2 — Describe hardware requirements for ML deployment
A4.2.1 [HL] — Describe significance of data cleaning (HL only)
A4.2.2 [HL] — Describe role of feature selection (HL only)
A4.2.3 [HL] — Describe importance of dimensionality reduction (HL only)
A4.3.1 [HL] — Explain linear regression (HL only)
A4.3.2 [HL] — Explain classification techniques (HL only)
A4.3.3 [HL] — Explain hyperparameter tuning and evaluation (HL only)
A4.3.4 [HL] — Describe clustering (HL only)
A4.3.5 [HL] — Describe association-rule techniques (HL only)
A4.3.6 [HL] — Describe reinforcement learning (HL only)
A4.3.7 [HL] — Describe genetic algorithms (HL only)
A4.3.8 [HL] — Outline artificial neural networks (HL only)
A4.3.9 [HL] — Describe convolutional neural networks (HL only)
A4.3.10 [HL] — Explain model selection and comparison (HL only)
A4.4.1 — Discuss ethical implications of machine learning
A4.4.2 — Discuss ethical aspects of integrated computer technologies
B2.1.1 — Construct and trace programs using variables and data types
B2.1.2 — Construct programs to extract and manipulate substrings
B2.1.3 — Describe common exception handling techniques
B2.1.4 — Construct and use common debugging techniques
B2.2.1 — Compare static and dynamic data structures
B2.2.2 — Construct programs using arrays and lists
B2.2.3 — Explain stacks as LIFO structures
B2.2.4 — Explain queues as FIFO structures
B2.3.1 — Construct programs using correct sequence of instructions
B2.3.2 — Construct programs using selection structures
B2.3.3 — Construct programs using looping structures
B2.3.4 — Construct functions and modularization
B2.4.1 — Describe algorithm efficiency using Big O
B2.4.2 — Construct and trace linear and binary search
B2.4.3 — Construct and trace bubble sort and selection sort
B2.4.4 [HL] — Explain recursion and applications (HL only)
B2.4.5 [HL] — Construct and trace recursive algorithms (HL only)
B2.5.1 — Construct code for file-processing operations
B3.1.1 — Evaluate fundamentals of OOP
B3.1.2 — Construct a design of classes, methods and behaviour
B3.1.3 — Distinguish static and non-static variables and methods
B3.1.4 — Construct code to define classes and instantiate objects
B3.1.5 — Explain and apply encapsulation and information hiding
B3.2.1 [HL] — Explain and apply inheritance (HL only)
B3.2.2 [HL] — Construct code for polymorphism/method overriding (HL only)
B3.2.3 [HL] — Explain abstraction in OOP (HL only)
B3.2.4 [HL] — Explain composition and aggregation (HL only)
B3.2.5 [HL] — Explain common design patterns (HL only)
B4.1.1 [HL] — Explain properties and purpose of ADTs (HL only)
B4.1.2 [HL] — Evaluate linked lists (HL only)
B4.1.3 [HL] — Construct and apply linked lists (HL only)
B4.1.4 [HL] — Explain binary search trees (HL only)
B4.1.5 [HL] — Construct and apply sets as an ADT (HL only)
B4.1.6 [HL] — Explain core principles of ADTs including hash tables/maps/sets (HL only)