Cambridge IAL Computer Science key terms

A step-by-step procedure for solving a problem or performing a computation. It must be unambiguous, have a finite number of steps, and produce a result for valid inputs.

The process of removing unnecessary details to focus on the essential features of a problem. It simplifies complex systems, making them easier to understand and solve.

Breaking a complex problem into smaller, more manageable sub-problems that can be solved independently. This makes the overall problem easier to tackle and understand.

A structured, English-like way of describing an algorithm without strict syntax rules. It is used to plan and communicate logic before coding in a specific language.

A diagram that uses standard symbols (e.g., ovals for start/end, rectangles for processes, diamonds for decisions) to represent the steps of an algorithm visually.

A search algorithm that checks each element of a list in sequence until the target is found or the list ends. It works on unsorted data but is inefficient for large lists.

A search algorithm that repeatedly divides a sorted list in half, comparing the target with the middle element, to locate the target efficiently. It requires the data to be sorted.

A sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. Larger elements 'bubble' to the end.

A sorting algorithm that builds the sorted list one element at a time by inserting each new element into its correct position among the already sorted elements.

A programming paradigm based on objects that contain data (attributes) and methods (procedures). It promotes modularity, reuse, and encapsulation.

A blueprint or template that defines the attributes and methods common to all objects of a certain kind. Objects are created (instantiated) from a class.

An instance of a class. It has its own state (values of attributes) and can perform actions defined by its class's methods.

A mechanism in OOP where a new class (subclass) acquires the attributes and methods of an existing class (superclass). It supports code reuse and hierarchical classification.

The bundling of data and methods within a class, hiding internal state from outside access. It protects data integrity and reduces coupling between components.

The ability of different classes to respond to the same method call in their own way. It allows objects of different types to be treated uniformly through a common interface.

A technique where a function calls itself to solve a smaller instance of the same problem. It requires a base case to terminate, preventing infinite loops.

A set of rules that governs how data is transmitted and received over a network. It ensures that devices can communicate reliably despite differences in hardware or software.

A suite of protocols used for communication on the Internet. TCP ensures reliable, ordered delivery of data, while IP handles addressing and routing of packets.

A unique numerical label assigned to each device on a network that uses the Internet Protocol. It identifies the device's location and enables routing of data packets.

A small unit of data transmitted over a network. It contains a header with source and destination addresses and a payload with the actual data.

A network architecture where client devices request services or resources from a central server, which processes requests and returns responses.

A hierarchical system that translates human-readable domain names (e.g., www.example.com) into IP addresses, enabling browsers to locate web servers.

An application-layer protocol used for transmitting web pages and other resources over the Internet. It defines how messages are formatted and transmitted between web clients and servers.

The primary component of a computer that executes instructions. It fetches, decodes, and executes program instructions, performing arithmetic and logical operations.

A digital circuit within the CPU that performs arithmetic (e.g., addition, subtraction) and logical (e.g., AND, OR, NOT) operations on data.

The part of the CPU that directs the operation of the processor. It decodes instructions and coordinates the flow of data between components.

A small, fast storage location within the CPU used to hold data temporarily during processing. Examples include the program counter and accumulator.

A small, high-speed memory located close to the CPU that stores frequently accessed data and instructions to reduce average access time.

Volatile primary memory that stores data and instructions currently in use. It allows random access and is erased when power is lost.

Non-volatile memory that stores permanent instructions, such as the boot firmware. Its contents cannot be easily changed during normal operation.

A base-2 number system that uses only two digits, 0 and 1. It is the fundamental representation of data in digital computers.

A base-16 number system using digits 0-9 and letters A-F. It provides a compact way to represent binary values, often used in programming and memory addresses.

The smallest unit of data in computing, representing a single binary digit (0 or 1). It is the basic building block for all digital information.

A unit of data consisting of 8 bits. It is commonly used to represent a single character (e.g., in ASCII) or small integer values.

A character encoding standard that assigns numeric codes (0-127) to letters, digits, and symbols. It enables computers to represent and exchange text data.

A universal character encoding standard that supports a wide range of characters from many writing systems, enabling consistent text representation across different platforms and languages.

A data structure that stores a fixed-size sequence of elements of the same type in contiguous memory locations. Elements are accessed by index.

A dynamic data structure consisting of nodes, each containing data and a reference (link) to the next node. It allows efficient insertion and deletion but slower access than arrays.

A linear data structure that follows the Last-In-First-Out (LIFO) principle. Elements are added and removed from the same end, called the top.

A linear data structure that follows the First-In-First-Out (FIFO) principle. Elements are added at the rear and removed from the front.