IB Computer Science HL study guide
IB Computer Science HL · Work through your exam, one topic at a time.
IB Computer Science HL is the higher-level subject course in the International Baccalaureate Diploma Programme, assessed through two external written papers and an internally assessed computational solution. It suits students who want to understand how computer systems are built and managed, and who are willing to design, code and document a substantial piece of software of their own. The IB Computer Science HL study guide has 8 sections and about 2,388 words.
01System Fundamentals: Organizations, Changeover and System Design
System fundamentals examines how an organization plans, installs, operates and changes an information system. Questions often ask you to choose a changeover method, justify a backup strategy, or explain why a legacy system creates migration risk.
345 words, about 2 min02Computer Organization: CPU, Memory Hierarchy and Data Representation
Computer organization tests the CPU and memory hierarchy, data representation and logic. Expect fetch–decode–execute sequencing, register roles, RISC/CISC trade-offs, cache behavior, secondary storage comparisons, OS functions and binary arithmetic.
305 words, about 2 min03Networks: Architecture, Protocols and Security
Networks tests how data moves between devices and how that movement is secured. Questions cover network types and topologies, hardware, protocols and layers, IP addressing, packet switching, and threats and countermeasures.
312 words, about 2 min04Computational Thinking, Problem-Solving and Programming
This domain tests computational thinking and program design: decomposition, abstraction, pattern recognition, algorithm construction, pseudocode, trace tables and testing. HL candidates must also reason about efficiency and recursive solutions.
282 words, about 1 min05Abstract Data Structures (HL): Stacks, Queues, Lists, Trees and Graphs
Abstract data structures tests how data is organized and operated on independently of its implementation. HL questions cover stacks, queues, linked lists, binary trees and graphs, including operations, traversals, applications and complexity.
291 words, about 1 min06Resource Management (HL): Scheduling, Memory and Deadlock
Resource management tests how an operating system allocates CPU time, memory, storage and devices. HL questions cover process states, scheduling, virtual memory, interrupts and deadlock.
297 words, about 1 min07Control (HL): Sensors, Feedback and Embedded Systems
Control tests how systems sense, decide and act. HL questions cover sensors, actuators, controllers, feedback, open- and closed-loop systems, embedded systems and the social implications of automation.
265 words, about 1 min08Internal Assessment: Building and Documenting a Computational Solution
The internal assessment tests your ability to build a computational solution for a real client and document the process. It is assessed holistically against planning, solution overview, development, functionality and evaluation.
291 words, about 1 min