Core algorithms, data structures, and systems fundamentals concepts from the IB Computer Science syllabus. Front: the term. Back: a plain-language definition.
40 cards · basic cards · AI-written, checked twice. Edit anything.
- Algorithm
- A precise, step-by-step set of instructions for solving a problem or completing a task.
- Pseudocode
- An informal, code-like description of an algorithm's logic, written for humans rather than a specific programming language.
- Variable
- A named storage location in a program that holds a value which can change during execution.
- Data type
- A classification that specifies what kind of value a variable can hold, such as integer or string.
- Array
- A data structure that stores a fixed-size, ordered collection of elements accessed by index.
- Linked list
- A data structure of nodes where each node points to the next, allowing efficient insertion and removal.
- Stack
- A data structure that adds and removes elements from the same end, following last-in first-out order.
- Queue
- A data structure that adds elements at one end and removes them from the other, following first-in first-out order.
- Binary tree
- A hierarchical data structure in which each node has at most two child nodes.
- Graph data structure
- A structure made of nodes connected by edges, used to represent relationships such as networks.
- Hash table
- A data structure that maps keys to values using a hash function for fast lookup.
- Bubble sort
- A simple sorting algorithm that repeatedly swaps adjacent elements that are out of order.
- Merge sort
- A sorting algorithm that divides a list into halves, sorts each half, then merges them back together.
- Binary search
- A search algorithm that repeatedly halves a sorted list to quickly locate a target value.
- Linear search
- A search algorithm that checks each element of a list in order until the target is found.
FlashKeepers