Computer Science (First Exam 2027) Flashcards

A1.1.1 Functions and Interactions of the Main CPU Components

A1.1.2 Role of a GPU

A1.1.3 Differences Between the CPU and GPU (HL only)

A1.1.4 Purposes of Different Types of Primary Memory

A1.1.5 Fetch, Decode, and Execute Cycle

A1.1.6 Process of Pipelining in Multi-Core Architectures (HL only)

A1.1.7 Internal and External Types of Secondary Memory Storage

A1.1.8 Concept of Compression

A1.1.9 Different Types of Services in Cloud Computing

A1.2.1 Principal Methods of Representing Data

A1.2.2 How Binary is Used to Store Data

A1.2.3 Purpose and Use of Logic Gates

A1.2.4 Constructing and Analyzing Truth Tables

A1.2.5 Constructing Logic Diagrams

A1.3.1 Role of Operating Systems

A1.3.2 Functions of an Operating System

A1.3.3 Comparison of Different Approaches to Scheduling

A1.3.4 Evaluation of Polling and Interrupt Handling

A1.3.5 Role of the Operating System in Managing Multitasking and Resource Allocation (HL only)

A1.3.6 Use of Control System Components (HL only)

A1.3.7 Control Systems in Real-World Applications (HL only)

A1.4.1 Evaluation of Translation Processes: Interpreters and Compilers (HL only)

A2.1.1 Purpose and Characteristics of Networks

A2.1.2 Purpose, Benefits, and Limitations of Modern Digital Infrastructures

A2.1.3 Function of Network Devices

A2.1.4 Network Protocols Used for Transport and Application

A2.1.5 Function of the TCP/IP Model (HL only)

A2.2.1 Functions and Practical Applications of Network Topologies

A2.2.2 Function of Servers (HL only)

A2.2.3 Compare and Contrast Networking Models

A2.2.4 Concepts and Applications of Network Segmentation

A2.3.1 Different Types of IP Addressing

A2.3.2 Compare Types of Media for Data Transmission

A2.3.3 How Packet Switching is Used to Send Data Across a Network

A2.3.4 How Static Routing and Dynamic Routing Move Data Across Local Area Networks (HL only)

A2.4.1 Effectiveness of Firewalls at Protecting a Network

A2.4.2 Common Network Vulnerabilities (HL only)

A2.4.3 Common Network Countermeasures (HL only)

A2.4.4 Process of Encryption and Digital Certificates

A3.1.1 Features, Benefits, and Limitations of a Relational Database

A3.2.1 Database Schemas

A3.2.2 Constructing Entity Relationship Diagrams (ERDs)

A3.2.3 Different Data Types Used in Relational Databases

A3.2.4 Constructing Tables for Relational Databases

A3.2.5 Differences Between Normal Forms

A3.2.6 Constructing a Database Normalized to 3NF for Real-World Scenarios

A3.2.7 Evaluating the Need for Denormalizing Databases

A3.3.1 Differences Between Data Language Types in SQL

A3.3.2 Constructing Queries Between Two Tables in SQL

A3.3.3 Using SQL to Update Data in a Database

A3.3.4 Constructing Calculations Within a Database Using SQL’s Aggregate Functions (HL only)

A3.3.5 Different Database Views (HL only)

A3.3.6 How Transactions Maintain Data Integrity in a Database (HL only)

A3.4.1 Different Types of Databases as Approaches to Storing Data (HL only)

A3.4.2 Primary Objectives of Data Warehouses in Data Management and Business Intelligence

A3.4.3 Role of Online Analytical Processing (OLAP) and Data Mining for Business Intelligence

A3.4.4 Features of Distributed Databases

A4.1.1 Types of Machine Learning and Their Applications in the Real World

A4.1.2 Hardware Requirements for Various Scenarios Where Machine Learning is Deployed

A4.2.1 Significance of Data Cleaning (HL only)

A4.2.2 Role of Feature Selection (HL only)

A4.2.3 Importance of Dimensionality Reduction (HL only)

A4.3.1 Linear Regression in Predicting Continuous Outcomes (HL only)

A4.3.2 Classification Techniques in Supervised Learning (HL only)

A4.3.3 Role of Hyperparameter Tuning in Supervised Learning Algorithms (HL only)

A4.3.4 Clustering Techniques in Unsupervised Learning (HL only)

A4.3.5 Learning Techniques Using the Association Rule Used in Large Data Sets (HL only)

A4.3.6 Agents Learning to Make Decisions (HL only)

A4.3.7 Application of Genetic Algorithms (HL only)

A4.3.8 Structure and Function of ANNs (HL only)

A4.3.9 Design of CNNs (HL only)

A4.3.10 Model Selection and Comparison in Machine Learning (HL only)

A4.4.1 Ethical Implications of Machine Learning in Real-World Scenarios

A4.4.2 Ethical Aspects of the Increasing Integration of Computer Technologies into Daily Life

B1.1.1 Constructing a Problem Specification

B1.1.2 Fundamental Concepts of Computational Thinking

B1.1.3 Applying Computational Thinking to Solve Problems in Computer Science

B1.1.4 Tracing Flowcharts for a Range of Programming Algorithms

B2.1.1 Constructing and Tracing Programs Using Global and Local Variables of Various Data Types

B2.1.2 Constructing Programs That Extract and Manipulate Substrings

B2.1.3 How Programs Use Common Exception Handling Techniques

B2.1.4 Constructing and Using Common Debugging Techniques

B2.2.1 Comparing Static and Dynamic Data Structures

B2.2.2 Constructing Programs That Apply Arrays and Lists

B2.2.3 Concept of a Stack as a "Last In, First Out" (LIFO) Data Structure

B2.2.4 Concept of a Queue as a "First In, First Out" (FIFO) Data Structure

B2.3.1 Constructing Programs That Implement the Correct Sequence of Code Instructions

B2.3.2 Constructing Programs Utilizing Appropriate Selection Structures

B2.3.3 Constructing Programs That Utilize Looping Structures

B2.3.4 Constructing Functions and Modularization

B2.4.1 Efficiency of Specific Algorithms and Big O Notation

B2.4.2 Constructing and Tracing Algorithms for Linear and Binary Search

B2.4.3 Constructing and Tracing Bubble Sort and Selection Sort, Evaluating Time and Space Complexities

B2.4.4 Fundamental Concept of Recursion and Its Applications in Programming (HL only)

B2.4.5 Constructing and Tracing Recursive Algorithms in a Programming Language (HL only)

B2.5.1 Constructing Code to Perform File-Processing Operations

B3.1.1 Evaluating the Fundamentals of OOP

B3.1.2 Designing Classes, Their Methods, and Behaviour

B3.1.3 Distinguishing Between Static and Non-Static Variables and Methods

B3.1.4 Constructing Code to Define Classes and Instantiate Objects

B3.1.5 Explaining and Applying the Concepts of Encapsulation and Information Hiding in OOP

B3.2.1 Applying the Concept of Inheritance in OOP to Promote Code Reusability (HL only)

B3.2.2 Constructing Code to Model Polymorphism and Its Various Forms, Such as Method Overriding (HL only)

B3.2.3 Explaining the Concept of Abstraction in OOP (HL only)

B3.2.4 Explaining the Role of Composition and Aggregation in Class Relationships (HL only)

B3.2.5 Explaining Commonly Used Design Patterns in OOP (HL only)

B4.1.1 Properties and Purpose of ADTs in Programming (HL only)

B4.1.2 Evaluating Linked Lists (HL only)

B4.1.3 Constructing and Applying Linked Lists: Singly, Doubly, and Circular (HL only)

B4.1.4 Explaining the Structures and Properties of BSTs (HL only)

B4.1.5 Constructing and Applying Sets as an ADT (HL only)

B4.1.6 Explaining the Core Principles of ADTs (HL only)