International Baccalaureate · IB Diploma

Computer Science · HL

Papers, sampel, dan dokumen kurikulum untuk kursus ini.

Lembaran kerja, lembar latihan, dan salindia

Dokumen topik yang dibagikan mempertahankan judul kursus dan topik sumbernya. Gunakan spesifikasi dewan ujian pilihan Anda untuk cakupan, tingkatan, dan persyaratan ujian.

Lembar kerja · International Baccalaureate · IB Diploma · Computer Science · HL (10)

Lembar latihan · International Baccalaureate · IB Diploma · Computer Science · HL (26)

Salindia presentasi · International Baccalaureate · IB Diploma · Computer Science · HL (10)

Salindia panduan latihan · International Baccalaureate · IB Diploma · Computer Science · HL (26)

Lembar kerja · Ilmu Komputer A-Level (20)

Lembar latihan · Ilmu Komputer A-Level (88)

Salindia presentasi · Ilmu Komputer A-Level (20)

Salindia panduan latihan · Ilmu Komputer A-Level (167)

Unit kursus dan tujuan pembelajaran

Pelajaran ini mengajarkan tujuan kursus tertentu. Periksa kesenjangan cakupan yang tersisa; materi ini bukan program persiapan lengkap.

Pelajaran →Latihan kosakata →

A.1 · Dasar komputer

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.

otentikasi: Memeriksa identitas yang dinyatakan
otorisasi: Menentukan tindakan yang diizinkan

A.2 · Jaringan

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: Tingkat transfer data berguna yang tercapai
latensi: Penundaan yang dialami dalam komunikasi

A.3 · Database

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.

kunci utama: Set atribut yang secara unik mengidentifikasi baris tabel
kunci asing: Set atribut yang merujuk ke kunci di tabel lain

A.4 · Pembelajaran mesin

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.

kunci utama: Set atribut yang secara unik mengidentifikasi sebuah rekaman
kebocoran data: Penggunaan informasi yang tidak tersedia pada waktu prediksi yang dituju

B.1 · Berpikir komputasional

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.

algoritma: Prosedur terbatas untuk menyelesaikan tugas yang ditetapkan
uji batas: Uji pada batas rentang input yang diperbolehkan

B.2 · Pemrograman

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.

algoritma: Prosedur terbatas untuk menyelesaikan tugas yang ditetapkan
uji batas: Uji pada batas rentang input yang diperbolehkan

B.3 · Pemrograman berorientasi objek

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.

enkapsulasi: Mengontrol akses ke status melalui antarmuka
instansi: Sebuah objek individu dari suatu kelas

B.4 · Tipe data abstrak (HL saja)

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.

tumpukan: Tipe data abstrak last-in-first-out
antrean: Tipe data abstrak first-in-first-out

Case study · Studi kasus

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: Kerja selesai per satuan waktu di bawah beban kerja yang ditentukan
uji penerimaan: Uji apakah persyaratan pengguna tertentu terpenuhi

IA · Penyelesaian komputasi

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.

algoritma: Prosedur terbatas untuk menyelesaikan tugas yang ditetapkan
uji batas: Uji pada batas rentang input yang diperbolehkan

Menyiapkan diri untuk kualifikasi ini

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.