Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

A Level Computer Science Glossary > Glossary > Flashcards

Glossary Flashcards

You may prefer our related Brainscape-certified flashcards:
Biology 101 flashcards
1
Q

Abstract data type

A

a conceptual model of how data can be stored and the operations that can be carried out on the data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Abstraction by generalisation/categorisation

A

the concept of reducing problems by putting similar aspects of a problem into hierarchical categories

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Accepting state

A

the state that identies whether an input string has been accepted. Also known as the goal state

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Address bus

A

used to specify a physical address in memory so that the data bus can access it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Addressable memory

A

the concept that data and instructions are stored in memory using discrete addresses

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Addressing mode

A

the way in which the operand is interpreted

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Adjacency list

A

a data structure that stores a list of nodes with their adjacent nodes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Adjacency matrix

A

a data structure set up as a two-dimensional array or grid that shows whether there is an edge between each pair of nodes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Algorithm

A

a sequence of steps that can be followed to complete a task and that always terminates

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Alphabet

A

the acceptable symbols (characters, numbers) for a given Turing machine

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Analysis

A

the first stage of system development where the problem is identified, researched and alternative solutions proposed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

AND

A

Boolean operation that outputs true if both inputs are true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

AND gate

A

result is true if both inputs are true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Application program interface (API)

A

a set of subroutines that enable one program to interface with another program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Application software

A

programs that perform specic tasks that would need doing even if computers didn’t exist, e.g. editing text, carrying out calculations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Arc

A

a join or relationship between two nodes – also known as an edge

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Argument

A

a value that is passed into a function or subroutine

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Arithmetic Logic Unit (ALU)

A

part of the processor that processes and manipulates data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Arithmetic operation

A

instructions that perform basic maths such as +, –, /, ×

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Array

A

a set of related data items stored under a single identifier and are accessed based on their position. Can work on one or more dimensions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

ASCII

A

a standard binary coding system for characters and numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Assembler

A

a program that translates a program written in assembly language into machine code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Assembly language

A

a way of programming using mnemonics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Assignment

A

the process of giving a value to a variable or constant

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

Association aggregation

A

creating an object that contains other objects, which can continue to exist even if the containing object is destroyed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

Associative array

A

a two-dimensional structure containing key/value pairs of data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

Asymmetric encryption

A

where a public and private key are used to encrypt and decrypt data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Asynchronous data transmission

A

data is transmitted between two devices that do not share a common clock signal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

Attribute

A

a characteristic or piece of information about an entity, which would be stored as a eld in a relational database

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

Automation

A

creating a computer model of a real-life situation and putting it into action

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

Backus-Naur Form (BNF)

A

a form of notation for describing the syntax used by a programming language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

Bandwidth

A

a measure of the capacity of the channel down which the data is being sent. Measured in hertz (Hz)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

Barcode reader

A

a device that uses lasers or LEDs to read the black and white lines of a barcode

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

Baudot code

A

a five-digit character code that predates ASCII and Unicode

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

Big data

A

a generic term for large or complex datasets that are difficult to store and analyse

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

Binary file

A

stores data as sequences of 0s and 1s

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
37
Q

Binary search

A

a technique for searching data that works by splitting datasets in half repeatedly until the search data is found

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
38
Q

Binary tree search

A

a technique for searching a binary tree that traversed the tree until the search term is found

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
39
Q

Binary tree

A

a structure where each node can only have up to two child nodes attached to it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
40
Q

Bit

A

a single binary digit from a binary number – either a zero or a one

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
41
Q

Bit rate

A

the rate at which data is actually being transmitted. Measured in bits per second

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
42
Q

Bit-mapped graphic

A

an image made up of individual pixels

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
43
Q

Black box testing

A

using test data to test for an expected outcome

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
44
Q

Block

A

in data storage it is the concept of storing data into set groups of bits and bytes of a xed length

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
45
Q

Block interface

A

code that describes the data being passed from one subroutine to another

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
46
Q

BODMAS

A

a methodology for evaluating mathematical expressions in a particular sequence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
47
Q

Boolean expression

A

an equation made up of Boolean operations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
48
Q

Boolean operation

A

a single Boolean function that results in a TRUE or FALSE value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
49
Q

Boundary test data

A

test data on or close to the boundary of the acceptable range

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
50
Q

Branch operations

A

operations within an instruction set that allow you to move from one part of the program to another

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
51
Q

Breadth first

A

a method for traversing a graph that explores nodes closest to the starting node rst before progressively exploring nodes that are further away

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
52
Q

Bubble sort

A

a technique for putting data in order by repeatedly stepping through an array, comparing adjacent elements and swapping them if necessary until the array is in order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
53
Q

Bus

A

microscopic parallel wires that transmit data between internal components

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
54
Q

Bus topology

A

a network layout that uses one main data cable as a backbone to transmit data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
55
Q

Bus width

A

the number of bits that can be sent down a bus in one go

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
56
Q

Byte

A

a group of bits, typically 8, used to represent a single character

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
57
Q

Bytecode

A

an instruction set used for programming that can be executed on any computer using a virtual machine

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
58
Q

Cache

A

a high-speed temporary area of memory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
59
Q

Caesar cipher

A

a substitution cipher where one character of plaintext is substituted for another, which becomes the ciphertext

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
60
Q

Call stack

A

a special type of stack used to store information about active subroutines and functions within a program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
61
Q

Cardinal number

A

a number that identies the size of something

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
62
Q

Cardinality

A

the number of elements in a set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
63
Q

Carry bit

A

used to store a 0 or 1 depending on the result of binary addition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
64
Q

Cartesian product

A

combining the elements of two or more sets to create a set of ordered pairs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
65
Q

Certification Authority

A

a trusted organisation that provides digital certicates and signatures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
66
Q

Chaining

A

a technique for generating a unique index when there is a collision by adding the key/value to a list stored at the same index

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
67
Q

Character code

A

a binary representation of a particular letter, number or special character

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
68
Q

Charge coupled device (CCD)

A

in digital cameras it is a sensor that records the amount of light received and convert it into a digital value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
69
Q

Check digit

A

a digit added to the end of binary data to check the data is accurate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
70
Q

Checksum

A

a method of checking the integrity of data by calculating a sum based on the data being sent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
71
Q

Child

A

a node in a tree that has nodes above it in the hierarchy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
72
Q

Chip

A

an electronic component contained within a thin slice of silicon

73
Q

Cipher

A

an algorithm that encrypts and decrypts data, also known as code

74
Q

Ciphertext

A

data that has been encrypted

75
Q

Circular queue

A

a FIFO data structure implemented as a ring where the front and rear pointers can wrap around from the end to the start of the array

76
Q

Class

A

defines the properties and methods of a group of similar objects

77
Q

Class diagram

A

a way of representing the relationship between classes

78
Q

Client-server

A

a network methodology where one computer has the main processing power and storage and the other computers act as clients requesting services from the server

79
Q

Client-server database

A

a way of implementing a database where the database is put into a server and various users can access it from their workstations. The processing, for example, running a query, will take place on the server

80
Q

Client-server model

A

a way of implementing a connection between computers where one computer (the client) makes use of resources of another computer (the server)

81
Q

Clock

A

a device that generates a signal used to synchronise the components of a computer

82
Q

Clustering

A

when a hashing algorithm produces indices that are not randomly distributed

83
Q

Code of conduct

A

a voluntary set of rules that dene the way in which individuals and organisations will behave

84
Q

Codomain

A

all the values that may be output from a mathematical function

85
Q

Collision

A

when a hashing algorithm produces the same index for two or more different keys

86
Q

Colour depth

A

the number of bits or bytes allocated to represent the colour of a pixel in a bit-mapped graphic

87
Q

Commitment ordering

A

a technique to ensure concurrent transactions on a shared database are executed based on the timestamp of when the request is made and also the precedence the request takes over other simultaneous request

88
Q

Compiler

A

a program that translates a high-level language into machine code by translating all of the code

89
Q

Complementary metal oxide semiconductor (CMOS)

A

is an alternative technology that performs the same functions as a CCD

90
Q

Components

A

the values within a vector

91
Q

Composition

A

building up a whole system from smaller units. The opposite of decomposition

92
Q

Composition aggregation

A

creating an object that contains other objects, and will cease to exist if the containing object is destroyed

93
Q

Compression

A

the process of reducing the size of a le

94
Q

Computational hardness

A

the degree of difculty in cracking a cipher

95
Q

Computational security

A

a concept of how secure data encryption is

96
Q

Concurrence

A

the concept of two users trying to access the same data item at the same time

97
Q

Constant

A

an item of data whose value does not change

98
Q

Constant time

A

in Big O notation where the time taken to run an algorithm does not vary with the input size

99
Q

Context-free language

A

an unambiguous way of describing the syntax of a language useful where the language is complex

100
Q

Control bus

A

controls the ow of data between the processor and other parts of the computer

101
Q

Control unit

A

part of the processor that manages the execution of instructions

102
Q

Controller

A

in SSDs a controller is needed to organise data into blocks for storage purposes

103
Q

Convex combinations

A

a method of multiplying vectors that produces a resulting vector within the convex hull

104
Q

Convex hull

A

a spatial representation of the vector space between two vectors

105
Q

Copyright

A

the legal ownership that applies to software, music, lms and other content

106
Q

Countable set

A

a finite set where the elements can be counted using natural numbers

107
Q

Countably infinite sets

A

sets where the elements can be put into a one-to-one correspondence with the set of natural numbers

108
Q

CRUD

A

an acronym that explains the main functions of a database: Create, Read, Update, Delete

109
Q

Cultural issues

A

factors that have an impact on the ways in which we function as a society

110
Q

Current Instruction Register (CIR)

A

register that stores the instructions that the CPU is currently decoding/executing

111
Q

Data abstraction

A

hiding how data is represented so that it is easier to build a new kind of data object, e.g. building a stack from an array

112
Q

Data Bus

A

transfers data between the processor and memory

113
Q

Data Dictionary

A

a list of all the data being used in the system including name, length, data type and validation

114
Q

Data flow diagram (DFD)

A

a visual method of showing how data passes around a system

115
Q

Data misuse

A

using data for purposes other than for which it was collected

116
Q

Data Structure

A

a common format for storing large volumes of related data, which is an implementation of an abstract data type

117
Q

Data transfer operation

A

operations within an instruction set that move data around between the registers and memory

118
Q

Data type

A

determines what sort of data is being stored, e.g. integer, real, and how it will be handled by the program

119
Q

Database management system

A

software that enables the management of all aspects of a database including adding, updating and querying the data

120
Q

De Morgan’s Law

A

a process for simplifying Boolean expressions

121
Q

Debug

A

the process of finding and correcting errors in programs

122
Q

Declaration

A

the process of defining variables and constants in terms if their name and data type

123
Q

Declarative Language

A

languages that declare or specify what properties a result should have, e.g. results will be based on functions

124
Q

Decomposition

A

breaking down a large task into a series of subtasks

125
Q

Decryption

A

the process of deciphering encrypted data or messages

126
Q

Definite iteration

A

a process that repeats a set number of times

127
Q

Depth first

A

a method for traversing a graph that starts at a chosen node and explores as far as possible along each branch away from the starting node before backtracking

128
Q

Design

A

the second stage of system development where the algorithms, data and interface are designed

129
Q

Dictionary (data structure)

A

a data structure that maps keys to data

130
Q

Dictionary-based encoding

A

a method of compressing text files

131
Q

Difference

A

describes which elements differ when two sets are joined together

132
Q

Digital camera

A

a device for creating digital images of photographs, which can be printed or transferred onto a computer to be manipulated and stored

133
Q

Digital certificate

A

a method of ensuring that an encrypted message is from a trusted source as they have a certificate from a Certification Authority

134
Q

Digital signature

A

a method of ensuring that an encrypted message is from a trusted source as they have a unique encrypted signature verified by a Certificate Authority

135
Q

Direct address

A

the operand is the datum

136
Q

Directed graph

A

a graph where the relationship between nodes is one-way

137
Q

Direction

A

one of the two components of a vector

138
Q

Distributed processing/computing

A

the principle of spreading large and complex tasks over a number of computers or servers

139
Q

Distributed Program

A

a program specifically written to be used in a distributed processing environment

140
Q

Domain

A

all the values that may be input to a mathematical function

141
Q

Domain name

A

the recognisable name of a domain on the Internet

142
Q

Domain name server (DNS)

A

a server that contains domain names and associated IP addresses

143
Q

Domain name server (DNS) system

A

a system of connected domain name servers that provides the IP address of every website on the Internet

144
Q

Dot product

A

multiplying two vectors together to produce another vector

145
Q

Dry run

A

the process of stepping through each line of code to see what will happen before the program is run

146
Q

Dynamic data structure

A

a method of storing data where the amount of data stored (and memory used to store it) will vary as the program is being run

147
Q

Dynamic Host Configuration Protocol (DHCP)

A

a set of rules for allocating locally unique IP addresses to devices as they connect to a network

148
Q

Edge (programming)

A

a connection between two nodes in a graph or tree structure - also known as an arc

149
Q

Edge

A

in a database graph schema, it refers to the link and relationship between two nodes

150
Q

Element

A

a single value within a set or list - also called a member

151
Q

Email server

A

a dedicated computer on a network for handling email

152
Q

Empty list

A

a list with no elements in it

153
Q

Empty set

A

the set that contains no values

154
Q

Encapsulation

A

the concept of putting properties, methods and data in one object

155
Q

Encryption

A

the process of turning plaintext into scrambled ciphertext, which can only be understood if it is decrypted

156
Q

Entity

A

an object about which data will be stored

157
Q

Entity identifier

A

an attribute which can uniquely identify each instance of an entity

158
Q

Entity relationship diagram

A

a visual method of describing relationships between entities

159
Q

Erroneous test data

A

test data that is clearly incorrect and should produce an error

160
Q

Ethical issues

A

factors that define the set of moral values by which society functions

161
Q

Evaluation

A

the final stage of system development where the system is judged according to certain criteria

162
Q

Event

A

something that happens when a program is being run

163
Q

Exception handling

A

the process of dealing with events that cause the current subroutine to stop

164
Q

Exponent

A

the ‘power of’ part of a number indicating how far a binary point should be shifted left or right

165
Q

Exponent time

A

in Big O notation where the time taken to run an algorithm increases as an exponential function of the number of inputs. For example, for each additional input the time taken might double

166
Q

Factorial

A

the product of all positive integers less than or equal to n

167
Q

Feasibility study

A

an analysis of whether it is possible or desirable to create a system

168
Q

Fetch-execute cycle

A

the continuous process carried out by the processor when running programs

169
Q

Field

A

an item of data

170
Q

FIFO

A

first in first out refers to a data structure such as a queue where the first item of data entered is the first item of data to leave

171
Q

File

A

a collection of related data

172
Q

File management

A

how an operating system stores and retrieves files

173
Q

Filter function

A

a method of creating a subset based on specified criteria

174
Q

Finite

A

countable

175
Q

Finite set

A

a set where the elements can be counted using natural numbers up to a particular number

176
Q

Finite state machine (FSM)

A

any device that stores its current status and whose status can change as the result of an input. Mainly used as a conceptual model for designing and describing systems

177
Q

Firewall

A

hardware or software for protecting against unauthorised access to a network

178
Q

First-class object

A

any object that can be used as an argument or result of a function call

179
Q

Fixed point

A

wheer the decimal/binary point can move within a number

A Level Computer Science Glossary (1 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions