Pearson BTEC Level 3 National Diploma in Computing - Comprehensive Revision

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/50

flashcard set

Earn XP

Description and Tags

Vocabulary practice flashcards covering computational thinking, data structures, algorithms, CPU architecture, networking, project management, and cybersecurity for Pearson BTEC Level 3 Computing.

51 Terms

1
New cards

Decomposition

Breaking a complex problem down into smaller, more manageable sub-problems that can be solved independently.

2
New cards

Abstraction

Filtering out unnecessary detail and focusing only on the essential characteristics needed to solve the problem.

3
New cards

Pattern Recognition

Identifying similarities or trends within problems to reuse previously proven solutions or logic blocks.

4
New cards

Algorithmic Thinking

Developing a step-by-step set of rules or instructions to solve a problem repeatably.

5
New cards

Array

A fixed size, contiguous memory location data structure storing elements of a single data type, accessed via index (0..N−10\text{..}N-1).

6
New cards

Record

A fixed-structure data structure grouping related items of different data types (e.g., Student Record), accessed using named fields.

7
New cards

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).

8
New cards

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).

9
New cards

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.

10
New cards

Set

An unordered collection of unique values accessed key-based or via hash, where duplicate values are automatically rejected.

11
New cards

Linear Search

A search algorithm with O(n)O(n) time complexity that checks each element sequentially from start to end; works on unsorted data but is inefficient for large datasets.

12
New cards

Binary Search

A search algorithm with O(log⁡(n))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.

13
New cards

Bubble Sort

A sorting algorithm with O(n2)O(n^2) time complexity that passes through a list repeatedly, swapping adjacent out-of-order elements until a full pass occurs with zero swaps.

14
New cards

Insertion Sort

A sorting algorithm with O(n2)O(n^2) 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.

15
New cards

Quick Sort

A divide-and-conquer sorting algorithm with O(nlog⁡(n))O(n \log(n)) average time complexity that selects a pivot element, partitions the array into smaller and larger sub-arrays, and recursively sorts them.

16
New cards

Presence Check

A validation check ensuring a field is not left empty before form submission (e.g., Mandatory Password field).

17
New cards

Range Check

A validation check verifying numeric input falls within specified upper and lower bounds (e.g., Age between 1111 and 1818).

18
New cards

Type Check

A validation check ensuring data entered matches the required data type (e.g., Quantity must be an Integer).

19
New cards

Length Check

A validation check verifying that a text string contains an exact or bounded number of characters (e.g., UK Postcode under 88 chars).

20
New cards

Format Check

A validation check verifying that text conforms to a specific structural layout or regex pattern (e.g., Date as DD/MM/YYYY).

21
New cards

Lookup Check

A validation check testing input against an allowed list of values stored in a table (e.g., Days of week: Mon–Sun).

22
New cards

Arithmetic Logic Unit (ALU)

The CPU component that performs execution of arithmetic calculations (++, −-, ×\times, //) and logical operations (AND, OR, NOT, comparisons).

23
New cards

Control Unit (CU)

The CPU component that decodes instructions, controls internal data timing, and sends control signals to CPU components.

24
New cards

Program Counter (PC)

A CPU register that holds the memory address of the next instruction waiting to be fetched and executed, incrementing by 11 after each fetch step.

25
New cards

Memory Address Register (MAR)

A CPU register that holds the RAM memory location currently being read from or written to by the processor.

26
New cards

Memory Data Register (MDR)

A CPU register that holds the actual instruction or data fetched from or about to be written to RAM memory.

27
New cards

Current Instruction Register (CIR)

A CPU register that stores the current instruction being executed while it is decoded by the Control Unit.

28
New cards

Accumulator (ACC)

A temporary high-speed storage register in the CPU holding intermediate mathematical outputs from the ALU.

29
New cards

Fetch-Decode-Execute Cycle

A continuous CPU cycle consisting of: Fetch instruction from RAM to CPU →\rightarrow Decode instruction in CU →\rightarrow Execute via ALU/Registers.

30
New cards

Two's Complement

A binary representation scheme for signed integers where the most significant bit (MSB) carries a negative weight (e.g., −128-128 for 8-bit8\text{-bit}); simplifies hardware arithmetic by allowing subtraction via addition.

31
New cards

Sample Rate

The number of digital audio samples taken per second, measured in Hz\text{Hz}. Higher values increase audio fidelity but proportionally increase file size.

32
New cards

Bit Depth

The number of bits used per sample in digital audio. Higher values increase dynamic range and fidelity but proportionally increase file size.

33
New cards

ASCII

A character encoding standard using 7/87/8 bits per character, representing up to 256256 characters (primarily English).

34
New cards

Unicode

A character encoding standard using 16/3216/32 bits per character, representing over 140,000140{,}000 characters across all global languages, symbols, and emojis.

35
New cards

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)\text{File Size (bits)} = \text{Width (pixels)} \times \text{Height (pixels)} \times \text{Color Depth (bits per pixel)}, which is divided by 88 for Bytes.

36
New cards

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.

37
New cards

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.

38
New cards

TCP/IP Model Layers

The four-layer network protocol architecture: Application Layer →\rightarrow Transport Layer →\rightarrow Internet Layer →\rightarrow Link (Network Access) Layer.

39
New cards

HTTP / HTTPS

Hypertext Transfer Protocol (Port 8080) / Secure version using SSL/TLS encryption (Port 443443) for web page delivery.

40
New cards

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).

41
New cards

Waterfall Model

A sequential development methodology where phases (Requirements →\rightarrow Design →\rightarrow Implementation →\rightarrow Testing →\rightarrow Maintenance) are completed one by one; rigid and poor for changing requirements.

42
New cards

Agile Methodology

An iterative and flexible software development approach where software is produced in short sprint cycles with continuous customer feedback and evolving requirements.

43
New cards

Gantt Chart

A visual project timeline tool showing tasks, start/end dates, task duration, dependencies, and milestones against a calendar.

44
New cards

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.

45
New cards

TELOS Feasibility Study

A methodology assessing project viability across 55 domains: Technical, Economic, Legal, Operational, and Schedule feasibility.

46
New cards

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.

47
New cards

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.

48
New cards

Computer Misuse Act 1990

A UK law defining 33 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).

49
New cards

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.

50
New cards

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).

51
New cards

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.