Brainscape's Knowledge GenomeTM

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


See full index

A Level Computer Science > Key Terminology > Flashcards

Key Terminology Flashcards

1
Q

ALU

A

Arithmetic logic unit: This is used in comparing binary values and for any mathematical
calculations that must be done are done here.

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

Control Unit

A

This is used in order to send signals to interrupt the fetch decode cycle.

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

Register

A

A register is an area in memory within the processor. These are extremely fast in order to
prevent slowing down the system.

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

PC

A

The program counter is incremented at the end of each fetch decode execute cycle and then at
the beginning is copied to the Memory address register.

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

ACC

A

The accumulator stores result of calculations made by the ALU.

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

MAR

A

Memory address register stores the address of the data or instructions that are to be fetched
from or sent to.

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

MDR

A

Memory data register stores the data that has been fetched from or stored to memory.

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

CIR

A

Current instruction register stores the most recently fetched instruction waiting for it to be
decoded then executed.

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

Busses

A

These are communication channels through which data can be sent through the computer
system.

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

Data Bus

A

This carries data between memory and the processor.

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

Address Bus

A

The address bus carries the address of the memory location being fetched.

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

Control Bus

A

Sends signals that originate from the control unit.

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

Fetch-Decode-Execute

A

The PC is copied to the MAR

The fetch signal is sent across the address bus

The contents of the memory location sorted in the MAR are sent across the data bus and stored in the CIR

Fetch complete.

The contents of the CIR are sent to the control unit

The control unit then decodes the instructions

Decode complete.

The registers can be changed in different ways during the executions phase depending on the instructions

If a memory location is to be read from or written to (this is, LDA or STA) then the address stored within the instruction will be
loaded into the MAR. In the case of the STA the data is stored in the ACC and sent to and sent into memory, in the case of STA
the data is stored in the ACC and sent to memory.

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

CPU

A

Central processing unit this is used in all processing and mathematics done by the computers
system.

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

Clock Speed

A

Clock speed is a factor linked in the speed of a computer system the higher the clock speed the
higher number of fetch decode execute cycle that can occur every second.

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

Cache

A

A cache is a small piece of RAM attached to the CPU that stores commonly used instructions or
recently used instructions so that they don’t have to be continually fetched.

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

Pipelining

A

Pipelining is the process of speeding up processing. As the instruction is being decoded the one
after that can be fetched. This can only occur if the next instruction can be predicted therefore
sometimes the wrong instruction is fetched and must be discarded and the correct one
fetched.

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

Von Neumann Architecture

A

Stores data and instructions in the same memory unit and in the same format

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

Harvard Architecture

A

Stores data and instructions in 2 seperate memory units.

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

Contemporary Architecture

A

This is a architecture that is commonly used in modern computers.

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

CISC

A

Complex Instruction Set Computing

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

RISC

A

Reduced instruction set computing

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

GPU

A

Graphical processing unit this is extremely good at processing repetitive instructions.

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

Multicore System

A

A multi core system uses a CPU with many cores to improve overall efficiency of the system.

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

Parallel Processor System

A

A parallel processor system means that a fetch decode execute cycle is done at the same time
as each other.

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

Input Device

A

An input device is a device that can input data into a computer system. One example would be
a microphone.

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

Output Device

A

An output device is a device that can output data from a computer system such as speakers.

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

Storage Device

A

A storage device is something that can either temporarily or permanently store data.

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

Magnetic Storage

A

Uses pattered magnetic material to represent binary values.

Hard disk and magnetic tape.

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

Flash Storage

A

Flash storage is a type of storage that uses silicon chips and electricity in order to store data.

Uses a type of ROM that can be re-written.

USB sticks.

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

Optical Storage

A

CD’s and DVD’s.

Works by shooting a lazer along the surface to determine where there are peaks and troughs
which represent 1 and 0.

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

RAM

A

Random access memory a type of volatile storage.

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

ROM

A

Read Only Memory this is memory that cant be altered so holds crucial data such as POST.

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

Operating System

A

The operating system is used in running and maintaining a computer system.

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

Memory management

A

Memory is used in efficient ways

Data in memory cant be accessed without correct permission.

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

Paging

A

Where programs are divided physically into equal sized blocks.

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

Segmentation

A

Where programs are divided logically split into blocks containing modules or routines.

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

Virtual Memory

A

Virtual memory is when RAM becomes full and a segment of storage is used as a temporary
type of RAM in order to prevent a bottleneck.

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

Interrupt

A

In most computer systems interrupts are done on a 4 level priority 1 being the most serious.
These are used by the control unit in order to prevent failure in the computer system at higher
levels at lower levels it allows for inputs such as typing.

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

ISR

A

Interrupt service routine: this is the process that interrupts are processed by priority.

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

Scheduling

A

This is a process controlled by the operating system. It must ensure that each job get sufficient
processing time as well as the user. There are many different methods used.

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

RR

A

Round robin is a type of scheduling that means each process is given a specified times to run
and if uncompleted are put back into the queue.

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

FCFS

A

First come first serve this means that the first job that comes into the queue will be processed
and then the next and so on.

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

MLFQ

A

Multi level feedback queue: This has many queues each with different priority levels in order
to determine which needs processing first.

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

SJF

A

Shortest job first meaning that the shortest job is run and then the next shortest on so on.

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

SRT

A

Shortest remaining time this means that the job with the shortest remaining time is processed
first.

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

Distributed OS

A

Distributed operating system allows for many machines to work on a single job at one time.

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

Embedded OS

A

This is commonly used in devices such as kettles and washing machines and is high specialised
for single used jobs.

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

Multi-tasking OS

A

Multi tasking operating systems allow for many jobs to run simultaneously without the system
being slowed down to a large extent.

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

Multi-user OS

A

Multi- user operating systems allow for multiple users to use the system and allow for
separate file storage between users but software is often shared.

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

Real Time OS

A

This is used to process data at extremely high speeds commonly used in things such as planes.

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

BIOS

A

Basic Input Output System

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

Device Drivers

A

This is a piece of software that is usually supplied with a device that when installed allows for
the computer system to communicate and take action with it.

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

Virtual Machine

A

A program that has the same functionality as a physical computer.

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

Utilities

A

Small Programs that are usually concerned with the maintenance.

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

Open Source

A

Open source is free software that’s source code is made available so that users can make
changes to the code. This often means overall lower quality code and can be used maliciously.

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

Closed Source

A

Closed source is precompiled programs that only the executable file is given to the user. These
can have high costs but tend to be overall higher quality.

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

Source Code

A

This is the original code that the program is written in before any compilation has occurred.
This made available for open source software.

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

Translator

A

These follow instructions that allow for the source code to transfer it into machine code.

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

Interpreter

A

A translator program that reads and executes a program line by line. This can be an incredibly
slow process when combined with error checking.

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

Compiler

A

A translator program that converts high level language source code into an executable
machine code file.

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

Assembler

A

Assemblers convert higher level source code into assembly code which consist of opcode
which is represented by mnemonics and the operand represented by denary or Hex.

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

Lexical Analysis

A

White space and comments are removed from the program.

The code is turned into a series of tokens.

A symbol table is created to track variables and their scope and subrotines.

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

Syntax Analysis

A

An abstract syntax tree is built from tokens produced.

If any errors are present by errors against the syntax of the language error messages created.

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

Code Generation

A

During the code generation the abstract code tree is converted to object code. Object code is
machine code before the final step.

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

Optimisation

A

Tweaks to the code is made so it will run more efficiently and will unnecessary functions or
repeating code.

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

Linker

A

A linker is used to combine complied code with that from a library into a single executable file.

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

Loaders

A

A loader is a part of the operating system and is responsible for loading the program into
memory.

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

Libraries

A

A pre-written collection of code that allows programmers to import their functionality into
their own programs. Pre-complied

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

SDLC

A

Software development life cycle

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

Waterfall Model

A

A sequence of stages each stage only begins when the prior one has been completed. Some
regression can occur if required.

Requires a clear set of goals

Not suited for high risk projects.

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

Agile Methodologies

A

A group of methodologies designed to cope with volatility by producing in an iterative
manner.

Iterations made until one is deemed suitable as a final project.

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

Extreme Programming

A

A representative of the customer becomes a member of the development team.

Uses an iterative nature the same as RAD

Each iteration produces a version the system with code of a good enough quality to be used
as the final product.

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

Spiral Model

A

Step one: Determine objectives- This is to determine objectives of the rotation of the spiral according to the biggest
potential risk.

Step two: Identify and resolve risks- In the next stage the possible risk are identified and alternative options considered. If
risks are considered too high at this stage the project may be stopped.

Step three: development and testing- The third stage allows the part of the project being worked on to be made and
tested

Step four: plan next iteration- The fourth stage determines what will happen in the next iteration of the spiral.

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

RAD

A

The user is shown the prototype and gives feedback that is used to inform how the
prototype is further developed.

This continues until the end user is happy that the prototype has required all the
functionality. At this point it becomes the end product.

Well suited to projects that don’t have well defined requirements.

Due to high user involvement is likely to be very high quality

Don’t suit large projects.

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

Assembly Language

A

An assembly language is a low level languge that uses mnemonics. It uses simple commands.

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

Machine Code

A

Binary Code

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

Low Level Language

A

A low level language is a language that is written in binary values. But is uncommonly used
because it is extremely hard to use.

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

High Level Language

A

A high level language is similar to English and must be converted in order to be read to by a
computer. Uses a system of English key words.

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

LMC

A

Little man computing an example of a mock assembly language.

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

Immediate Addressing

A

This is the process that data is directly linked to an instruction

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

Direct Addressing

A

Direct addressing means that code refers directly to a location in memory.

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

Indirect Addressing

A

This is the process of data being held into a second location and originally this indermiate
location is accessed and then this is linked to the data.

84
Q

Indexed Addressing

A

This is the process that the final address for the data is determined by an offset to the base
address.

85
Q

OO

A

Object Orientated

86
Q

OOP

A

Object Oriented Programming

87
Q

Class

A

This is used in the object ordinated programming and houses methods and functions.

88
Q

Object

A

An object is an item that is assigned a value.

89
Q

Superclass

A

A super class is the class that contains the original methods that are inherited.

90
Q

Subclass

A 
The subclass inherits from the super class takes methods and the local fields from the original
class.
91
Q

Instantiation

A

The process of creating an object

92
Q

Overriding

A

This is the process when a class inherits values and override their values from the prior class

93
Q

Inheritance

A

This is the process of a class inheriting methods and attributes from another super class.

94
Q

Encapsulation

A

This is the process preventing fields from being accessed outside of there scope.

95
Q

Polymorphism

A

Polymorphism is the process of variables being accessed in many functions without their
values being changed between functions.

96
Q

Lossy Compression

A

Lossy compression is the process of the original image being altered repeating data is stored in
an alternative format in order to dramatically reduce image size.

97
Q

Lossless Compression

A

Lossless compression is the process of reducing a file size by removing repeated data.

98
Q

Symmetric Encryption

A

Symetric encoding uses on private key which the two users share in order to encrypt and
decode.

99
Q

Asymmetric Encrytion

A

Asymmetric encryption uses two keys one public one private meaning and the public is used in
the encryption and the private in the decryption process.

100
Q

Hashing

A

This is the process where text is given a numeric value and then a calculation is done on it. This
is a irreversible process.

101
Q

Relational Database

A

A relational database is a database that consist of many tables linked together using keys

102
Q

Flat File

A

A flat file database is a single table database.

103
Q

Primary Key

A

The primary key is a unique identifier.

104
Q

Foreign Key

A

A foreign key is a key used in linking two tables and is another instance of the primary key in
the other table.

105
Q

Concatenated Primary Key

A

This is also know as a compound key and combines two or more fields into a key.

106
Q

Secondary Key

A

This is placed into tables in order to improve indexing

107
Q

ERM

A

Entity relationship model this shows the relationships in a database

108
Q

Normalisation

A

This is the process of refining databases to make them more efficient

109
Q

Indexing

A

This is the process of amalgamating data from multiple sources and adding into a database to
be searched.

110
Q

0NF

A

This is un-ordered data.

111
Q

1NF

A

Eliminate duplicate columns

•

Create separate tables for each group of related data

•

Identify primary keys

•

Remove duplicate values in any single field

112
Q

2NF

A

Check first is obtained

•

Remove data sets that occur in multiple rows and transfer to new tables

•

Create relationships between tables

113
Q

3NF

A

Has second normal form been obtained

•

Remove any columns not dependant on the key.

114
Q

SQL

A

Structured query language

115
Q

Referential Integrity

A

Referential integrity is used to ensure that everything is entirely dependant on the key and nothing but the key.

116
Q

ACID

A

Atomicity:

A change to a database is either completely done or not done at all. ‘Half’ changes must never occur. If you ran a code in SQL where one thing
was incorrect but every other code was correct, no code will be run.

Consistency:

Any change must retain the overall state of the database.

Isolation (record locks):

A transaction must not be able to be interrupted by other transactions. Transactions must occur in isolations so that corruption doesn’t occur.
The records concerned by transactions are record locked.

Durability:

Once a change has been made it must not be lost during a system failure. This is why databases remain when you log off and log back. Done by
saving to secondary storage.

117
Q

Record Locking

A

This is the process occurs during isolation of ACID and means that records that are altered
aren’t corrupted.

118
Q

Redundancy

A

This is where extra or repeating data exists.

119
Q

Protocol

A

This is a rule

120
Q

TCP/IP Stack

A

This is a protocol applied to the internet determining transmission.

121
Q

DNS

A

Domain Name System

122
Q

LAN

A

Local area network: single geographical area.

123
Q

WAN

A

Wide area network: many geographical locations one example the internet.

124
Q

Packet Switching

A

The data is split into a number of smaller packets that may take different routes to reach each
destination and each split piece of data will use the most efficient route. If anything fails to
arrive as it is sequenced this therefore allows knowing what is missing therefore only that
piece of data is resent.

125
Q

Circuit Switching

A

A circuit is established between two nodes and all data follows this path. This is known as
connection orientated networks. If any of the data doesn’t reach as it was all sent along one path
this therefore prevents knowing what is missing therefore it all needs to be resent. The diagram
below shows this.

126
Q

Firewall

A

A firewall can be either software or hardware that blocks original access to a computer system
unless allowed.

127
Q

Proxies

A

This is a server that connects the user to the internet therefore it can prevent access to specific
sites if filtering is occurred.

128
Q

Encryption

A

Encryption is the process of altering data to make it unreadable to a party that doesn’t have
authorised access.

129
Q

Client-Server

A

A client server is when a client in this example one of the computers attached to the network requests services from the server
and the server separates the functions in the most efficient way this is commonly used for business or schools.

There are two types of client server thick client and thin client servers. A thin client server uses simple devices that access the
server and all the processing and software is held and done on the sever therefore the machines do none of their own processing
so require less hardware. A thick client server is when some of processing is done by the machine and the machine only uses the
server when it requires extra information.

130
Q

Peer-to-Peer

A

This is a system based on all computer having the same power ever computer in this set up act as a client and a
server this is a cheaper architecture and also lends itself very well to the use of the internet as over a peer to peer
set up allows for easy file sharing over the network without the need of specialised hardware or a centralised
server. If one terminal fails only that one terminals data is lost while the rest are still functional this has therefore
led to peer to peer becoming very popular for file sharing for items such as music this has led to mass time of piracy.

131
Q

HTML

A

HyperText Markup Language

132
Q

CSS

A

Cascading Style Sheet

133
Q

JavaScript

A

This is a language that is used in conjunction with HTML in order to have dynamic features on
a webpage

134
Q

Search Engine Indexing

A

This is the process where crawllers search through webpages in order to aid with ranking.

135
Q

PageRank Algorithm

A

This is the algorithm that determines how webpages are ranked on the google search engine.

136
Q

Server Side Processing

A

This is used in the server side architecture and this means that processing is not done through
a local machine but a server.

137
Q

Client Side Processing

A

This describes where processing is done per client rather than centrally on a server.

138
Q

Primitive Data Types

A

These are examples of basica data types such as INT, STRING, FLOAT and BOOL

139
Q

Integer

A

An integer is a whole number denary value.

140
Q

Real

A

Any numeric value

141
Q

Floating Point

A

A floating point value can contain decimal places.

142
Q

Character

A

A character is a letters or punctuation.

143
Q

String

A

A string is used to store a set of values either Integer or character.

144
Q

Boolean

A

A Boolean is a condition type data type for example TRUE/FALSE

145
Q

Binary

A

Binary is a character type that is expressed with 1 and 0.

146
Q

Hexadecimal

A

This is a data type that is represented in 16 characters.

147
Q

Denary

A

This is a normal (Base 10) integer value

148
Q

Shifts

A

This is the process of shifting binary values either left or right.

149
Q

AND

A

This is used in logic gates and to create an output value of 1 both gates must be active.

150
Q

OR

A

This is used in the logic gates and to create an output value of 1 only one gate can be active.

151
Q

XOR

A

This stands for exclusively or meaning a specific logic gate can only be active to create a 1
output value whereas or it can be either

152
Q

Character Sets

A

There are two types of character sets ASCII and Unicode each these use different Bit values.

153
Q

Character Sets

A

There are two types of character sets ASCII and Unicode each these use different Bit values.

154
Q

ASCII

A

This is a character set that each character that take up 8 bits in memory. It can represent up to
256 separate characters.

155
Q

UNICODE

A

This is a character set where each character is represented by 16 bit and is a larger character
set. This can represent up to 65,000 separate characters.

156
Q

Array

A

An array is a series of characters all of the same data type.

157
Q

Records

A

Accessed through an attribute

A record is an unordered data structure

Data can be ordered by a specific attribute

All attributes must be defined before them being used in the record.

158
Q

Lists

A

This is an ordered data structure

A list is accessed through an index

The index indicates the position of the data in the list

Has no predefined scope

Attributes don’t need to be defined before using them in the list.

159
Q

Tuple

A

This is a type of list

This is immutable

This is useful for data that must be accessed but index but must not be changed.

160
Q

Linkedlist

A

An unordered data structure that uses pointers to sort data.

161
Q

Directed Graph

A

A graph that has directions linking the data

162
Q

Undirected Graph

A

A graph without directions linking the data.

163
Q

Stack

A

Data is added to the top of the structure LIFO

Pop used to remove data

Push use to add data.

164
Q

Queue

A

FIFO structure

Pop used to remove

Push used to add

165
Q

Tree

A

Hierarchical data structure with data related to the data above it in the trees.

166
Q

Binary Search Tree

A

A tree structure where each node can only have two branches left and right.

167
Q

Hash Table

A

A hash table stores data that have had hash calculation applied to it.

168
Q

DPA

A

Data protection act 1998.

Data must be processed fairly and lawfully

Data only used for specified purpose

Data should be relevant / not excessive

Data should be accurate/up to data

Data should not kept longer than needed

Right to access and correct data

Security to prevent unauthorised access

Data not to be transferred outside the EU that don’t have adequate data protection

ICO (information commissioner’s office) enforces and regulates DPA.

169
Q

CMA

A

Computer misuse act 1990

Part 1 Unauthorised access: This relates to access to data or programs when permission
hasn’t been given

Part 2 Unauthorised access with intent to commit or falcate further offences: IF the
information is accessed even with permission to do so with intent to commit fraud or black
mail this part covers this.

Part 3 Unauthorised access with the intent to impair the operation of a computer or system:
This means that access and unauthorised alterations are made to the computer or system.

170
Q

CDPA

A

The Copyright Design and Patents Act 1988

This protects online intellectual property from unauthorised use, copies being made and
profit made from the content.

171
Q

RIPA

A

The Regulation of Investigatory Powers Act 2000

Demands ISP’s provide access to a customers communications

Allowing monitoring of an individual internet activates

Demand accessed be to be protected information

Prevent the existence of such interceptions activates being in court

Demand access be granted to be protected information

Demand ISP’s fit equipment to facilitate surveillance

Allow mass surveillance of communications

172
Q

Abstraction

A

This is a computational thinking method that focuses on removing unnecessary information from the problem.

173
Q

Abstract model

A

This is the process of creating a model in order to show what is necessary and unnecessary.

174
Q

System Inputs

A

This describes what data needs to be input into the overall system.

175
Q

System Outputs

A

This discusses the overall outputs the system will have.

176
Q

Solution Preconditions

A

This term talks about the conditions that must be met before the solution can be made.

177
Q

Concurrent Processing

A

This is the process of instructions being run at the same time of each other.

178
Q

Sequence

A

A sequence is a set of code that is run line by line.

179
Q

Iteration

A

This is creating a version of the end program that isn’t the overall finished project but can be
made into it.

180
Q

Branching/Selection

A

Branching and selection is examples of IF statements allows for checks to be made.

181
Q

Recursion

A

This is the process of a function calling its self within a function.

182
Q

Global Variable

A

This is a variable that’s scope is accessible throughout the entire program

183
Q

Local variable

A

A local variable has a scope meaning it can be accessed inside the function where it is defined.

184
Q

Modularity

A

This is describes when a project has been split into modules.

185
Q

Functions

A

A function is a section of code that either returns one value

186
Q

Procedures

A

A section of code that will return none or many values.

187
Q

Parameters

A

These are either hardcoded values or variables that are passed into functions or procedures.

188
Q

Parameter Passing

A

This is the process of passing parameters into functions or procedures.

189
Q

Parameter Passing by Value

A

Passing by reference memory location is sent and then any alterations that are made are kept
to the original value.

190
Q

Parameter Passing By Reference

A

passing by reference the caller and callee have two independent variables with the same
value.

191
Q

IDE

A

Integrated development environment used to programming.

192
Q

Debugging

A

This is the process of removing errors from code.

193
Q

Computational methods

A

These describes the overall methods which are involved in making a computing solution.

194
Q

Problem Recognition

A

This is the process of creating requirements for the program.

195
Q

Problem Decomposition

A

This is breaking down the overall problems into modules that can be coded.

196
Q

Divide and Conquer

A

This is the process of splitting the project in order for multiple groups to work on the overall
project.

197
Q

Backtracking

A

This is the process of going back in order to improve the code.

198
Q

Data Mining

A

This is the process of examining large amounts of data in order to find patterns.

199
Q

Heuristics

A

This is the process of find the most suitable solution to the project.

200
Q

Performance Modelling

A

This is the process of creating a model in order to show how the solution is performing for its
job.

201
Q

Visualisation

A

This is the process of creating a Visualisation representation of the project in order to help
with programming.

202
Q

Algorithm

A

This is a section of code used to perform a specific function.

203
Q

Bubble Sort

A

Set swapMade to True

WHILE swapMade is True

Set swapMade to False

Start at position 0

FOR position= 0 TO listlength – 2

Compare the item at position the algorithm with the one ahead of it.

IF they are our of order THEN

Swap items are set swapMAde to True

ENDIF

NEXT position

END WHILE

204
Q

Insertion Sort

A

Insertion sort works by dividing a list into two parts sorted and unsorted. Elements are inserted one by one into
their correct positon in the sorted list.

Make the first item the sorted list, the remaining items unsorted list

WHILE there are items in the unsorted list

Take the first item of the unsorted list.

WHILE there is an item to the left of it which is smaller than itself

Swap with that item

END WHILE

The sorted list is now one item bigger

ENDWHILE

205
Q

Merge Sort

A

Merge sort splits a list of size n into n list of size 1. Each of these lists is merged with another. Each of the newly merged lists is
merged with another. This is repeated until there is only one sorted list.

IF the first item in list

206
Q

Binary Search

A

Binary search works by dividing the list in two each time until the item being searched for is found. For binary search to work the list has to be in order.

LowerBound=0

UpperBound=LengthOfList-1

Found=False

While Found== False AND LowerBound!= UpperBound

MidPoint=ROUND((LowerBound+UpperBound)/2)

IF List[MidPoint] ==searchedFor THEN

Found=True

ELSEIF List[Midpoint]

207
Q

Linear search

A

Linear search involves searching through data one location after another until the desired
value is found. The search starts at the beginning of a list and checks each item until desired is
found.

pointer=0

WHILE pointer=LengthOfList Then

PRINT(“Item is at location” +pointer)

A Level Computer Science (1 decks)

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