# Computer science glossary 1 up to 389(priorities)

5.0 / 5 based on 1 rating

- Created by: George Heard
- Created on: 29-03-19 09:37

Vectored interrupt mechanism

A method of handling interrupts be pointing to the first memory address of the instructions needed

1 of 389

Two's complement

A method of working with signed binary values

2 of 389

Unsigned binary

Binary that represents positive numbers only

3 of 389

Vector graphics

A graphic consisting of components defined by geometric formulae and associated properties, such as line colour and style

4 of 389

Picture element (pixel)

The smallest identifiable component of a bitmap image, defined by just two properties: its position in the bitmap matrix and its colour

5 of 389

Kibi

A prefix representing the fact 2X10 (1024) written as the symbol Ki

6 of 389

Mebi

a prefix representing the fact 2X20 (1048576) written as the symbol Mi

7 of 389

Gibi

A prefix representing the fact 2X30 written as the symbol Gi

8 of 389

Lossless compression

Coding techniques that allow subsequent decoding to recreate exactly the original file

9 of 389

Lossy compression

Coding techniques that cause some information to be lost so that the exact original file cannot be recovered in subsequent decoding

10 of 389

Router

A device that acts as a node on the internet

11 of 389

Gateway

A device that connects networks of different underlying technologies

12 of 389

Server

A device that provides services via a network

13 of 389

IPv4 address

A 32-bit long, hierarchical address of a device on the internet

14 of 389

Domain name system (DNS)

A hierarchical distributed database installed on domain name servers that is responsible for mapping a domain name to an IP address

15 of 389

Random-access memory (RAM)

Volatile memory that can be read from or written to any number of times

16 of 389

Read-Only memory (ROM)

Non-volatile memory that cannot be written to but can be read from any number of times

17 of 389

Memory address

A specific location in memory where instructions or date are stored

18 of 389

Assignment

The process of giving a value to a variable or constant

19 of 389

Constant

An item of data whose value does not change

20 of 389

Variable

An item of data whose value could change while the program is being run

21 of 389

Debug

The process of finding and correcting errors in programs

22 of 389

Declaration

The process of defining variable and constants in terms of their name and data type

23 of 389

Data type

Determines what sort of data are being stored and how it will be handled by the program

24 of 389

Integer

Any whole positive or negative number including zero

25 of 389

pointer

A data item that identifies a particular element in a data structure - normally the front or rear

26 of 389

Array

A set of related data items stored under a single identifier. Can work on one or more dimensions

27 of 389

Element

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

28 of 389

Record

One line of a text file

29 of 389

Syntax

The rules of how words are used within a given language

30 of 389

Selection

The principles of choosing what action to take based on certain criteria

31 of 389

Nesting

Placing one set of instructions within another set of instructions

32 of 389

Iteration

The principles of repeating processes

33 of 389

Definite Iteration

A process that repeats a set number of times

34 of 389

Indefinite iteration

A process that repeats until a certain condition is met

35 of 389

Loop

A repeated process

36 of 389

Sequence

The principle of putting the correct instructions in the right order within a program

37 of 389

Arithmetic operation

Common expressions such as +,-,/,*

38 of 389

Rounding

Reducing the number of digits used to represent a number while maintaining a value that is approximately equivalent

39 of 389

Truncating

The process of cutting off a number after a certain number of characters or decimal places

40 of 389

Random number generation

A function that produces a completely random number

41 of 389

Pseudo-Random number generator

Common in programming languages, a function that produces a random number that is not 100% random

42 of 389

Relational operations

Expressions that compare two values such as equal to or greater than

43 of 389

Boolean operations

Expressions that result in a TRUE or FALSE value

44 of 389

AND + pic

Boolean operation that outputs true if both inputs are true

45 of 389

OR + pic

Boolean operations that outputs true if either of its inputs are true

46 of 389

NOT + pic

Boolean operations that inverts the result so true becomes false and false becomes true

47 of 389

XOR + pic

Boolean operation that is true if either input is true but not if both inputs are true

48 of 389

String handling functions

Actions that can be carried out on sequences of characters

49 of 389

Character code

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

50 of 389

Subroutine

A named block of code designed to carry out a specific task

51 of 389

Procedure

Another term for a subroutine

52 of 389

Subprogram

Another term for a subroutine

53 of 389

Routine

Another term for a subroutine

54 of 389

Local variable

A variable that is available only in specified subroutines and functions

55 of 389

Global variable

A variable that is a available anywhere in the program

56 of 389

Function

A subroutine that returns a value

57 of 389

Functional programming

A programming paradigm that uses functions to create programs

58 of 389

Parameter

Data being passed into a subroutine

59 of 389

Argument

An item of data being passed to a subroutine

60 of 389

Block interface

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

61 of 389

Exception handling

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

62 of 389

Procedural programming languages

Languages where the programmer specifies the steps that must be carried out in order to achieve a result

63 of 389

Imperative programming languages

Languages based on giving the computer commands or procedures to follow

64 of 389

Hierarchy chart

A diagram that shows the design of a system from the top down

65 of 389

Structure chart

Similar to a hierarchy chart with the addition of showing how data are passed around the system

66 of 389

Top-Down approach

When designing systems it means that you start at the top of the process and work your way down into smaller and smaller sub-processes

67 of 389

flowchart

a digram using standard symbols that describes a process or system

68 of 389

System flowchart

A diagram using standard symbols that desribes a process or system

69 of 389

Pseudo-code

A method of writing code that does not require knowledge of a particular programming language

70 of 389

Naming conventions

The process of giving meaningful names to subroutines, functions, variables and other user-defined features in a program

71 of 389

Dry run

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

72 of 389

Trace table

A method of recording the result of each step that takes place when dry running code

73 of 389

Modular design

A method of system design that breaks a whole system down into smaller units, or modules

74 of 389

Exncapsulation

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

75 of 389

method

The code or routings contained within a class

76 of 389

Properties

The defining features of an object or class in terms of its data

77 of 389

Class

defines the properties and methods of a group of similar objects

78 of 389

Object

A specific instance of a class

79 of 389

Inheritance

The concept that properties and methods in one class can be shared with a subclass

80 of 389

class diagrams

A way of representing the relationship between classes

81 of 389

Instantiation

The process of creating an object from a class

82 of 389

Polymorphism

The ability of different types of data to be manipulated with the same method

83 of 389

Overriding

Where a method described in the subclass takes precedence over a method with the same name in the base class

84 of 389

Composition aggregation

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

85 of 389

Association aggregation

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

86 of 389

data structure

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

87 of 389

Abstract data type

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

88 of 389

File

A collection of related data

89 of 389

Array

A set of related data items stored under a string identifier. Can work on one or more dimensions

90 of 389

Text file

A file that contains human- readable characters

91 of 389

Binary file

Stores data as sequences of 0s and 1s

92 of 389

Record

One line of a text file

93 of 389

Field

An item of data

94 of 389

Queue

A data structure where the first item added is the first removed

95 of 389

Stack

A data structure where the last item added is the first item removed

96 of 389

Static data structure

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

97 of 389

dynamic data structure

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

98 of 389

Heap

A pool of unused memory that can be allocated to a dynamic data structure

99 of 389

Stack frame

A collection of data about a subroutine cell

100 of 389

Call stack

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

101 of 389

Interrupt

A signal sent to a device or program to the processor requesting its attention

102 of 389

Nesting

The process of putting one statement inside another statement

103 of 389

Recursion

The process of a subroutinge calling itself

104 of 389

Queue

A FIFO structure where data leaves in the order it arrives

105 of 389

FIFO

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

106 of 389

Linear queue

A FIFO strucutre implemented as a ring where the front and read pointers can wrap aroudn from the end to the start of the array

107 of 389

Priority queue

A variation of a FIFO structure where some data may leave out of sequence where it has a higher priority than other data items

108 of 389

Circular queue

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

109 of 389

Graph theory

The underlying mathematical principles behind the use of graphs

110 of 389

Arc

A join or relationship between two nodes - also known as an edge

111 of 389

Vertex/vertices

An object in a graph - also known as a node

112 of 389

Weighted graph

A graph that has a data value labelled on each edge

113 of 389

Undirected graph

A graph where the relationship between vertices is two-way

114 of 389

Directed graph

A graph where the relationship between vertices is one-way

115 of 389

Latency

The time delay that occurs when transmitting data between devices

116 of 389

Adjacency list

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

117 of 389

Tree

A data structure similar to a graph, with no loops

118 of 389

Node

An object in a graph-also known as a vertex

119 of 389

Edge

A join of relationship between nodes also known as an arc

120 of 389

Root

The starting node in a rooted tree structure from which all other nodes branch off

121 of 389

Parent

A type of node in a tree, where there are further nodes below it

122 of 389

Child

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

123 of 389

Leaf

A node that does not have any other nodes beneath it

124 of 389

Binary tree

A tree where each node can only have up to two child nodes attatched to it

125 of 389

Hash table

A data structure that stores key/value pairs based on an index calculated from an algorithim

126 of 389

Key/value pair

The key and its associated data

127 of 389

Hashing algorithim

Code that created a unique index from given items of key data

128 of 389

Cache

A high- speed temporary area of memory

129 of 389

Collision

When a hasing algorithim produces the same index for two or more different keys

130 of 389

Clustering

When a hashing algorithim produces indices that are not randomly distributed

131 of 389

Load factor

The ratio of how many indices are available to how many there are in total

132 of 389

index

The location where values will be stored, calculated from the key

133 of 389

Chaining

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

134 of 389

Rehashing

The process of running the hashing algorithm again when a collision occurs

135 of 389

Dictionary (data structure)

A data structure that maps key data

136 of 389

Associative array

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

137 of 389

Magnitude

One of the two components of a vectore - refers to its size

138 of 389

Direction

One of the two components of a vector

139 of 389

Components

Teh values within a vector

140 of 389

Scalar

A real value used to multiplu a vector to scale the vectore

141 of 389

Dot product

Multiplying two vectors toether to produce a number

142 of 389

Convex combination

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

143 of 389

Vector space

A collection of elements that can be formed by adding or multiplying vectors together

144 of 389

Convex hull

A spatial representation of the vector space between two vectors

145 of 389

Implementation

Creating code to produce a programmed solution

146 of 389

Array

A set of data items of the same type grouped together with the same identifier

147 of 389

Edge

A connection between two nodes in a graph or tree structure

148 of 389

Graph

A data type made up of nodes and edges

149 of 389

Breadth first

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

150 of 389

Depth first

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

151 of 389

Queue

A data structure where the first item added is the first item removed

152 of 389

Node

Elements of a graph or tree

153 of 389

Binary tree

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

154 of 389

Pre-order

A method of traversing a tree by visiting the root, traversing the left subtree and traversing the right subtree

155 of 389

In-order

A method of traversing a tree by traversing the left subtree, visiting the root and traversing the right subtree

156 of 389

Post-order

A method of traversing a tree by traversing the left subtree, traversing the right subtree and then visiting the root

157 of 389

Traversal

The process of reading data from a tree or graph by visiting all of the nodes

158 of 389

Binary search

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

159 of 389

Recursion

A technique where a function can call itself in order to complete a task

160 of 389

Single source

In Dijkstra's algorithm it means that the shortest path is calculated

161 of 389

Shortest path

The shortest distance between two vertices based on the weighting of the edges

162 of 389

Linear search

A simple search technique that looks through data one item at a time until the search term is found

163 of 389

Binary search

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

164 of 389

Binary tree search

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

165 of 389

Reverse polish Notation (RPN)

Another term for postfix notation (a mathematical notation in which operators follow their operands)

166 of 389

Infix

Expressions that are written with the operators within the operands e.g. 2+3

167 of 389

Operator

The mathematical process within an expression

168 of 389

SODMAS

A methodology for evaluation mathematical expressions in a particular sequence

169 of 389

Polish notation

Another way of describing prefix notation(where operators precede their operands

170 of 389

Interpreter

Software that translates and executes programs line by line by converting programming statements either into machine code or by calling instructions to carry out the high-level language statements

171 of 389

Operand

A value within an expression

172 of 389

Prefix

Expressions that are written with the operators before the operands e.g. + 2 3

173 of 389

Postfix

Expressions that are written with the operators after the operands e.g. 2 3 +

174 of 389

In-order traversal

A method of extracting data from a binary tree that will result in an infix expression

175 of 389

Post-order traversal

A method of extracting data from a binary tree that will result in postifx expressions

176 of 389

Pre-order traversal

A method of extracting data from a binary tree that will result in prefix expressions

177 of 389

Vector graphics

An image made up of objects and coordinates

178 of 389

Bubble sort

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

179 of 389

Iteration

repeating the same process several times in order to achieve a result

180 of 389

Merge sort

A technique for putting data in order by splitting lists into single elements and then merging them back together again

181 of 389

Logical reasoning

The process of using a given set of facts to determine whether new facts are true or false

182 of 389

Algorithm

A sequence of instructions

183 of 389

Representational abstractions

The process of removing unnecessary details so that only information that is required to solve the problem that remains

184 of 389

Abstraction by generalisation categorisation

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

185 of 389

Top-down design

related to the modular approach, this starts with the main system at the top and breaks it down into smaller and smaller units a bit like a family tree

186 of 389

Functional abstraction

Breaking down a complex problem into a series of reusable functions

187 of 389

Data abstractions

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

188 of 389

Problem abstraction

removing unnecessary details in a program until the underlying problem is identified to see if this is the same as a problem that has been already solved

189 of 389

Information hiding

The process of hiding all details of an object that do not contribute to its essentials characteristics

190 of 389

Decomposition

Breaking down a large task into a series of subtasks

191 of 389

Composition aggregations

Building up a while system from smaller units. The opposite of decomposition

192 of 389

Finite

Countable

193 of 389

Finite state machine (FSM)

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

194 of 389

State transition diagram

A visual representation of an FSM using circles and arrows

195 of 389

Accepting state

The state that identifies whether an input has been accepted

196 of 389

State Transition table

A tabular representation of an FSM showing inputs, current state and the next state

197 of 389

Mealy machine

A type of finite state machine with outputsq

198 of 389

Cipher

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

199 of 389

Shift Cipher

A simple substation cipher where the letters are coded by moving a certain amount forward or backwards in the alphabetq

200 of 389

Turing machine

A theoretical model of computation

201 of 389

Read/write head

The theoretical device that writes or reads from the current call of a tape in a turing machine

202 of 389

Halting state

Stops the turing machine

203 of 389

Start state

The initial state of a turing machine

204 of 389

Transition function / rule

A method of notating how a turing machine moves from one state to another and how the data on the tape changes

205 of 389

State transition diagram

A visual representation of the transition function of a turing machine

206 of 389

Instruction table

A method of describing a turing machine in tabular form

207 of 389

Universal machine

A machine that can simulate a turing machine by reading a description of the machine along with the input of its own tape

208 of 389

Regular language

Any language that can be described using regular expressions

209 of 389

Regular expression

Notation that contains strings of characters that can be matched to the contents of a set

210 of 389

Context - feee language

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

211 of 389

Backus-Naur Form (BNF)

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

212 of 389

Set

A collection of symbols in any order that do not repeat

213 of 389

Terminal

In BNF, it is the final element that requires no further rules

214 of 389

Syntax diagram

A method of visualising rules written in BNF or any other context - free language

215 of 389

Natural number

A positive whole number including zero

216 of 389

Set building

The process of creating sets by describing them using notation rather than listing the elements

217 of 389

Member

Describes a value or element that belongs to a set

218 of 389

Empty set

The set that contains no values

219 of 389

Finite set

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

220 of 389

Infinite set

A set that is not finite

221 of 389

Cardinality

The umber of elements in a set

222 of 389

Countable set

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

223 of 389

Countably infinite sets

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

224 of 389

Cartesian product

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

225 of 389

Union

Where two sets are joined and all of the elements of both sets are included in the joined set

226 of 389

Intersection

Describes which elements are common to both sets when two sets are joined

227 of 389

Difference

Describes which elements differ when two sets are joined together

228 of 389

Subset

A set where the elements of one are entirely contained within the other; can include two sets that are exactly the same

229 of 389

Proper subset

Where one set is wholly contained within another and the other set has addition elements

230 of 389

Function

relates each element of a set with the element of another set

231 of 389

Domain

All the values that may be input to a mathematical function

232 of 389

Codomain

All the values that may be input to a mathematical function

233 of 389

Factorial

The product of all positive integers less than or equal to n e.g. 3! is 3*2*1

234 of 389

Space complexity

The concept of how much space an algorithm requires

235 of 389

input size

In big o notation the size of whatever you asking to work with e.g. data, parameters

236 of 389

Time complexity

The concept of how much time an algorithm requires

237 of 389

constant time

In big 0 notation where the time taken to run an algorithm does not vary the input size

238 of 389

Linear time

In big 0 notation where the time taken to run and algorithm increases in direct proportion with the input size

239 of 389

Exponential time

In big 0 notation where the time taken to run an algorithm increases as an exponential function of the number of inputs. E.g. for each additional input the time taken might double

240 of 389

Logarithmic time

In big 0 notation where the time taken to run and algorithm increased or decreased in line with a logarithm

241 of 389

Polynomial time

In big 0 notation where the time taken to run the algorithm is a polynomial function of the input size

242 of 389

Tractable problem

A problem that can be solved in an acceptable amount of time

243 of 389

Intractable problem

A problem that cannot be solved within an acceptable time frame

244 of 389

Heuristic

With algorithms it is a method for producing a 'rule of thumb' to produce an acceptable solution to intractable problems

245 of 389

Unsolvable problem

A problem that it has been proved cannot be solved on a computer

246 of 389

Halting problem

An example of an unsolvable problem where it is impossible to write aprogram that can work out whether another problem will halt given a particular input

247 of 389

Natural number

A positive whole number including zero

248 of 389

rational number

Any number that can be expressed as a fraction or ratio of integers

249 of 389

Irrational number

A number that cannot be represented as a fraction or ratio as the deciaml form will contain infinite repeating values

250 of 389

Real number

Any positive or negative number with or without a fractional part

251 of 389

Ordinal number

A number used to identify position relative to other numbers

252 of 389

Cardinal numbers

A number that identifies the size of something

253 of 389

Well-ordered set

A group of related numbers with a defined order

254 of 389

Array

A data structure where data items are grouped together under a single identifier and are then accessed based on their position

255 of 389

Number base

The number of digits available within a particular number system e.g. base 10 for a decimal base 2 for binary

256 of 389

Bit

A single binary digit from a binary number- either a zero or a one

257 of 389

Unit

The grouping together of bits or bytes to form larger . blocks of measurement e.g. MB, GB

258 of 389

Unsigned binary

Binary that represents positive number only

259 of 389

Fixed point

Where the decimal/binary point is fixed within a number

260 of 389

Floating point

Where the decimal/binary point can move within a number

261 of 389

signed binary

Binary with a positive or negative sign

262 of 389

overflow

When a number is too large to be represented with the number of bits allocated

263 of 389

Underflow

When a number is too small to be represented with the number of bits allocated

264 of 389

Normalisation

A process for adjusting numbers onto a common scale

265 of 389

Precision

How accurate a number is

266 of 389

Mantissa

The significant digits that make up a number

267 of 389

Exponential time

The "power of" part of a number indicating how far a binary point should be shifted left or right

268 of 389

Character code

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

269 of 389

ASCII

A standard binary coding system for characters and numbers

270 of 389

Unicode

A standard binary coding system that has superseded ASC!!

271 of 389

Parity bit

A method of checking binary codes by counting the number of 0s and 1s in the code

272 of 389

Majority voting

A method of checking for errors by producing the same data several times and checking it is the same each time

273 of 389

Check digit

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

274 of 389

Bit-mapped graphic

An image made up of individual pixels

275 of 389

Pixel

An individual picture element

276 of 389

Resolution

Width x height or pixels per inch

277 of 389

Colour depth

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

278 of 389

Vector graphic

An image made up of objects and coordinates

279 of 389

Compresssion

The process of reducing the number of bits required to represent data

280 of 389

Run-length coding

A method of compressing by eliminating repeated data

281 of 389

Dictionary-based encoding

a method of compressing text files

282 of 389

Encryption

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

283 of 389

Decryption

The process of deciphering encrypted data or mesages

284 of 389

Plaintext

Data in human-readable form

285 of 389

Cipher text

encrypted data

286 of 389

Caesar cipher

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

287 of 389

Vernam cipher

A method of encryption that uses a one-time pad(key) to create cipher text that is mathematically impossible to decrypt without the key

288 of 389

Transposition cipher

A method of encryption where the characters are rearranged to form an anagram

289 of 389

Key

In cryptography it is the data that is used to encrypt and decrypt the data

290 of 389

Substitution cipher

A method of encryption where one character is substituted for another to create cipher text

291 of 389

Polyalphabetic

Using more than one alphabet

292 of 389

Frequency analysis

In cryptography it is the study of how often different letters or phrases are used

293 of 389

Railfence cipher

A type of transposition cipher that encodes the message by splitting it over rows

294 of 389

Route cipher

A type of transposition cipher that encodes the message by placing it into a grid

295 of 389

One-time pad

A key that is only used once to encrypt and decrypt a message and is then discarded

296 of 389

Baudot code

A five-digit character code that predates ASCII and unicode

297 of 389

Computational security

A concept of how secure data encryption is

298 of 389

Computational hardness

The degree of difficulty in cracking a cipher

299 of 389

Hardware

A generic term for the physical parts of the computer ,both internal and external

300 of 389

Software

A generic term for any program that can be run on a program

301 of 389

Application software

Programs that perform specific tasks that would need doing even if computers didn't exist e.g. editing text, carrying our calculations

302 of 389

Utility programs

Programs that perform specific common task related to running the computer e.g. zipping files

303 of 389

Library programs

Code, data and resources that can be called by other programs

304 of 389

Translators

Software that converts programming language instructions into 0s and 1s (machine code) There are three types - compilers, assemblers

305 of 389

Compiler

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

306 of 389

Assembler

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

307 of 389

Interpreter

A program for translating a high-level language by reading each statement in the source code and immediately performing the action

308 of 389

Operating system software

A suite of programs designed to control the operations of the computer

309 of 389

Virtual machine

The concept that all of the complexities of using a computer are hidden from the user and other software by the operating system

310 of 389

Resource management

How an operating system manages hardware and software to optimise the performance of the computer

311 of 389

Processor

A device that carries out computation on data by following instructions, in order to produce an output

312 of 389

Scheduling

A technique to ensure that different users or different programs are able to work on the same computer system at the same time

313 of 389

Memory management

How the operating system uses RAM to optimise the performance of the omputer

314 of 389

File management

How an operating system stores and retrieves files

315 of 389

Machine code

The lowest level of code mad up of 0s and 1s

316 of 389

Assembly language

A way of programming that involves writing mnemonics

317 of 389

Mnemonics

Short codes that are used as instructions when programming e.g. LDR , ADD

318 of 389

Source code

Programming code that has not been compiled into an executable file

319 of 389

Assembler

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

320 of 389

Object code

Compiled code that can be run as an executable on any computer

321 of 389

Low-level language

Machine code and assembly language

322 of 389

High-level language

A programming language that allows programs to be written using english key words and that is platform independant

323 of 389

Imperative language

A language based on giving the computer command or procedures to follow

324 of 389

Object-oriented language

A programming paradigm that encapsulates instructions and data together into objects

325 of 389

Declarative languages

Languages that declare of specify what properties a result should have e.g. results will be based on functions

326 of 389

Functional language

A programming paradigm that uses mathematical functions

327 of 389

Translator

The general name for any program that translates code from one language to another e.e.g translating source code into machine code

328 of 389

Interpreter

A program for translating a high-level language by reading each statement in the source code and immediately performing the action

329 of 389

Compiler

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

330 of 389

Bytecode

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

331 of 389

Truth table

A method of representing/ calculating the result of every possible combination or inputs in a boolean expression

332 of 389

AND gate

result is true if both inputs are true

333 of 389

OR

Boolean operation that outputs true if either of its inputs are true

334 of 389

NOT

Boolean operation that inverts the result so true becomes false and false becomes true

335 of 389

NAND

Boolean operation that outputs true if any of the inputs are false

336 of 389

NAND gate

Result is true if any of the inputs are false

337 of 389

NOR

Boolean operation that outputs true if all of its inputs are false

338 of 389

NOR gate

Result is true if both inputs are false

339 of 389

XOR

Boolean operation that is true if either input is true but not if both inputs are true

340 of 389

De Morgan's law

A process for simplifying boolean expressions

341 of 389

Logic gate

An electronic component used to perform boolean algorithms

342 of 389

Boolean expressions

An equation made up of boolean operations

343 of 389

AND gate

Result is true if both inputs are true

344 of 389

OR gate

Result is true if either input is true

345 of 389

Not gate

Inverts the result so true becomes false and false becomes true

346 of 389

NAND gate

Result is true if any of the inputs are false

347 of 389

XOR gate

Result is true if either input is true but not if both inputs are true

348 of 389

NOR gate

Result is true if both inputs are false

349 of 389

Logic circuit

A combination of logic gates

350 of 389

Arithmetic logic unit (ALU)

Part of the processor that processes and manipulates data

351 of 389

Half adder

A circuit that performs addition using inputs from A and B only

352 of 389

Full adder

A circuit that performs addition using inputs from A and B plus a carry bit

353 of 389

Carry bit

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

354 of 389

Flip-Flop

A memory unit that can store one bit

355 of 389

Edge-triggered D-type Flip-flop

A memory unit that changes state with each pulse of the clock

356 of 389

Clock

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

357 of 389

Processor

A device that carries out computation on data by following instructions, in order to produce an output

358 of 389

Main memory

stores data and instructions that will be used by the processor

359 of 389

Fetch-execute cycle

The continuous process carried out by the processor when running programs

360 of 389

Chip

An electronic component contained within a thin slice of silicon

361 of 389

Bus

Microscopic parallel wires that transmit data between internal components

362 of 389

Data bus

Transfers data between the processor and memory

363 of 389

Input/Output (I/O) controller

Controls the flow of information between the process and the input and output devices

364 of 389

word length

The number of bits that can be addressed, transferred or manipulated as one unit

365 of 389

Address bus

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

366 of 389

Addressable memory

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

367 of 389

Control bus

Controls the flow of data between the processor and other parts of the computer

368 of 389

Von neumann architecture

A technique for building a processor where data and instructions are stored in the same memory and accessed via buses

369 of 389

Harvard architecture

A technique for building a processor that uses separate buses and memory for data and instructions

370 of 389

Stored program concept

The idea that instructions and data stored together in memory

371 of 389

Fetch-execute cycle

The continuous process carried out by the processor when running programs

372 of 389

Control unit

Part of the processor that manages the execution of instructions

373 of 389

Arithmetic logic unit (ALU)

part of the processor that processes and manipulates data

374 of 389

Clock

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

375 of 389

Register

A small section of temporary storage that is part of the processor. Stores data or control instruction during the fetch-decode-execute cycle

376 of 389

Status register

Keeps track of the various functions of the computer such as if the result of the last calculation was positive or negative

377 of 389

Interrupt register

Stores details of incoming interrupts

378 of 389

Current instruction register(SIR)

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

379 of 389

Program counter(PC)

Register that stores the address of the next instruction

380 of 389

Stored program concept

The idea that instructions and data are stored together in menory

381 of 389

Status register

keeps track of the various functions of the computer such as if the result of the last calculation was positive or negative

382 of 389

Memory Buffer register (MBR)

register that holds data that is either written to or copied from the CPU

383 of 389

Memory data register (MDR)

another name for the MBR

384 of 389

Bus width

The number of bits that can e sent down a bus in one go

385 of 389

Word length

The number of bits that can be addressed, transferred or manipulated as one unit

386 of 389

Multi-core

A chip with more than one processor

387 of 389

interrupt service routine

Calls the routine required to handle an interrupt

388 of 389

Priorities

A method for assigning importance to interrupts in order to process them in the right order

389 of 389

## Other cards in this set

### Card 2

#### Front

Two's complement

#### Back

A method of working with signed binary values

### Card 3

#### Front

Unsigned binary

#### Back

### Card 4

#### Front

Vector graphics

#### Back

### Card 5

#### Front

Picture element (pixel)

#### Back

## Related discussions on The Student Room

- GCSE AQA Computer science and Business Studies Notes »
- OCR A Level Computer Science Resources »
- Help! Where to put definitions? »
- EPQ word count »
- Edexcel igcse ict »
- Oxford dates of terms »
- Y12 Revision »
- English language A level »
- GCSE Business Study Group 2022-2023 »
- English Language paper 2 help »

## Similar Computing resources:

0.0 / 5

0.0 / 5

0.0 / 5

0.0 / 5

0.0 / 5

0.0 / 5

4.5 / 5 based on 2 ratings

0.0 / 5

0.0 / 5

## Comments

No comments have yet been made