Pular para o conteúdo

International Baccalaureate · IB Diploma

Computer Science · HL

Papers, amostras e documentos curriculares deste curso.

← Provas

Material impresso, folhas de exercícios e slides

Documentos compartilhados mantêm seus títulos originais de curso e tópico. Use a especificação do tabuleiro escolhido para cobertura, nível e requisitos de exame.

Material de apoio · International Baccalaureate · IB Diploma · Computer Science · HL (10)
Folhas de exercícios · International Baccalaureate · IB Diploma · Computer Science · HL (26)
Slides de apresentação · International Baccalaureate · IB Diploma · Computer Science · HL (10)
Slides de resolução de exercícios · International Baccalaureate · IB Diploma · Computer Science · HL (26)
Material de apoio · Ciência da Computação A-Level (20)
Folhas de exercícios · Ciência da Computação A-Level (88)
Slides de apresentação · Ciência da Computação A-Level (20)
Slides de resolução de exercícios · Ciência da Computação A-Level (167)

Unidades do curso e objetivos de aprendizagem

Estas aulas ensinam objetivos selecionados do curso. Verifique as lacunas de cobertura restantes; o material não é um programa completo de preparação.

A.1 · Fundamentos de informática
  • 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.
autenticação
Verificação de uma identidade alegada
autorização
Determinação de ações permitidas
A.2 · Redes
  • 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.
vazão
Taxa alcançada de transferência útil de dados
latência
Atraso experimentado na comunicação
A.3 · Bancos de Dados
  • 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.
chave primária
Conjunto de atributos que identifica exclusivamente uma linha de tabela
chave estrangeira
Conjunto de atributos referenciando uma chave em outra tabela
A.4 · Aprendizado de máquina
  • 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.
chave primária
Um conjunto de atributos que identifica exclusivamente um registro
vazamento de dados
Uso de informação indisponível no momento da previsão pretendida
B.1 · Pensamento computacional
  • 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.
algoritmo
Um procedimento finito que resolve uma tarefa declarada.
teste de fronteira
Um teste em um limite do intervalo de entrada permitido
B.2 · Programação
  • 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.
algoritmo
Um procedimento finito que resolve uma tarefa declarada.
teste de fronteira
Um teste em um limite do intervalo de entrada permitido
B.3 · Programação orientada a objetos
  • 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.
encapsulamento
Controle de acesso ao estado por meio de uma interface.
instância
Um objeto individual de uma classe
B.4 · Tipos abstratos de dados (apenas 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.
pilha
Um tipo abstrato de dado último-entra-primeiro-sai
fila
Um tipo abstrato de dado primeiro-entra-primeiro-sai
Case study · Estudo de caso
  • 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.
vazão
Trabalho concluído por unidade de tempo sob uma carga de trabalho especificada
teste de aceitação
Um teste para verificar se um requisito de usuário especificado é atendido
IA · Solução computacional
  • 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.
algoritmo
Um procedimento finito que resolve uma tarefa declarada.
teste de fronteira
Um teste em um limite do intervalo de entrada permitido

Preparação para esta qualificação

  • 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.

Cobertura do ensino ainda necessária

  • 2027 exact objectives/rubrics not verified from an acquired guide. These original foundation cases do not establish full current-course parity.

Especificações e documentos de exemplo

Materiais do curso

Preparação do curso

Os documentos estão disponíveis. Notas específicas da banca, avaliações e prática interativa de provas anteriores ainda não estão disponíveis para todos os cursos.

Lições →

Entrar ou criar conta

IGCSE, A-Level & AP