Saltar al contenido

Diploma del Bachillerato Internacional · IB Diploma

Computer Science · HL

Papeles, muestras y documentos curriculares para este curso.

← Exámenes

Material complementario, hojas de ejercicios y diapositivas

Los documentos compartidos sobre un tema conservan sus títulos de curso y tema originales. Utiliza la especificación de tu junta reguladora para cobertura, nivel y requisitos de examen.

Material de apoyo · Diploma del Bachillerato Internacional · IB Diploma · Computer Science · HL (10)
Hojas de ejercicios · Diploma del Bachillerato Internacional · IB Diploma · Computer Science · HL (26)
Diapositivas de presentación · Diploma del Bachillerato Internacional · IB Diploma · Computer Science · HL (10)
Diapositivas de resolución de ejercicios · Diploma del Bachillerato Internacional · IB Diploma · Computer Science · HL (26)
Material de apoyo · A-Level Ciencias de la Computación (20)
Hojas de ejercicios · A-Level Ciencias de la Computación (88)
Diapositivas de presentación · A-Level Ciencias de la Computación (20)
Diapositivas de resolución de ejercicios · A-Level Ciencias de la Computación (167)

Unidades del curso y objetivos de aprendizaje

Estas lecciones enseñan objetivos del curso seleccionados. Revisa los vacíos de cobertura restantes; el material no es un programa completo de preparación.

A.1 · Fundamentos informáticos
  • 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.
autenticación
Verificación de una identidad afirmada
autorización
Determinación de acciones 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.
rendimiento
Tasa lograda de transferencia útil de datos
latencia
Retraso experimentado en la comunicación
A.3 · Bases de datos
  • 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.
clave primaria
Conjunto de atributos que identifican exclusivamente una fila de tabla
clave foránea
Conjunto de atributos que hace referencia a una clave en otra tabla
A.4 · Aprendizaje automático
  • 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.
clave primaria
Un conjunto de atributos que identifica exclusivamente un registro
fuga de datos
Uso de información no disponible en el momento previsto para la predicción
B.1 · Pensamiento 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
Un procedimiento finito que resuelve una tarea planteada
prueba de límite
Una prueba en un límite del rango de entrada permitido
B.2 · Programación
  • 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
Un procedimiento finito que resuelve una tarea planteada
prueba de límite
Una prueba en un límite del rango de entrada permitido
B.3 · Programación 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.
encapsulamiento
Controlar el acceso al estado a través de una interfaz
instancia
Un objeto individual de una clase
B.4 · Tipos abstractos de datos (solo 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.
pila
Un tipo abstracto de datos último-entrada-primera-salida
cola
Un tipo abstracto de datos primera-entrada-primera-salida
Case study · Estudio 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.
rendimiento
Trabajo realizado por unidad de tiempo bajo una carga de trabajo especificada.
prueba de aceptación
Una prueba para verificar si se cumple un requisito específico del usuario
IA · Solución 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
Un procedimiento finito que resuelve una tarea planteada
prueba de límite
Una prueba en un límite del rango de entrada permitido

Preparación para esta cualificación

  • 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 docente aún necesaria

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

Especificaciones y documentos de muestra

Materiales del curso

Preparación del curso

Los documentos están disponibles. Las notas específicas de la entidad evaluadora, las evaluaciones y la práctica interactiva deantiguos exámenes no están disponibles aún para todos los cursos.

Lecciones →

Iniciar sesión o crear cuenta

IGCSE, A-Level & AP