International Baccalaureate · IB Diploma
Computer Science · HL
Papers, amostras e documentos curriculares deste curso.
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)
- 1. A.1 · Fundamentos de computação
- 2. A.2 · Redes
- 3. A.3 · Bancos de dados
- 4. A.4 · Aprendizado de máquina
- 5. B.1 · Pensamento computacional
- 6. B.2 · Programação
- 7. B.3 · Programação orientada a objetos
- 8. B.4 · Tipos abstratos de dados (apenas HL)
- 9. Estudo de caso · Estudo de caso
- 10. IA · Solução computacional
Folhas de exercícios · International Baccalaureate · 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 Recursão
- 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 Árvores binárias de busca
- 8.3 Sets and hash tables
- 9.1 Case study skills
- 10.1 Computational solution skills
Slides de apresentação · International Baccalaureate · IB Diploma · Computer Science · HL (10)
- 1. A.1 · Fundamentos de computação
- 2. A.2 · Redes
- 3. A.3 · Bancos de dados
- 4. A.4 · Aprendizado de máquina
- 5. B.1 · Pensamento computacional
- 6. B.2 · Programação
- 7. B.3 · Programação orientada a objetos
- 8. B.4 · Tipos abstratos de dados (apenas HL)
- 9. Estudo de caso · Estudo de caso
- 10. IA · Solução computacional
Slides de resolução de exercícios · International Baccalaureate · 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 Recursão · 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 Árvores binárias de busca · 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 apoio · Ciência da Computação A-Level (20)
- 1. Representação de informações
- 2. Comunicação
- 3. Hardware
- 4. Fundamentos do Processador
- 5. Software de Sistema
- 6. Segurança, privacidade e integridade dos dados
- 7. Ética e Propriedade
- 8. Bancos de Dados
- 9. Projeto de Algoritmos e Resolução de Problemas
- 10. Tipos e Estruturas de Dados
- 11. Programação
- 12. Desenvolvimento de Software
- 13. Representação de Dados
- 14. Tecnologias de Comunicação e Internet
- 15. Hardware e Máquinas Virtuais
- 16. Software de Sistema
- 17. Segurança
- 18. Inteligência Artificial (IA)
- 19. Pensamento computacional e resolução de problemas
- 20. Programação Avançada
Folhas de exercícios · Ciência da Computação A-Level (88)
- 1.1 Representação de Dados
- 1.1.2 Binary magnitudes, one's complement, subtraction and where BCD and hex are used
- 1.2 Multimídia
- 1.2.1 Encoding a picture and a sound: the file header, the drawing list, and sampling
- 1.3 Compressão
- 2.1 Redes incluindo a 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 Computadores e seus 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 Portas Lógicas e 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 Arquitetura da Unidade Central de Processamento (CPU)
- 4.1.1 Registers, interrupts, ports and performance
- 4.2 Linguagem de Montagem
- 4.3 Manipulação de bits
- 4.3.1 Arithmetic and cyclic shifts, and when a shift stops being a multiply or a divide
- 5.1 Sistemas Operacionais
- 5.1.1 Utility software
- 5.1.2 Program libraries and DLL files
- 5.2 Tradutores de Linguagem
- 5.2.1 Partial compilation (Java) and the IDE
- 6.1 Segurança de Dados
- 6.2 Integridade de Dados
- 7.1 Ética e Propriedade
- 7.1.1 Professional bodies, justifying a software licence, and the impact of AI
- 8.1 Conceitos de Banco de Dados
- 8.1.1 Relationships and E-R diagrams
- 8.1.2 Normalisation from UNF to 3NF
- 8.2 Sistemas de Gerenciamento de Banco de Dados (DBMS)
- 8.3 Linguagem de Definição de Dados (DDL) e Linguagem de Manipulação de Dados (DML)
- 8.3.1 Joining two tables, aggregates with GROUP BY, and choosing SQL data types
- 9.1 Habilidades de Pensamento 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 Dados e Registros
- 10.2 Matrizes
- 10.2.1 Bubble sort, array bounds and the standard array routines
- 10.2.2 Arrays - combined exam practice
- 10.3 Arquivos
- 10.4 Introdução a Tipos de Dados Abstratos (ADT)
- 10.4.1 The circular queue, a linked list in arrays, and choosing the right ADT
- 11.1 Noções Básicas de Programação
- 11.1.1 Operators and expressions
- 11.1.2 Built-in functions and library routines
- 11.2 Construtos
- 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 Programação Estruturada
- 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 do Desenvolvimento de Programas
- 12.2 Structure Charts
- 12.2.1 State-transition Diagrams
- 12.3 Teste e Manutenção de Programas
- 12.3.1 Test strategy, test plans and choosing a testing method
- 13.1 Tipos de dados definidos pelo usuário
- 13.1.1 Designing a user-defined type for a problem, and the linked list
- 13.2 Organização e acesso a arquivos
- 13.3 Números de ponto flutuante, representação e manipulação
- 13.3.1 The mantissa-exponent trade-off, normalisation, and overflow and underflow
- 14.1 Protocolos
- 14.2 Comutação por circuito, comutação por pacotes
- 15.1 Processadores, Processamento Paralelo e Máquinas Virtuais
- 15.2 Álgebra Booleana e Circuitos Lógicos
- 15.2.1 The full adder, flip-flops drawn and traced, and four-variable Karnaugh maps
- 16.1 Propósitos de um Sistema Operacional (SO)
- 16.2 Software de Tradução
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions
- 17.1 Criptografia, Protocolos de Criptografia e Certificados Digitais
- 18.1 Inteligência Artificial (IA)
- 19.1 Algoritmos
- 19.1.1 ADT algorithms - linked lists, binary trees, graphs, and Big O
- 19.2 Recursão
- 20.1 Paradigmas de Programação
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals
- 20.2 Processamento de Arquivos e Tratamento de Exceções
Slides de apresentação · Ciência da Computação A-Level (20)
- 1. Representação de informações
- 2. Comunicação
- 3. Hardware
- 4. Fundamentos do Processador
- 5. Software de Sistema
- 6. Segurança, privacidade e integridade dos dados
- 7. Ética e Propriedade
- 8. Bancos de Dados
- 9. Projeto de Algoritmos e Resolução de Problemas
- 10. Tipos e Estruturas de Dados
- 11. Programação
- 12. Desenvolvimento de Software
- 13. Representação de Dados
- 14. Tecnologias de Comunicação e Internet
- 15. Hardware e Máquinas Virtuais
- 16. Software de Sistema
- 17. Segurança
- 18. Inteligência Artificial (IA)
- 19. Pensamento computacional e resolução de problemas
- 20. Programação Avançada
Slides de resolução de exercícios · Ciência da Computação A-Level (167)
- 1.1 Representação de Dados · Walk-through
- 1.1 Representação de Dados · Past-paper walk-through
- 1.1.1 Representação de Dados · 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 Multimídia · Walk-through
- 1.2 Multimídia · 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 Compressão · Walk-through
- 1.3 Compressão · Past-paper walk-through
- 1.3.1 Compressão · Past-paper walk-through
- 2.1 Redes incluindo a internet · Walk-through
- 2.1 Redes incluindo a 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 Computadores e seus componentes · Walk-through
- 3.1 Computadores e seus 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 Portas Lógicas e Circuitos Lógicos · Walk-through
- 3.2 Portas Lógicas e 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 Arquitetura da Unidade Central de Processamento (CPU) · Walk-through
- 4.1 Arquitetura da Unidade Central de Processamento (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 Linguagem de Montagem · Walk-through
- 4.2 Linguagem de Montagem · Past-paper walk-through
- 4.3 Manipulação de bits · Walk-through
- 4.3 Manipulação 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 Operacionais · Walk-through
- 5.1 Sistemas Operacionais · 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 Tradutores de Linguagem · Walk-through
- 5.2 Tradutores de Linguagem · 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 Segurança de Dados · Walk-through
- 6.1 Segurança de Dados · Past-paper walk-through
- 6.2 Integridade de Dados · Walk-through
- 6.2 Integridade de Dados · Past-paper walk-through
- 7.1 Ética e Propriedade · Walk-through
- 7.1 Ética e Propriedade · 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 Conceitos de Banco de Dados · Walk-through
- 8.1 Conceitos de Banco de Dados · 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 Gerenciamento de Banco de Dados (DBMS) · Walk-through
- 8.2 Sistemas de Gerenciamento de Banco de Dados (DBMS) · Past-paper walk-through
- 8.3 Linguagem de Definição de Dados (DDL) e Linguagem de Manipulação de Dados (DML) · Walk-through
- 8.3 Linguagem de Definição de Dados (DDL) e Linguagem de Manipulação de Dados (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 Pensamento Computacional · Walk-through
- 9.1 Habilidades de Pensamento 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 Dados e Registros · Walk-through
- 10.1 Tipos de Dados e Registros · Past-paper walk-through
- 10.2 Matrizes · Walk-through
- 10.2 Matrizes · 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 Arquivos · Walk-through
- 10.3 Arquivos · Past-paper walk-through
- 10.4 Introdução a Tipos de Dados Abstratos (ADT) · Walk-through
- 10.4 Introdução a Tipos de Dados Abstratos (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 Noções Básicas de Programação · Walk-through
- 11.1 Noções Básicas de Programação · 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 Construtos · Walk-through
- 11.2 Construtos · 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 Programação Estruturada · Walk-through
- 11.3 Programação Estruturada · 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 do Desenvolvimento de Programas · Walk-through
- 12.1 Ciclo de Vida do Desenvolvimento de Programas · Past-paper walk-through
- 12.2 Design de Programas · Walk-through
- 12.2 Design 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 Teste e Manutenção de Programas · Walk-through
- 12.3 Teste e Manutenção 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 dados definidos pelo usuário · Walk-through
- 13.1 Tipos de dados definidos pelo usuário · Past-paper walk-through
- 13.1.1 Designing a user-defined type for a problem, and the linked list · Walk-through
- 13.2 Organização e acesso a arquivos · Walk-through
- 13.2 Organização e acesso a arquivos · Past-paper walk-through
- 13.3 Números de ponto flutuante, representação e manipulação · Walk-through
- 13.3 Números de ponto flutuante, representação e manipulação · 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 Comutação por circuito, comutação por pacotes · Walk-through
- 14.2 Comutação por circuito, comutação por pacotes · Past-paper walk-through
- 15.1 Processadores, Processamento Paralelo e Máquinas Virtuais · Walk-through
- 15.1 Processadores, Processamento Paralelo e Máquinas Virtuais · Past-paper walk-through
- 15.2 Álgebra Booleana e Circuitos Lógicos · Walk-through
- 15.2 Álgebra Booleana e 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 um Sistema Operacional (SO) · Walk-through
- 16.1 Propósitos de um Sistema Operacional (SO) · Past-paper walk-through
- 16.2 Software de Tradução · Walk-through
- 16.2 Software de Tradução · Past-paper walk-through
- 16.2.1 Recursive BNF, syntax diagrams, and RPN in both directions · Walk-through
- 17.1 Criptografia, Protocolos de Criptografia e Certificados Digitais · Walk-through
- 17.1 Criptografia, Protocolos de Criptografia e Certificados Digitais · Past-paper walk-through
- 18.1 Inteligência Artificial (IA) · Walk-through
- 18.1 Inteligência Artificial (IA) · 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 Recursão · Walk-through
- 19.2 Recursão · Past-paper walk-through
- 20.1 Paradigmas de Programação · Walk-through
- 20.1 Paradigmas de Programação · Past-paper walk-through
- 20.1.1 The five addressing modes, and declarative programming with facts, rules and goals · Walk-through
- 20.2 Processamento de Arquivos e Tratamento de Exceções · Walk-through
- 20.2 Processamento de Arquivos e Tratamento de Exceções · Past-paper walk-through
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 →