Computer Science (First Exam 2027) Flashcards

Notes Cheatsheets Predicted Papers Guides Documents Flashcards
A1.1.1 Functions and Interactions of the Main CPU Components1 deck15 cards
A1.1.2 Role of a GPU1 deck15 cards
A1.1.3 Differences Between the CPU and GPU (HL only)1 deck15 cards
A1.1.4 Purposes of Different Types of Primary Memory1 deck15 cards
A1.1.5 Fetch, Decode, and Execute Cycle1 deck15 cards
A1.1.6 Process of Pipelining in Multi-Core Architectures (HL only)1 deck15 cards
A1.1.7 Internal and External Types of Secondary Memory Storage1 deck15 cards
A1.1.8 Concept of Compression1 deck15 cards
A1.1.9 Different Types of Services in Cloud Computing1 deck15 cards
A1.2.1 Principal Methods of Representing Data1 deck15 cards
A1.2.2 How Binary is Used to Store Data1 deck15 cards
A1.2.3 Purpose and Use of Logic Gates1 deck15 cards
A1.2.4 Constructing and Analyzing Truth Tables1 deck15 cards
A1.2.5 Constructing Logic Diagrams1 deck15 cards
A1.3.1 Role of Operating Systems1 deck15 cards
A1.3.2 Functions of an Operating System1 deck15 cards
A1.3.3 Comparison of Different Approaches to Scheduling1 deck15 cards
A1.3.4 Evaluation of Polling and Interrupt Handling1 deck15 cards
A1.3.5 Role of the Operating System in Managing Multitasking and Resource Allocation (HL only)1 deck15 cards
A1.3.6 Use of Control System Components (HL only)1 deck15 cards
A1.3.7 Control Systems in Real-World Applications (HL only)1 deck15 cards
A1.4.1 Evaluation of Translation Processes: Interpreters and Compilers (HL only)1 deck15 cards
A2.1.1 Purpose and Characteristics of Networks1 deck15 cards
A2.1.2 Purpose, Benefits, and Limitations of Modern Digital Infrastructures1 deck15 cards
A2.1.3 Function of Network Devices1 deck15 cards
A2.1.4 Network Protocols Used for Transport and Application1 deck15 cards
A2.1.5 Function of the TCP/IP Model (HL only)1 deck15 cards
A2.2.1 Functions and Practical Applications of Network Topologies1 deck15 cards
A2.2.2 Function of Servers (HL only)1 deck15 cards
A2.2.3 Compare and Contrast Networking Models1 deck15 cards
A2.2.4 Concepts and Applications of Network Segmentation1 deck15 cards
A2.3.1 Different Types of IP Addressing1 deck15 cards
A2.3.2 Compare Types of Media for Data Transmission1 deck15 cards
A2.3.3 How Packet Switching is Used to Send Data Across a Network1 deck15 cards
A2.3.4 How Static Routing and Dynamic Routing Move Data Across Local Area Networks (HL only)1 deck15 cards
A2.4.1 Effectiveness of Firewalls at Protecting a Network1 deck15 cards
A2.4.2 Common Network Vulnerabilities (HL only)1 deck15 cards
A2.4.3 Common Network Countermeasures (HL only)1 deck15 cards
A2.4.4 Process of Encryption and Digital Certificates1 deck15 cards
A3.1.1 Features, Benefits, and Limitations of a Relational Database1 deck15 cards
A3.2.1 Database Schemas1 deck15 cards
A3.2.2 Constructing Entity Relationship Diagrams (ERDs)1 deck15 cards
A3.2.3 Different Data Types Used in Relational Databases1 deck15 cards
A3.2.4 Constructing Tables for Relational Databases1 deck15 cards
A3.2.5 Differences Between Normal Forms1 deck15 cards
A3.2.6 Constructing a Database Normalized to 3NF for Real-World Scenarios1 deck15 cards
A3.2.7 Evaluating the Need for Denormalizing Databases1 deck15 cards
A3.3.1 Differences Between Data Language Types in SQL1 deck15 cards
A3.3.2 Constructing Queries Between Two Tables in SQL1 deck15 cards
A3.3.3 Using SQL to Update Data in a Database1 deck15 cards
A3.3.4 Constructing Calculations Within a Database Using SQL’s Aggregate Functions (HL only)1 deck15 cards
A3.3.5 Different Database Views (HL only)1 deck15 cards
A3.3.6 How Transactions Maintain Data Integrity in a Database (HL only)1 deck15 cards
A3.4.1 Different Types of Databases as Approaches to Storing Data (HL only)1 deck15 cards
A3.4.2 Primary Objectives of Data Warehouses in Data Management and Business Intelligence1 deck15 cards
A3.4.3 Role of Online Analytical Processing (OLAP) and Data Mining for Business Intelligence1 deck15 cards
A3.4.4 Features of Distributed Databases1 deck15 cards
A4.1.1 Types of Machine Learning and Their Applications in the Real World1 deck15 cards
A4.1.2 Hardware Requirements for Various Scenarios Where Machine Learning is Deployed1 deck15 cards
A4.2.1 Significance of Data Cleaning (HL only)1 deck15 cards
A4.2.2 Role of Feature Selection (HL only)1 deck15 cards
A4.2.3 Importance of Dimensionality Reduction (HL only)1 deck15 cards
A4.3.1 Linear Regression in Predicting Continuous Outcomes (HL only)1 deck15 cards
A4.3.2 Classification Techniques in Supervised Learning (HL only)1 deck15 cards
A4.3.3 Role of Hyperparameter Tuning in Supervised Learning Algorithms (HL only)1 deck15 cards
A4.3.4 Clustering Techniques in Unsupervised Learning (HL only)1 deck15 cards
A4.3.5 Learning Techniques Using the Association Rule Used in Large Data Sets (HL only)1 deck15 cards
A4.3.6 Agents Learning to Make Decisions (HL only)1 deck15 cards
A4.3.7 Application of Genetic Algorithms (HL only)1 deck15 cards
A4.3.8 Structure and Function of ANNs (HL only)1 deck15 cards
A4.3.9 Design of CNNs (HL only)1 deck15 cards
A4.3.10 Model Selection and Comparison in Machine Learning (HL only)1 deck15 cards
A4.4.1 Ethical Implications of Machine Learning in Real-World Scenarios1 deck15 cards
A4.4.2 Ethical Aspects of the Increasing Integration of Computer Technologies into Daily Life1 deck15 cards
B1.1.1 Constructing a Problem Specification1 deck15 cards
B1.1.2 Fundamental Concepts of Computational Thinking1 deck15 cards
B1.1.3 Applying Computational Thinking to Solve Problems in Computer Science1 deck15 cards
B1.1.4 Tracing Flowcharts for a Range of Programming Algorithms1 deck15 cards
B2.1.1 Constructing and Tracing Programs Using Global and Local Variables of Various Data Types1 deck15 cards
B2.1.2 Constructing Programs That Extract and Manipulate Substrings1 deck15 cards
B2.1.3 How Programs Use Common Exception Handling Techniques1 deck15 cards
B2.1.4 Constructing and Using Common Debugging Techniques1 deck15 cards
B2.2.1 Comparing Static and Dynamic Data Structures1 deck15 cards
B2.2.2 Constructing Programs That Apply Arrays and Lists1 deck15 cards
B2.2.3 Concept of a Stack as a "Last In, First Out" (LIFO) Data Structure1 deck15 cards
B2.2.4 Concept of a Queue as a "First In, First Out" (FIFO) Data Structure1 deck15 cards
B2.3.1 Constructing Programs That Implement the Correct Sequence of Code Instructions1 deck15 cards
B2.3.2 Constructing Programs Utilizing Appropriate Selection Structures1 deck15 cards
B2.3.3 Constructing Programs That Utilize Looping Structures1 deck15 cards
B2.3.4 Constructing Functions and Modularization1 deck15 cards
B2.4.1 Efficiency of Specific Algorithms and Big O Notation1 deck15 cards
B2.4.2 Constructing and Tracing Algorithms for Linear and Binary Search1 deck15 cards
B2.4.3 Constructing and Tracing Bubble Sort and Selection Sort, Evaluating Time and Space Complexities1 deck15 cards
B2.4.4 Fundamental Concept of Recursion and Its Applications in Programming (HL only)1 deck15 cards
B2.4.5 Constructing and Tracing Recursive Algorithms in a Programming Language (HL only)1 deck15 cards
B2.5.1 Constructing Code to Perform File-Processing Operations1 deck15 cards
B3.1.1 Evaluating the Fundamentals of OOP1 deck15 cards
B3.1.2 Designing Classes, Their Methods, and Behaviour1 deck15 cards
B3.1.3 Distinguishing Between Static and Non-Static Variables and Methods1 deck15 cards
B3.1.4 Constructing Code to Define Classes and Instantiate Objects1 deck15 cards
B3.1.5 Explaining and Applying the Concepts of Encapsulation and Information Hiding in OOP1 deck15 cards
B3.2.1 Applying the Concept of Inheritance in OOP to Promote Code Reusability (HL only)1 deck15 cards
B3.2.2 Constructing Code to Model Polymorphism and Its Various Forms, Such as Method Overriding (HL only)1 deck15 cards
B3.2.3 Explaining the Concept of Abstraction in OOP (HL only)1 deck15 cards
B3.2.4 Explaining the Role of Composition and Aggregation in Class Relationships (HL only)1 deck15 cards
B3.2.5 Explaining Commonly Used Design Patterns in OOP (HL only)1 deck15 cards
B4.1.1 Properties and Purpose of ADTs in Programming (HL only)1 deck15 cards
B4.1.2 Evaluating Linked Lists (HL only)1 deck15 cards
B4.1.3 Constructing and Applying Linked Lists: Singly, Doubly, and Circular (HL only)1 deck15 cards
B4.1.4 Explaining the Structures and Properties of BSTs (HL only)1 deck13 cards
B4.1.5 Constructing and Applying Sets as an ADT (HL only)1 deck15 cards
B4.1.6 Explaining the Core Principles of ADTs (HL only)1 deck15 cards