1/50
Vocabulary practice flashcards covering computational thinking, data structures, algorithms, CPU architecture, networking, project management, and cybersecurity for Pearson BTEC Level 3 Computing.
Decomposition
Breaking a complex problem down into smaller, more manageable sub-problems that can be solved independently.
Abstraction
Filtering out unnecessary detail and focusing only on the essential characteristics needed to solve the problem.
Pattern Recognition
Identifying similarities or trends within problems to reuse previously proven solutions or logic blocks.
Algorithmic Thinking
Developing a step-by-step set of rules or instructions to solve a problem repeatably.
Array
A fixed size, contiguous memory location data structure storing elements of a single data type, accessed via index (0..N−1).
Record
A fixed-structure data structure grouping related items of different data types (e.g., Student Record), accessed using named fields.
Stack
A dynamic data structure operating on a LIFO (Last In, First Out) basis, where elements are added (push) and removed (pop) from the top (e.g., Undo buffers, function call stacks).
Queue
A dynamic linear structure operating on a FIFO (First In, First Out) basis, where items are enqueued at the rear and dequeued from the front (e.g., Printer queues, process scheduling).
List
A dynamic size collection of elements of variable length with indexed or sequential access, where elements can be added or removed at any position.
Set
An unordered collection of unique values accessed key-based or via hash, where duplicate values are automatically rejected.
Linear Search
A search algorithm with O(n) time complexity that checks each element sequentially from start to end; works on unsorted data but is inefficient for large datasets.
Binary Search
A search algorithm with O(log(n)) time complexity requiring sorted data; compares the target to the midpoint element and repeatedly halves the search space until the item is found.
Bubble Sort
A sorting algorithm with O(n2) time complexity that passes through a list repeatedly, swapping adjacent out-of-order elements until a full pass occurs with zero swaps.
Insertion Sort
A sorting algorithm with O(n2) time complexity that builds a sorted array one item at a time by taking the next unsorted element and inserting it into the correct place.
Quick Sort
A divide-and-conquer sorting algorithm with O(nlog(n)) average time complexity that selects a pivot element, partitions the array into smaller and larger sub-arrays, and recursively sorts them.
Presence Check
A validation check ensuring a field is not left empty before form submission (e.g., Mandatory Password field).
Range Check
A validation check verifying numeric input falls within specified upper and lower bounds (e.g., Age between 11 and 18).
Type Check
A validation check ensuring data entered matches the required data type (e.g., Quantity must be an Integer).
Length Check
A validation check verifying that a text string contains an exact or bounded number of characters (e.g., UK Postcode under 8 chars).
Format Check
A validation check verifying that text conforms to a specific structural layout or regex pattern (e.g., Date as DD/MM/YYYY).
Lookup Check
A validation check testing input against an allowed list of values stored in a table (e.g., Days of week: Mon–Sun).
Arithmetic Logic Unit (ALU)
The CPU component that performs execution of arithmetic calculations (+, −, ×, /) and logical operations (AND, OR, NOT, comparisons).
Control Unit (CU)
The CPU component that decodes instructions, controls internal data timing, and sends control signals to CPU components.
Program Counter (PC)
A CPU register that holds the memory address of the next instruction waiting to be fetched and executed, incrementing by 1 after each fetch step.
Memory Address Register (MAR)
A CPU register that holds the RAM memory location currently being read from or written to by the processor.
Memory Data Register (MDR)
A CPU register that holds the actual instruction or data fetched from or about to be written to RAM memory.
Current Instruction Register (CIR)
A CPU register that stores the current instruction being executed while it is decoded by the Control Unit.
Accumulator (ACC)
A temporary high-speed storage register in the CPU holding intermediate mathematical outputs from the ALU.
Fetch-Decode-Execute Cycle
A continuous CPU cycle consisting of: Fetch instruction from RAM to CPU → Decode instruction in CU → Execute via ALU/Registers.
Two's Complement
A binary representation scheme for signed integers where the most significant bit (MSB) carries a negative weight (e.g., −128 for 8-bit); simplifies hardware arithmetic by allowing subtraction via addition.
Sample Rate
The number of digital audio samples taken per second, measured in Hz. Higher values increase audio fidelity but proportionally increase file size.
Bit Depth
The number of bits used per sample in digital audio. Higher values increase dynamic range and fidelity but proportionally increase file size.
ASCII
A character encoding standard using 7/8 bits per character, representing up to 256 characters (primarily English).
Unicode
A character encoding standard using 16/32 bits per character, representing over 140,000 characters across all global languages, symbols, and emojis.
Bitmap File Size Calculation
The formula used to calculate uncompressed bitmap image size: File Size (bits)=Width (pixels)×Height (pixels)×Color Depth (bits per pixel), which is divided by 8 for Bytes.
Star Topology
A network layout where all devices connect to a central switch/hub; features high reliability (one node failure doesn't crash the network), but the central switch is a single point of failure.
Mesh Topology
A network layout where every node connects to every other node (Full Mesh) or multiple nodes (Partial Mesh); offers excellent redundancy and routing at high cable/hardware cost.
TCP/IP Model Layers
The four-layer network protocol architecture: Application Layer → Transport Layer → Internet Layer → Link (Network Access) Layer.
HTTP / HTTPS
Hypertext Transfer Protocol (Port 80) / Secure version using SSL/TLS encryption (Port 443) for web page delivery.
TCP vs UDP
TCP is connection-oriented and reliable with error checking and packet re-ordering; UDP is connectionless, fast, and unverified (ideal for streaming/gaming).
Waterfall Model
A sequential development methodology where phases (Requirements → Design → Implementation → Testing → Maintenance) are completed one by one; rigid and poor for changing requirements.
Agile Methodology
An iterative and flexible software development approach where software is produced in short sprint cycles with continuous customer feedback and evolving requirements.
Gantt Chart
A visual project timeline tool showing tasks, start/end dates, task duration, dependencies, and milestones against a calendar.
Critical Path Method (CPM)
A technique identifying the sequence of dependent project tasks that determines the absolute minimum total time needed to complete the overall project; slack time on the critical path is zero.
TELOS Feasibility Study
A methodology assessing project viability across 5 domains: Technical, Economic, Legal, Operational, and Schedule feasibility.
Symmetric vs Asymmetric Encryption
Symmetric uses a single shared key to encrypt and decrypt. Asymmetric uses a Public Key to encrypt and a separate Private Key to decrypt.
SQL Injection
An attack where malicious SQL code is inserted into input fields to bypass authentication or access/manipulate backend database tables; prevented by parameterised queries.
Computer Misuse Act 1990
A UK law defining 3 offences: 1. Unauthorized access to computer material; 2. Unauthorized access with intent to commit a crime; 3. Unauthorized modification of computer material (e.g., malware distribution).
Data Protection Act 2018 / GDPR
A UK regulation requiring personal data to be processed lawfully, fairly, transparently, used for specified purposes, kept accurate, secure, and deleted when no longer required.
Encapsulation
An object-oriented concept consisting of bundling data (attributes) and methods operating on that data inside a class, while restricting direct access to internal components using private access modifiers (Data Hiding).
Regression Testing
The software engineering practice of re-running previously passed test suites on modified code to verify that bug fixes or new features have not broken existing functionality.