IB Sciences • HL

Computer Science (CS) HL

Browse the full topic structure and open study materials for Computer Science (CS) HL.

Structured practice

Open the course Question Bank

Jump straight into grouped unit practice without losing your place in the syllabus overview.

Open

1 System Fundamentals

1.1 Systems in Organisations

1.1.1 New System Planning in Organisations

1.1.2 Change Management in Systems

1.1.3 Compatibility and Legacy Challenges in Organisations

1.1.4 Remote Systems and Software as a Service (SaaS)

1.1.5 Installation Processes in Systems Development

1.1.6 Data Migration in Systems

1.1.7 System Testing in Organisations

1.1.8 User Documentation in System Implementation

1.1.9 User Training in System Implementation

1.1.10 Data Loss and Software Deployment

1.2 System Design Basics

1.2.1 Computer System Components

1.2.2 Stakeholders in System Planning

1.2.3 Information Gathering for System Solutions

1.2.4 Prototyping and Iteration in System Design

1.2.5 Social and Ethical Issues in IT Systems

1.2.6 Human and Machine Interaction

2 Computer Organisation

4 Networks

4.1 Network Fundamentals

4.1.1 Types of Networks

4.1.2 Importance of Standards

4.1.3 Network Communication Layers

4.1.4 Virtual Private Network (VPN)

4.2 Data Transmission

4.2.1 Protocols and Data Packets

4.2.2 Transmission Media

4.3 Wireless Networking

4.3.1 Pros and Cons of Wireless Networks

4.3.2 Wireless Network Security

4.4 General Principles

4.4.1 Identifying Problem-Solving Procedures in Computer Science

4.4.2 Evaluating Activity Sequences

4.5 Connecting Computational Thinking and Program Design

4.5.1 Understanding and Applying Standard Algorithms

4.5.2 Algorithm Analysis and Construction

4.6 Introduction to Programming

4.6.1 Introduction to Fundamental Computer Operations

4.6.2 Compound Computer Operations

5 Abstract Data Structures (HL)

5.1 Recursive Thinking (HL)

5.1.1 Identification of Recursive Situations

5.1.2 Recursive Solutions in Problems

5.1.3 Tracing Recursive Algorithms

5.2 Two-Dimensional Arrays (HL)

5.2.1 Characteristics of Two-Dimensional Arrays

5.2.2 Algorithm Construction with Two-Dimensional Arrays

5.3 Stacks and Queues (HL)

5.3.1 Understanding Stacks

5.3.2 Stack Algorithm Construction

5.4 Linked Lists (HL)

5.4.1 Dynamics of Linked Lists

5.4.2 Logical Operations in Linked Lists

5.5 Trees (HL)

5.5.1 Logical Operations in Trees

5.5.2 Terminology in Binary Trees

5.6 Applications of Data Structures (HL)

5.6.1 Static vs Dynamic Data Structures

5.6.2 Appropriate Structure Selection

6 Resource Management (HL)

6.1 System Resources (HL)

6.1.1 Identification of System Resources

6.1.2 Evaluation of Computer Systems' Resources

6.1.3 Limitations of System Resources

6.1.4 Problems Due to Resource Limitations

6.2 Role of the Operating System (HL)

6.2.1 The Role of the Operating System in Resource Management

6.2.2 Techniques in OS Resource Management

7 Control (HL)

7.1 Centralized Control Systems (HL)

7.1.1 Variety of Control Systems

7.1.2 Microprocessors and Sensors in Control Systems

7.1.3 Evaluation of Input Devices

7.1.4 Sensor-Processor-Output Relationship

7.1.5 Role of Feedback in Control Systems

7.1.6 Social and Ethical Impacts of Embedded Systems

7.2 Distributed Systems (HL)

7.2.1 Centralised vs Distributed Systems

7.2.2 Role of Autonomous Agents in Distributed Systems

4.4.3 Role of Sub-Procedures in Problem Solving

4.4.4 Decision-Making in Procedures

4.4.5 Conditions in Decision-Making

4.4.6 Inputs and Outputs in Solutions

4.4.7 Pre-Planning in Problem-Solving

4.4.8 Understanding Pre-Conditions

4.4.9 Handling Exceptions in Solutions

4.4.10 Concurrent Processing in Solutions

4.4.11 Abstraction in Computational Solutions

4.5.3 Efficiency and Execution of Algorithms

4.5.4 Real-World Application and Problem-Solving in Computational Thinking

4.5.5 Advanced Computational Thinking in IB Computer Science

4.6.3 Characteristics of Computer Languages

4.6.4 Necessity for Higher-Level Languages

4.6.5 Translation to Executable Code

4.6.6 Understanding Variables, Constants, and Operators

4.6.7 Algorithm Construction with Loops and Branching

4.6.8 Collections in Programming

4.6.9 The Role of Sub-Programmes in Programming

4.6.10 Ethical Implications in Programming

5.3.3 Understanding Queues

5.3.4 Queue Algorithm Construction

5.3.5 Static and Dynamic Structures in Stacks and Queues

5.4.3 Sketching Various Linked Lists

5.5.3 Tree Traversal Techniques in Binary Trees

5.5.4 Sketching Binary Trees

6.2.3 Advantages of Dedicated Operating Systems

6.2.4 Operating Systems and Hardware Complexity

Loading