国際バカロレア · IB Diploma
Computer Science · SL
このコースのための試験問題、サンプル、カリキュラム資料。
プリント、練習用紙、スライド
共有されたトピック文書は元のコースおよびトピックタイトルを保持します。指定した Examination Board のカリキュラム仕様に基づき、範囲、レベル、試験要件を確認してください。
プリント資料 · 国際バカロレア · IB Diploma · Computer Science · SL (9)
演習シート · 国際バカロレア · IB Diploma · Computer Science · SL (20)
- 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
- 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
- 7.1 Classes and objects
- 7.2 Encapsulation and UML class diagrams
- 8.1 Case study skills
- 9.1 Computational solution skills
プレゼンテーションスライド · 国際バカロレア · IB Diploma · Computer Science · SL (9)
Exercise ウォークスルーのスライド · 国際バカロレア · IB Diploma · Computer Science · SL (20)
- 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
- 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
- 7.1 Classes and objects · Walk-through
- 7.2 Encapsulation and UML class diagrams · Walk-through
- 8.1 Case study skills · Walk-through
- 9.1 Computational solution skills · Walk-through
プリント資料 · A-Level Computer Science (20)
演習シート · A-Level Computer Science (88)
- 1.1 データの表現
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used
- 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 Network types, client-server and peer-to-peer models, and topologies
- 2.1.2 Cloud computing, transmission media, Ethernet and CSMA/CD, and internet hardware
- 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 Registers, interrupts, ports and performance
- 4.2 アセンブリ言語
- 4.3 ビット操作
- 4.3.1 Arithmetic and cyclic shifts, and when a shift stops being a multiply or a divide
- 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 Joining two tables, aggregates with GROUP BY, and choosing SQL data types
- 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 Bubble sort, array bounds and the standard array routines
- 10.2.2 Arrays - combined exam practice
- 10.3 ファイル
- 10.4 抽象データ型(ADT)への入門
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT
- 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 Parameters by value and by reference, and variable scope
- 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 Test strategy, test plans and choosing a testing method
- 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 Computer Science (20)
Exercise ウォークスルーのスライド · A-Level Computer Science (167)
- 1.1 データの表現 · Walk-through
- 1.1 データの表現 · Past-paper walk-through
- 1.1.1 データの表現 · Past-paper walk-through
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used · Walk-through
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used · 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 Network types, client-server and peer-to-peer models, and topologies · Walk-through
- 2.1.1 Network types, client-server and peer-to-peer models, and topologies · Past-paper walk-through
- 2.1.2 Cloud computing, transmission media, Ethernet and CSMA/CD, and internet hardware · 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 Registers, interrupts, ports and performance · Walk-through
- 4.1.1 Registers, interrupts, ports and performance · 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 Arithmetic and cyclic shifts, and when a shift stops being a multiply or a divide · 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 Joining two tables, aggregates with GROUP BY, and choosing SQL data types · Walk-through
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types · 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 Bubble sort, array bounds and the standard array routines · Walk-through
- 10.2.1 Bubble sort, array bounds and the standard array routines · 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 The circular queue, a linked list in arrays, and choosing the right ADT · Walk-through
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT · 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 Parameters by value and by reference, and variable scope · Walk-through
- 11.3.2 Parameters by value and by reference, and variable scope · 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 Test strategy, test plans and choosing a testing method · Walk-through
- 12.3.1 Test strategy, test plans and choosing a testing method · 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.
- カプセル化
- インターフェースを通じて状態へのアクセスを制御すること
- インスタンス
- クラスの個々のオブジェクト
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.
仕様書とサンプル資料
コース教材
コース準備
利用可能な資料があります。board 固有のメモ、評価、および対話型過去問練習は、すべてのコースで利用可能ではありません。
レッスン →