国际文凭组织 · IB Diploma
计算机科学 · HL
Papers, samples and curriculum documents for this course. · 本课程的文件、样卷和课程大纲。
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 · 课程大纲和样件文件
- 计算机科学 — 课程简介 · 2014 ↗
First assessment: 2014
- IB Computer Science first assessment 2027 subject brief ↗
Course materials · 课程资料
Course preparation · 课程准备
Documents are available. Board-specific notes, assessments and interactive past-paper practice are not yet available for every course. · 文档已提供。并非所有课程都具备考试局特定的注释、测评及交互式历年真题练习。
Lessons · 课程 →