Diploma del Bachillerato Internacional · IB Diploma
Computer Science · HL
Papeles, muestras y documentos curriculares para este curso.
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)
- 1. A.1 · Fundamentos informáticos
- 2. A.2 · Redes
- 3. A.3 · Bases de datos
- 4. A.4 · Aprendizaje automático
- 5. B.1 · Pensamiento computacional
- 6. B.2 · Programación
- 7. B.3 · Programación orientada a objetos
- 8. B.4 · Tipos abstractos de datos (solo HL)
- 9. Estudio de caso · Estudio de caso
- 10. IA · Solución computacional
Hojas de ejercicios · Diploma del Bachillerato Internacional · IB Diploma · Computer Science · 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 Recursividad
- 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 Árboles binarios de búsqueda
- 8.3 Sets and hash tables
- 9.1 Case study skills
- 10.1 Computational solution skills
Diapositivas de presentación · Diploma del Bachillerato Internacional · IB Diploma · Computer Science · HL (10)
- 1. A.1 · Fundamentos informáticos
- 2. A.2 · Redes
- 3. A.3 · Bases de datos
- 4. A.4 · Aprendizaje automático
- 5. B.1 · Pensamiento computacional
- 6. B.2 · Programación
- 7. B.3 · Programación orientada a objetos
- 8. B.4 · Tipos abstractos de datos (solo HL)
- 9. Estudio de caso · Estudio de caso
- 10. IA · Solución computacional
Diapositivas de resolución de ejercicios · Diploma del Bachillerato Internacional · IB Diploma · Computer Science · 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 Recursividad · 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 Árboles binarios de búsqueda · Walk-through
- 8.3 Sets and hash tables · Walk-through
- 9.1 Case study skills · Walk-through
- 10.1 Computational solution skills · Walk-through
Material de apoyo · A-Level Ciencias de la Computación (20)
- 1. Representación de información
- 2. Comunicación
- 3. Hardware
- 4. Fundamentos del procesador
- 5. Software de sistema
- 6. Seguridad, privacidad e integridad de datos
- 7. Ética y propiedad
- 8. Bases de datos
- 9. Diseño de algoritmos y resolución de problemas
- 10. Tipos y estructuras de datos
- 11. Programación
- 12. Desarrollo de software
- 13. Representación de datos
- 14. Tecnologías de comunicación e Internet
- 15. Hardware y máquinas virtuales
- 16. Software de sistema
- 17. Seguridad
- 18. Inteligencia artificial (AI)
- 19. Pensamiento computacional y resolución de problemas
- 20. Programación avanzada
Hojas de ejercicios · A-Level Ciencias de la Computación (88)
- 1.1 Representación de datos
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used
- 1.2 Multimedia
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling
- 1.3 Compresión
- 2.1 Redes, incluyendo Internet
- 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 Computadoras y sus componentes
- 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 Puertas lógicas y circuitos lógicos
- 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 Arquitectura de la unidad central de procesamiento (CPU)
- 4.1.1 Registers, interrupts, ports and performance
- 4.2 Lenguaje ensamblador
- 4.3 Manipulación de bits
- 4.3.1 Arithmetic and cyclic shifts, and when a shift stops being a multiply or a divide
- 5.1 Sistemas operativos
- 5.1.1 Utility software
- 5.1.2 Program libraries and DLL files
- 5.2 Traductores de lenguajes
- 5.2.1 Partial compilation (Java) and the IDE
- 6.1 Seguridad de datos
- 6.2 Integridad de datos
- 7.1 Ética y propiedad
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI
- 8.1 Conceptos de bases de datos
- 8.1.1 Relationships and E-R diagrams
- 8.1.2 Normalisation from UNF to 3NF
- 8.2 Sistemas de gestión de bases de datos (DBMS)
- 8.3 Lenguaje de definición de datos (DDL) y lenguaje de manipulación de datos (DML)
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types
- 9.1 Habilidades de pensamiento computacional
- 9.1.1 Abstraction and decomposition in practice
- 9.2 Algoritmos
- 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 Tipos de datos y registros
- 10.2 Arreglos
- 10.2.1 Bubble sort, array bounds and the standard array routines
- 10.2.2 Arrays - combined exam practice
- 10.3 Archivos
- 10.4 Introducción a tipos de datos abstractos (ADT)
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT
- 11.1 Fundamentos de programación
- 11.1.1 Operators and expressions
- 11.1.2 Built-in functions and library routines
- 11.2 Constructos
- 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 Programación estructurada
- 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 Ciclo de vida del desarrollo de programas
- 12.2 Structure Charts
- 12.2.1 State-transition Diagrams
- 12.3 Pruebas y mantenimiento de programas
- 12.3.1 Test strategy, test plans and choosing a testing method
- 13.1 Tipos de datos definidos por el usuario
- 13.1.1 Designing a user-defined type for a problem, and the linked list
- 13.2 Organización y acceso a archivos
- 13.3 Números en punto flotante: representación y manipulación
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow
- 14.1 Protocolos
- 14.2 Conmutación de circuitos, conmutación de paquetes
- 15.1 Procesadores, procesamiento paralelo y máquinas virtuales
- 15.2 Álgebra de Boole y circuitos lógicos
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps
- 16.1 Propósitos de un sistema operativo (OS)
- 16.2 Software traductor
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions
- 17.1 Cifrado, protocolos de cifrado y certificados digitales
- 18.1 Inteligencia artificial (AI)
- 19.1 Algoritmos
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O
- 19.2 Recursividad
- 20.1 Paradigmas de programación
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals
- 20.2 Procesamiento de archivos y manejo de excepciones
Diapositivas de presentación · A-Level Ciencias de la Computación (20)
- 1. Representación de información
- 2. Comunicación
- 3. Hardware
- 4. Fundamentos del procesador
- 5. Software de sistema
- 6. Seguridad, privacidad e integridad de datos
- 7. Ética y propiedad
- 8. Bases de datos
- 9. Diseño de algoritmos y resolución de problemas
- 10. Tipos y estructuras de datos
- 11. Programación
- 12. Desarrollo de software
- 13. Representación de datos
- 14. Tecnologías de comunicación e Internet
- 15. Hardware y máquinas virtuales
- 16. Software de sistema
- 17. Seguridad
- 18. Inteligencia artificial (AI)
- 19. Pensamiento computacional y resolución de problemas
- 20. Programación avanzada
Diapositivas de resolución de ejercicios · A-Level Ciencias de la Computación (167)
- 1.1 Representación de datos · Walk-through
- 1.1 Representación de datos · Past-paper walk-through
- 1.1.1 Representación de datos · 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 Multimedia · Walk-through
- 1.2 Multimedia · 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 Compresión · Walk-through
- 1.3 Compresión · Past-paper walk-through
- 1.3.1 Compresión · Past-paper walk-through
- 2.1 Redes, incluyendo Internet · Walk-through
- 2.1 Redes, incluyendo Internet · 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 Computadoras y sus componentes · Walk-through
- 3.1 Computadoras y sus componentes · 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 Puertas lógicas y circuitos lógicos · Walk-through
- 3.2 Puertas lógicas y circuitos lógicos · 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 Arquitectura de la unidad central de procesamiento (CPU) · Walk-through
- 4.1 Arquitectura de la unidad central de procesamiento (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 Lenguaje ensamblador · Walk-through
- 4.2 Lenguaje ensamblador · Past-paper walk-through
- 4.3 Manipulación de bits · Walk-through
- 4.3 Manipulación de bits · 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 Sistemas operativos · Walk-through
- 5.1 Sistemas operativos · 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 Traductores de lenguajes · Walk-through
- 5.2 Traductores de lenguajes · 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 Seguridad de datos · Walk-through
- 6.1 Seguridad de datos · Past-paper walk-through
- 6.2 Integridad de datos · Walk-through
- 6.2 Integridad de datos · Past-paper walk-through
- 7.1 Ética y propiedad · Walk-through
- 7.1 Ética y propiedad · 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 Conceptos de bases de datos · Walk-through
- 8.1 Conceptos de bases de datos · 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 Sistemas de gestión de bases de datos (DBMS) · Walk-through
- 8.2 Sistemas de gestión de bases de datos (DBMS) · Past-paper walk-through
- 8.3 Lenguaje de definición de datos (DDL) y lenguaje de manipulación de datos (DML) · Walk-through
- 8.3 Lenguaje de definición de datos (DDL) y lenguaje de manipulación de datos (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 Habilidades de pensamiento computacional · Walk-through
- 9.1 Habilidades de pensamiento computacional · 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 Algoritmos · Walk-through
- 9.2 Algoritmos · 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 Tipos de datos y registros · Walk-through
- 10.1 Tipos de datos y registros · Past-paper walk-through
- 10.2 Arreglos · Walk-through
- 10.2 Arreglos · 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 Archivos · Walk-through
- 10.3 Archivos · Past-paper walk-through
- 10.4 Introducción a tipos de datos abstractos (ADT) · Walk-through
- 10.4 Introducción a tipos de datos abstractos (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 Fundamentos de programación · Walk-through
- 11.1 Fundamentos de programación · 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 Constructos · Walk-through
- 11.2 Constructos · 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 Programación estructurada · Walk-through
- 11.3 Programación estructurada · 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 Ciclo de vida del desarrollo de programas · Walk-through
- 12.1 Ciclo de vida del desarrollo de programas · Past-paper walk-through
- 12.2 Diseño de programas · Walk-through
- 12.2 Diseño de programas · Past-paper walk-through
- 12.2.1 State-transition Diagrams · Walk-through
- 12.2.1 State-transition Diagrams · Past-paper walk-through
- 12.3 Pruebas y mantenimiento de programas · Walk-through
- 12.3 Pruebas y mantenimiento de programas · 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 Tipos de datos definidos por el usuario · Walk-through
- 13.1 Tipos de datos definidos por el usuario · Past-paper walk-through
- 13.1.1 Designing a user-defined type for a problem, and the linked list · Walk-through
- 13.2 Organización y acceso a archivos · Walk-through
- 13.2 Organización y acceso a archivos · Past-paper walk-through
- 13.3 Números en punto flotante: representación y manipulación · Walk-through
- 13.3 Números en punto flotante: representación y manipulación · Past-paper walk-through
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow · Walk-through
- 14.1 Protocolos · Walk-through
- 14.1 Protocolos · Past-paper walk-through
- 14.2 Conmutación de circuitos, conmutación de paquetes · Walk-through
- 14.2 Conmutación de circuitos, conmutación de paquetes · Past-paper walk-through
- 15.1 Procesadores, procesamiento paralelo y máquinas virtuales · Walk-through
- 15.1 Procesadores, procesamiento paralelo y máquinas virtuales · Past-paper walk-through
- 15.2 Álgebra de Boole y circuitos lógicos · Walk-through
- 15.2 Álgebra de Boole y circuitos lógicos · Past-paper walk-through
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps · Walk-through
- 16.1 Propósitos de un sistema operativo (OS) · Walk-through
- 16.1 Propósitos de un sistema operativo (OS) · Past-paper walk-through
- 16.2 Software traductor · Walk-through
- 16.2 Software traductor · Past-paper walk-through
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions · Walk-through
- 17.1 Cifrado, protocolos de cifrado y certificados digitales · Walk-through
- 17.1 Cifrado, protocolos de cifrado y certificados digitales · Past-paper walk-through
- 18.1 Inteligencia artificial (AI) · Walk-through
- 18.1 Inteligencia artificial (AI) · Past-paper walk-through
- 19.1 Algoritmos · Walk-through
- 19.1 Algoritmos · Past-paper walk-through
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O · Walk-through
- 19.2 Recursividad · Walk-through
- 19.2 Recursividad · Past-paper walk-through
- 20.1 Paradigmas de programación · Walk-through
- 20.1 Paradigmas de programación · Past-paper walk-through
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals · Walk-through
- 20.2 Procesamiento de archivos y manejo de excepciones · Walk-through
- 20.2 Procesamiento de archivos y manejo de excepciones · Past-paper walk-through
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 →