Cambridge International AS & A Level Computer Science - Vocabulary

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

1/122

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering core concepts, definitions, and technical terms from Cambridge International AS & A Level Computer Science.

Last updated 12:35 PM on 10/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

123 Terms

1
New cards

Binary

A base two number system based on the values 0 and 1 only.

2
New cards

Bit

Abbreviation for binary digit.

3
New cards

One's complement

A representation in which each binary digit in a number is reversed to allow both negative and positive numbers to be represented.

4
New cards

Two's complement

A method of representing positive and negative numbers where each binary digit is reversed and 1 is added in the right-most position.

5
New cards

Sign and magnitude

A binary number system where the left-most bit represents the sign (0=+0 = + and 1=−1 = -) and the remaining bits represent the binary value.

6
New cards

Hexadecimal

A number system based on the value 16, using denary digits 0 to 9 and letters A to F.

7
New cards

Memory dump

The contents of a computer memory output to a screen or printer.

8
New cards

Binary-coded decimal (BCD)

A number system that uses 4 bits to represent each denary digit.

9
New cards

ASCII code

A coding system for all the characters on a keyboard and control codes.

10
New cards

Character set

A list of characters that have been defined by computer hardware and software so that the computer can understand human characters.

11
New cards

Unicode

A coding system which represents all the languages of the world, where the first 128 characters are the same as ASCII code.

12
New cards

Bit-map image

A system that uses pixels arranged in a grid to make up an image.

13
New cards

Pixel

The smallest picture element that makes up an image.

14
New cards

Colour depth

The number of bits used to represent the colours in a pixel, e.g., an 8-bit depth represents 28=2562^8 = 256 colours.

15
New cards

Bit depth

The number of bits used to represent the smallest unit in a sound or image file.

16
New cards

Image resolution

The number of pixels that make up an image, e.g., 4096×31924096 \times 3192 pixels.

17
New cards

Screen resolution

The number of horizontal and vertical pixels that make up a screen display.

18
New cards

Pixel density

The number of pixels per square unit (e.g., per square centimetre or square inch).

19
New cards

Vector graphics

Images that use 2D points to describe lines and curves and their properties, grouped to form geometric shapes.

20
New cards

Sampling resolution

The number of bits used to represent sound amplitude (also known as bit depth).

21
New cards

Sampling rate

The number of sound samples taken per second.

22
New cards

Lossless file compression

A file compression method where the original file can be completely restored following decompression.

23
New cards

Lossy file compression

A file compression method where parts of the original file cannot be recovered during decompression, resulting in lost detail.

24
New cards

Run length encoding (RLE)

A lossless file compression technique used to reduce the size of a string of adjacent, identical data.

25
New cards

Local Area Network (LAN)

A network covering a small geographical area, such as a single building.

26
New cards

Wide Area Network (WAN)

A network covering a very large geographical area, typically made up of interconnected LANs.

27
New cards

Metropolitan Area Network (MAN)

A network larger than a LAN but smaller than a WAN, covering several buildings in a single city or campus.

28
New cards

Client-server model

A network architecture that uses separate dedicated servers and specific client workstations.

29
New cards

Peer-to-peer network

A network in which each node can share its files with all other nodes without a central server.

30
New cards

Thin client

A device or software that heavily depends on a connection to a server to work and perform processing.

31
New cards

Thick client

A device or software that can perform processing independently, whether connected to a server/network or offline.

32
New cards

Cloud storage

A method of data storage where data is saved on off-site physical servers owned and managed by a hosting company.

33
New cards

Data redundancy

A situation in which the same data is stored on several servers in case of maintenance or hardware failure.

34
New cards

Router

A network device that enables data packets to be routed between different networks.

35
New cards

Modem

Modulator demodulator; a device that converts digital data to analogue data for transmission over telephone wires, and vice versa.

36
New cards

Ethernet

A standard protocol (IEEE 802.3) used by many wired local area networks.

37
New cards

CSMA/CD

Carrier Sense Multiple Access with Collision Detection; a protocol used in wired networks to detect collisions and resolve them using random back-off times.

38
New cards

Bit streaming

A contiguous sequence of digital bits sent over a network or the internet.

39
New cards

Domain Name Service (DNS)

A system that translates domain names into IP addresses for internet hosts.

40
New cards

Random Access Memory (RAM)

A volatile primary memory unit that can be written to and read from directly by the CPU.

41
New cards

Read-Only Memory (ROM)

A non-volatile primary memory unit that can only be read from and cannot be altered.

42
New cards

Dynamic RAM (DRAM)

A type of RAM chip consisting of transistors and capacitors that needs to be constantly refreshed to retain data.

43
New cards

Static RAM (SRAM)

A type of high-speed RAM chip that uses flip-flops to hold bits and does not require constant refreshing.

44
New cards

Hard Disk Drive (HDD)

A magnetic storage device that uses spinning platters and read-write heads to store data digitally.

45
New cards

Solid State Drive (SSD)

A non-volatile storage device with no moving parts that relies on controlling the movement of electrons in flash memory chips.

46
New cards

Sensor

An input device that reads or measures physical properties from its surroundings.

47
New cards

Logic gate

An electronic circuit component that relies on 'on/off' logic to take binary inputs and produce a binary output.

48
New cards

Logic circuit

A circuit formed from a combination of logic gates designed to carry out a specific function.

49
New cards

Truth table

A table used to check and display all possible binary input combinations and corresponding outputs for a logic gate or circuit.

50
New cards

Von Neumann architecture

A computer architecture based on the concept of the stored program, featuring a CPU, memory, and shared bus structures.

51
New cards

Arithmetic Logic Unit (ALU)

A component in the CPU that performs arithmetic and logical operations.

52
New cards

Control Unit (CU)

A CPU component that reads instructions from memory, decodes them, and manages data flow by sending control signals.

53
New cards

Program Counter (PC)

A register in the CPU that stores the address of the next instruction to be fetched and executed.

54
New cards

Memory Address Register (MAR)

A CPU register that stores the address of the memory location currently being read from or written to.

55
New cards

Memory Data Register (MDR)

A CPU register that stores data just read from memory or data about to be written to memory.

56
New cards

Current Instruction Register (CIR)

A CPU register that holds the instruction currently being decoded and executed.

57
New cards

Accumulator (ACC)

A general-purpose register in the CPU used to temporarily store numerical values during arithmetic/logic calculations.

58
New cards

Fetch-Execute Cycle

The continuous cycle in which instructions are fetched from memory, decoded, and executed by the CPU.

59
New cards

Interrupt

A signal sent from a hardware device or software to the CPU requesting immediate attention.

60
New cards

Machine code

The low-level binary programming language that a CPU directly understands and executes.

61
New cards

Assembly language

A low-level, machine-specific programming language that uses mnemonics instead of binary code.

62
New cards

Opcode

Short for operation code; the part of an instruction that specifies the operation to be performed.

63
New cards

Operand

The part of an instruction that contains data or the memory address of data to be used.

64
New cards

Assembler

A computer program that translates source code written in assembly language into machine code.

65
New cards

Operating system (OS)

Systems software that provides an environment for applications to run and acts as an interface between hardware and the user.

66
New cards

Compiler

A translator program that converts a high-level language source program into an entire executable object program in machine code.

67
New cards

Interpreter

A translator program that translates and executes a high-level language program line-by-line without producing an object program.

68
New cards

Data privacy

The right to keep personal information stored on computers secret and protected from unauthorized access.

69
New cards

Data security

Methods taken to prevent unauthorized access to data and to recover data if lost or corrupted.

70
New cards

Data integrity

The accuracy, completeness, and consistency of data.

71
New cards

Validation

An automated check performed by computer software to ensure that entered data is reasonable and meets defined criteria.

72
New cards

Verification

A check to ensure that data has been entered or transferred correctly without errors (e.g., via double entry or visual checks).

73
New cards

Plagiarism

The act of taking another person's work or ideas and claiming them as one's own.

74
New cards

Artificial Intelligence (AI)

A machine or software application that performs tasks requiring cognitive abilities similar to human intelligence.

75
New cards

Relational database

A database where data is organised into tables that are linked together using primary and foreign keys.

76
New cards

Primary key

An attribute or set of attributes in a relational database table that uniquely identifies each tuple (record).

77
New cards

Foreign key

An attribute in one table that references the primary key in another table to establish a relationship.

78
New cards

Normalisation

The process of structuring data in a relational database to reduce data redundancy and improve data integrity.

79
New cards

Abstraction

The computational thinking process of extracting essential details while ignoring irrelevant details to create a simplified model.

80
New cards

Decomposition

The computational thinking process of breaking a complex problem down into smaller, more manageable sub-problems.

81
New cards

Array

A data structure containing a fixed number of elements of the same data type, accessed using index values.

82
New cards

Linear search

A searching algorithm that checks every element in a list sequentially from start to end until the item is found or the end is reached.

83
New cards

Bubble sort

A sorting algorithm that repeatedly steps through a list, compares adjacent elements, and swaps them if they are out of order.

84
New cards

Stack

An abstract data type operating on a Last In, First Out (LIFO) structure where items are added (pushed) and removed (popped) from the top.

85
New cards

Queue

An abstract data type operating on a First In, First Out (FIFO) structure where items are added at the rear and removed from the front.

86
New cards

Linked list

An abstract data type containing nodes where each node contains data and a pointer pointing to the next node in the list.

87
New cards

Procedure

A defined block of programming code that performs a specific task without returning a value to the calling program.

88
New cards

Function

A defined block of programming code that performs a task and always returns a single value to the calling program.

89
New cards

Structure chart

A design diagram used to decompose a system into a hierarchy of sub-tasks and show the data passed between modules.

90
New cards

Dry run

A manual testing process where a programmer steps line-by-line through an algorithm recording variable values in a trace table.

91
New cards

User-defined data type

A custom data type constructed by a programmer based on existing primitive data types or previously defined types.

92
New cards

Serial file organisation

A file organisation method where records are stored physically one after another in the order they were added.

93
New cards

Sequential file organisation

A file organisation method where records are stored physically one after another in a specific sorted order based on a key field.

94
New cards

Random file organisation

A file organisation method where records are stored in available memory locations determined by a hashing algorithm.

95
New cards

Binary floating-point number

A representation of real numbers in binary expressed in the form M×2EM \times 2^E, where MM is the mantissa and EE is the exponent.

96
New cards

Circuit switching

A transmission method in which a dedicated physical path or channel is established and maintained for the entire duration of communication.

97
New cards

Packet switching

A transmission method where messages are divided into independent packets that are routed across a network via different paths.

98
New cards

CISC

Complex Instruction Set Computer; a processor architecture designed to execute complex multi-cycle instructions directly in hardware.

99
New cards

RISC

Reduced Instruction Set Computer; a processor architecture optimized to execute simple, single-cycle instructions using pipelining.

100
New cards

Pipelining

A technique in processor design that allows multiple instruction execution stages to overlap and execute simultaneously.