国际文凭组织 · IB Diploma
计算机科学 · HL
本课程的文件、样卷和课程大纲。
讲义、练习卷和幻灯片
共享主题文档保留其原始课程和主题名称。请使用所选考试局的考纲来确定覆盖范围、等级和考试要求。
讲义 · 国际文凭组织 · IB Diploma · 计算机科学 · HL (10)
练习页 · 国际文凭组织 · IB Diploma · 计算机科学 · 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
演示文稿幻灯片 · 国际文凭组织 · IB Diploma · 计算机科学 · HL (10)
习题讲解幻灯片 · 国际文凭组织 · IB Diploma · 计算机科学 · 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
讲义 · A-Level 计算机科学 (20)
练习页 · A-Level 计算机科学 (88)
- 1.1 数据表示
- 1.1.2 二进制数量级、反码、减法,以及 BCD 与十六进制的用途
- 1.2 多媒体
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling
- 1.3 压缩
- 2.1 网络(含互联网)
- 2.1.1 网络类型、客户端—服务器与对等模型,以及拓扑结构
- 2.1.2 云计算、传输介质、以太网与 CSMA/CD,以及互联网硬件
- 2.1.3 Finding a server: URLs, the Domain Name Service and IP addressing
- 3.1 计算机及其部件
- 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 逻辑门与逻辑电路
- 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 中央处理器(CPU)体系结构
- 4.1.1 寄存器、中断、端口与性能
- 4.2 汇编语言
- 4.3 位操作
- 4.3.1 算术移位与循环移位,以及移位何时不再等价于乘除
- 5.1 操作系统
- 5.1.1 Utility software
- 5.1.2 Program libraries and DLL files
- 5.2 语言翻译程序
- 5.2.1 Partial compilation (Java) and the IDE
- 6.1 数据安全
- 6.2 数据完整性
- 7.1 伦理与所有权
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI
- 8.1 数据库概念
- 8.1.1 Relationships and E-R diagrams
- 8.1.2 Normalisation from UNF to 3NF
- 8.2 数据库管理系统(DBMS)
- 8.3 数据定义语言(DDL)与数据操纵语言(DML)
- 8.3.1 两表连接、GROUP BY 聚合,以及 SQL 数据类型的选择
- 9.1 计算思维技能
- 9.1.1 Abstraction and decomposition in practice
- 9.2 算法
- 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 数据类型与记录
- 10.2 数组
- 10.2.1 冒泡排序、数组边界与常用数组算法
- 10.2.2 Arrays - combined exam practice
- 10.3 文件
- 10.4 抽象数据类型(ADT)导论
- 10.4.1 循环队列、用数组实现链表,以及抽象数据类型的选择
- 11.1 编程基础
- 11.1.1 Operators and expressions
- 11.1.2 Built-in functions and library routines
- 11.2 程序结构
- 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 结构化编程
- 11.3.1 Functions, and choosing between a procedure and a function
- 11.3.2 传值与传引用参数,以及变量作用域
- 11.3.3 Efficient pseudocode and breaking a task into modules
- 12.1 程序开发生命周期
- 12.2 Structure Charts
- 12.2.1 State-transition Diagrams
- 12.3 程序测试与维护
- 12.3.1 测试策略、测试计划与测试方法的选择
- 13.1 用户自定义数据类型
- 13.1.1 Designing a user-defined type for a problem, and the linked list
- 13.2 文件组织与访问
- 13.3 浮点数的表示与运算
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow
- 14.1 协议
- 14.2 电路交换与分组交换
- 15.1 处理器、并行处理与虚拟机
- 15.2 布尔代数与逻辑电路
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps
- 16.1 操作系统(OS)的功能
- 16.2 翻译软件
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions
- 17.1 加密、加密协议与数字证书
- 18.1 人工智能(AI)
- 19.1 算法
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O
- 19.2 递归
- 20.1 编程范式
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals
- 20.2 文件处理与异常处理
演示文稿幻灯片 · A-Level 计算机科学 (20)
习题讲解幻灯片 · A-Level 计算机科学 (167)
- 1.1 数据表示 · Walk-through
- 1.1 数据表示 · Past-paper walk-through
- 1.1.1 数据表示 · Past-paper walk-through
- 1.1.2 二进制数量级、反码、减法,以及 BCD 与十六进制的用途 · Walk-through
- 1.1.2 二进制数量级、反码、减法,以及 BCD 与十六进制的用途 · Past-paper walk-through
- 1.2 多媒体 · Walk-through
- 1.2 多媒体 · 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 压缩 · Walk-through
- 1.3 压缩 · Past-paper walk-through
- 1.3.1 压缩 · Past-paper walk-through
- 2.1 网络(含互联网) · Walk-through
- 2.1 网络(含互联网) · Past-paper walk-through
- 2.1.1 网络类型、客户端—服务器与对等模型,以及拓扑结构 · Walk-through
- 2.1.1 网络类型、客户端—服务器与对等模型,以及拓扑结构 · Past-paper walk-through
- 2.1.2 云计算、传输介质、以太网与 CSMA/CD,以及互联网硬件 · 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 计算机及其部件 · Walk-through
- 3.1 计算机及其部件 · 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 逻辑门与逻辑电路 · Walk-through
- 3.2 逻辑门与逻辑电路 · 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 中央处理器(CPU)体系结构 · Walk-through
- 4.1 中央处理器(CPU)体系结构 · Past-paper walk-through
- 4.1.1 寄存器、中断、端口与性能 · Walk-through
- 4.1.1 寄存器、中断、端口与性能 · Past-paper walk-through
- 4.2 汇编语言 · Walk-through
- 4.2 汇编语言 · Past-paper walk-through
- 4.3 位操作 · Walk-through
- 4.3 位操作 · Past-paper walk-through
- 4.3.1 算术移位与循环移位,以及移位何时不再等价于乘除 · Walk-through
- 5.1 操作系统 · Walk-through
- 5.1 操作系统 · 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 语言翻译程序 · Walk-through
- 5.2 语言翻译程序 · 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 数据安全 · Walk-through
- 6.1 数据安全 · Past-paper walk-through
- 6.2 数据完整性 · Walk-through
- 6.2 数据完整性 · Past-paper walk-through
- 7.1 伦理与所有权 · Walk-through
- 7.1 伦理与所有权 · 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 数据库概念 · Walk-through
- 8.1 数据库概念 · 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 数据库管理系统(DBMS) · Walk-through
- 8.2 数据库管理系统(DBMS) · Past-paper walk-through
- 8.3 数据定义语言(DDL)与数据操纵语言(DML) · Walk-through
- 8.3 数据定义语言(DDL)与数据操纵语言(DML) · Past-paper walk-through
- 8.3.1 两表连接、GROUP BY 聚合,以及 SQL 数据类型的选择 · Walk-through
- 8.3.1 两表连接、GROUP BY 聚合,以及 SQL 数据类型的选择 · Past-paper walk-through
- 9.1 计算思维技能 · Walk-through
- 9.1 计算思维技能 · 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 算法 · Walk-through
- 9.2 算法 · 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 数据类型与记录 · Walk-through
- 10.1 数据类型与记录 · Past-paper walk-through
- 10.2 数组 · Walk-through
- 10.2 数组 · Past-paper walk-through
- 10.2.1 冒泡排序、数组边界与常用数组算法 · Walk-through
- 10.2.1 冒泡排序、数组边界与常用数组算法 · Past-paper walk-through
- 10.2.2 Arrays - combined exam practice · Walk-through
- 10.3 文件 · Walk-through
- 10.3 文件 · Past-paper walk-through
- 10.4 抽象数据类型(ADT)导论 · Walk-through
- 10.4 抽象数据类型(ADT)导论 · Past-paper walk-through
- 10.4.1 循环队列、用数组实现链表,以及抽象数据类型的选择 · Walk-through
- 10.4.1 循环队列、用数组实现链表,以及抽象数据类型的选择 · Past-paper walk-through
- 11.1 编程基础 · Walk-through
- 11.1 编程基础 · 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 程序结构 · Walk-through
- 11.2 程序结构 · 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 结构化编程 · Walk-through
- 11.3 结构化编程 · 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 传值与传引用参数,以及变量作用域 · Walk-through
- 11.3.2 传值与传引用参数,以及变量作用域 · 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 程序开发生命周期 · Walk-through
- 12.1 程序开发生命周期 · Past-paper walk-through
- 12.2 程序设计 · Walk-through
- 12.2 程序设计 · Past-paper walk-through
- 12.2.1 State-transition Diagrams · Walk-through
- 12.2.1 State-transition Diagrams · Past-paper walk-through
- 12.3 程序测试与维护 · Walk-through
- 12.3 程序测试与维护 · Past-paper walk-through
- 12.3.1 测试策略、测试计划与测试方法的选择 · Walk-through
- 12.3.1 测试策略、测试计划与测试方法的选择 · Past-paper walk-through
- 13.1 用户自定义数据类型 · Walk-through
- 13.1 用户自定义数据类型 · Past-paper walk-through
- 13.1.1 Designing a user-defined type for a problem, and the linked list · Walk-through
- 13.2 文件组织与访问 · Walk-through
- 13.2 文件组织与访问 · Past-paper walk-through
- 13.3 浮点数的表示与运算 · Walk-through
- 13.3 浮点数的表示与运算 · Past-paper walk-through
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow · Walk-through
- 14.1 协议 · Walk-through
- 14.1 协议 · Past-paper walk-through
- 14.2 电路交换与分组交换 · Walk-through
- 14.2 电路交换与分组交换 · Past-paper walk-through
- 15.1 处理器、并行处理与虚拟机 · Walk-through
- 15.1 处理器、并行处理与虚拟机 · Past-paper walk-through
- 15.2 布尔代数与逻辑电路 · Walk-through
- 15.2 布尔代数与逻辑电路 · Past-paper walk-through
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps · Walk-through
- 16.1 操作系统(OS)的功能 · Walk-through
- 16.1 操作系统(OS)的功能 · Past-paper walk-through
- 16.2 翻译软件 · Walk-through
- 16.2 翻译软件 · Past-paper walk-through
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions · Walk-through
- 17.1 加密、加密协议与数字证书 · Walk-through
- 17.1 加密、加密协议与数字证书 · Past-paper walk-through
- 18.1 人工智能(AI) · Walk-through
- 18.1 人工智能(AI) · Past-paper walk-through
- 19.1 算法 · Walk-through
- 19.1 算法 · Past-paper walk-through
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O · Walk-through
- 19.2 递归 · Walk-through
- 19.2 递归 · Past-paper walk-through
- 20.1 编程范式 · Walk-through
- 20.1 编程范式 · Past-paper walk-through
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals · Walk-through
- 20.2 文件处理与异常处理 · Walk-through
- 20.2 文件处理与异常处理 · Past-paper walk-through
课程单元与学习目标
这些课程教授选定的教学目标。请检查剩余的覆盖缺口;本材料并非完整的备考方案。
A.1 · 计算机基础
- 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.
- 身份验证
- 核实断言的身份
- 授权
- 确定允许的操作
A.2 · 网络
- 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.
- 吞吐量
- 实际有效数据传输速率
- 延迟
- 通信延迟
A.3 · 数据库
- 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.
- 主键
- 唯一标识表行的属性集
- 外键
- 引用另一表中键的属性集
A.4 · 机器学习
- 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.
- 主键
- 唯一标识记录的属性集
- 数据泄露
- 在预期预测时间点无法获取信息的使用。
B.1 · 计算思维
- 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.
- 算法
- 解决指定任务的有限过程
- 边界测试
- 在允许输入范围边界进行的测试。
B.2 · 编程
- 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.
- 算法
- 解决指定任务的有限过程
- 边界测试
- 在允许输入范围边界进行的测试。
B.3 · 面向对象编程
- 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.
- 封装
- 通过接口控制对状态系统的访问
- 实例
- 类的单个实例对象
B.4 · 抽象数据类型(仅限HL)
- 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.
- 栈
- 后进先出的抽象数据类型
- 队列
- 先进先出的抽象数据类型
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.
- 吞吐量
- 在特定工作负载下单位时间内完成的工作量。
- 验收测试
- 检验是否满足指定用户需求的测试。
IA · 计算求解
- 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.
- 算法
- 解决指定任务的有限过程
- 边界测试
- 在允许输入范围边界进行的测试。
备考指南
- 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.
仍需教学覆盖内容
- 2027 exact objectives/rubrics not verified from an acquired guide. These original foundation cases do not establish full current-course parity.
课程大纲和样件文件
- 计算机科学 — 课程简介 · 2014 ↗
First assessment: 2014
- IB Computer Science first assessment 2027 subject brief ↗
课程资料
课程准备
文档已提供。并非所有课程都具备考试局特定的注释、测评及交互式历年真题练习。
课程 →