Brainscape's Knowledge GenomeTM

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


See full index

Computer Science A Level > Definitions > Flashcards

Definitions Flashcards

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

Absolute Error

A

The difference between the actual number and the nearest representable value.

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

Abstract data type (ADT)

A

A data type whose properties are specified independently of any particular programming language.

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

Abstraction

A

Representation that is arrived at by removing unnecessary details.

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

Aggregation

A

A type of association where the aggregated object has a weaker form of association with the objects that it is aggregating than is the case with composition. These objects have an existence independent of the aggregated object and can continue to exist even after the aggregated object is disposed of.

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

Ajax

A

Web technology that allows only the part of a web page that needs updating to be fetched from the web server.

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

Algorithm

A

A sequence of unambiguous instructions for solving a problem. It can be represented as a Turing machine program.

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

Application programming interface (API)

A

A layer of software that allows application programs to call on the services of the operating system.

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

Association

A

An association is a relationship between two classes. There are different types of association: composition and aggregation.

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

Asymptotic behaviour of f

A

Behaviour of the functionf(n) for very large values ofn.

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

Asynchronous serial data transmission

A

Transmission system in which the sender and receiver have separate clocks which are not kept synchronised. Instead, the clocks are synchronised temporarily at the start of a transmission. The arrival of data cannot be predicted by the receiver; s a start bit is used to signal the arrival of data and to synchronise the transmitter and receiver temporarily.

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

Attribute

A

A property or characteristic of an entity (databases) or an object (OOP).

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

Automation

A

Turning an abstraction into a form that can be processed by a computer.

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

Backus-Naur Form, (BNF)

A

Backus-Naur Form, (BNF)

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

Bandwidth

A

For a transmission medium, the range of signal frequencies it may transmit.

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

Base case

A

A value that has a solution which does not involve any reference to the general case solution.

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

Baseband system

A

A system that uses a single data channel system in which the whole bandwidth of the transmission medium is dedicated to one data channel at a time.

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

Basic operation

A

The operation which contributes most to the total running time.

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

Baud rate

A

The rate at which signals on a wire may change.

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

Behaviours

A

The functions of the object or what the object does.

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

Bit rate

A

The number of bits transmitted per second.

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

Broadband

A

A multiple data channel system in which the bandwidth of the transmission medium carries several data streams at the same time.

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

Bubble Sort

A

A sorting algorithm where during a pass, neighbouring values are compared and swapped. Passes are made until no further swaps are needed.

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

Cipher text

A

Message data after it has been encrypted.

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

Circular queue

A

When the array element with the largest possible index has been used, the next element to join the queue reuses the vacated location at the beginning of the array.

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

Class definition

A

A template that can be used to create objects of that class.

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

Client

A

A computer that uses the services provided by a server.

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

Client-server system

A

A system in which some computers (the clients), request services provided by other computers, the servers.

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

Closed path/circuit

A

A sequence of edges that start and end at the same vertex and such that any two successive edges in the sequence share a vertex.

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

Communication protocol

A

A set of agreed signals, codes and rules to be used for data and information exchange between computers.

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

Complexity of a problem

A

Taken to be the worst case complexity of the most efficient algorithm which solves the problem.

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

Composite key

A

A combination of attributes that uniquely identifies a tuple/record.

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

Computational complexity

A

A measure of how economical an algorithm is with time and space.

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

Composition

A

A type of association where the composite object has ownership of the objects within it. The objects that are part of the composite objects have a lifecycle determined by the composite object. If the composite object ceases to exist then they too will cease to exist.

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

Conceptual model

A

A representation of the data requirements of an organisation constructed in a way that is independent of any software that is used to construct the database.

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

Cryptanalysis

A

A method of trying to find the plain text from the cipher text without the decryption key.

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

Cryptography

A

The science of designing cipher systems.

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

Cycle

A

A closed path in which all the edges are different and all the intermediate vertices are different.

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

Data Model

A

A method of describing the data, it’s structure, the way it is interrelated and the constraints that apply to it for a given system or organisation.

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

Data transmission

A

Movement of data.

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

Database

A

A structured collection of data.

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

Database management system

A

A software system that enables the definition, creation and maintenance of a database and which provides controlled access to this database.

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

Decryption

A

Using an algorithm and a key to convert encrypted message data into its plain text equivalent.

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

Degree (of a vertex)

A

The number of neighbours for that vertex.

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

Degree of relationship

A

Between two entities, it refers to the number of entity occurrences of one entity which are associated with just one entity occurrence of the other and vice versa.

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

Deterministic finite state machine (FSM)

A

An FSM that has just one next state for each pair of state and input symbols.

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

Directed graph

A

A diagram consisting of vertices, joined by directed edges.

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

Dynamic allocation

A

Memory space is only allocated when required at runtime.

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

Dynamic data structure

A

The memory taken up by the data structure varies at run time.

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

Dynamic web page content

A

Content that is generated when the web browser request is received.

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

Embedded computer system

A

A dedicated computer system with a limited or non-existent user interface and designed to operate completely, or largely, autonomously from within other machinery.

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

Encapsulation

A

Combining a record with the procedures and functions that manipulate it to form a new data type; a class in OOP.

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

Encryption

A

Using an algorithm and a key to convert message data into a form that is not understandable without that key.

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

Entity

A

An object, person, event or thing of interest to an organisation and about which data are recorded.

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

Evaluation

A

A systematic assessment of whether something meets its objectives or specifications and how well it meets the latter in terms of effectiveness, usability, maintainability.

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

Explorer’s problem

A

The solution finds a route that traverses each road exactly once before returning to the starting point.

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

Exponential growth

A

Growth that has the form kn, e.g. 2n where k = 2 and n = 1, 2, 3, etc.

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

Exponential time algorithm

A

An algorithm whose execution time grows exponentially with input size.

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

Feasibility study

A

A study that investigates the potential of a new system.

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

Finite state machine

A

A finite state machine is a model of computation for a machine that is always in one of a fixed number of states. The state of the machine can be changed according to transition rules, basedupon the input that it receives and its current state. Some finite state machines produce output as they carry out transitions whilst others simply produce a yes/no response at the end of processing their input.

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

Floating point notation

A

A real number represented by a sign, some significant digits (the mantissa) and a power of 2 (the exponent).

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

Foreign key

A

An attribute in one table that is a primary key in another table.

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

Gateway

A

A device used to connect networks using different protocols so that information can be successfully passed from one system to another.

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

General case

A

The solution in terms of itself for a value n.

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

Graph

A

A diagram consisting of vertices joined by edges.

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

Halting problem

A

The unsolvable problem of writing a program that can tell whether a given program and its inputs will halt, without running the given program.

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

Halting state

A

A state that has no outgoing transition.

67
Q

Handshaking protocol

A

The sending and receiving devices exchange signals to establish that they are each ready to initiate data transfer.

68
Q

Heuristic

A

An approach that uses experience to make informed guesses that assist in finding a polynomial time solution to an intractable algorithmic problem. The ‘solution’ may be non-optimal.

69
Q

Human-computer interaction

A

The study, planning and design of what happens when a computer and human work together.

70
Q

Inheritance

A

The relationship between two object types in which one is a kind of the other and shares some of its properties or behaviours.

71
Q

Instantiation

A

An object is defined based on a class.

72
Q

Internet

A

A global wide area network that is formed from the interconnection of many other networks and that uses the TCP/IP protocol.

73
Q

Interpreter

A

An interpreter works its way through a set of source code instructions identifying the next instruction and then running routine(s) to execute it, before moving on to the next instruction.

74
Q

Intractable

A

A problem which can be solved, but for which no polynomial time solution (or better) has been found.

75
Q

Labelled or weighted graph

A

A graph in which the edges are labelled or given a value called its weight.

76
Q

Linear queue

A

Elements join the queue at one end and leave the queue at the other.

77
Q

Linear search

A

Starts at the beginning of the list and compares each element in turn with the required value until a match is found, or the end of the list is reached.

78
Q

Linear time algorithm

A

An algorithm that executes in O(n) time.

79
Q

List

A

A collection of elements with an inherent order.

80
Q

Maintainability of software

A

How easy it is to fix bugs, change parameters and respond to changing requirements.

81
Q

Maintenance

A

Fixing bugs, changing parameters and responding to changing requirements.

82
Q

Mealy machine

A

A finite state machine (FSM)that determines its outputs from the present state and from the inputs.

83
Q

Model

A

An abstraction of an entity in the real world or in the problem that enables an automated solution. The abstraction is a representation of the problem that leaves out unnecessary detail.

84
Q

Neighbours

A

Two vertices are neighbours if they are connected by an edge.

85
Q

Non-computable

A

An algorithmic problem that admits no algorithm.

86
Q

Normalisation

A

A technique used to produce a normalised set of entities in a database.

87
Q

Normalised entities

A

A set of entities that contain no redundant data.

88
Q

Null pointer

A

A pointer that does not point to anything, usually represented by Ø or –1.

89
Q

Object

A

An instance of a class.

90
Q

Operating system role

A

To manage the hardware resources in order to provide for an orderly and controlled allocation of the processors, memories and I/O devices among the various programs competing for them and manage the storage of data. It hides the complexities of the hardware from the user.

91
Q

Order of complexity

A

Of a problem is its big O complexity.

92
Q

Overflow

A

The result of a calculation is too large to be represented using the available number of bits.

93
Q

Parallel data transmission

A

Multiple bits are sent down several wires simultaneously.

94
Q

Peer-to-peer network

A

A network that has no dedicated servers. All computers are of equal status and can both share resources themselves and use resources from other computers, ie they are peers.

95
Q

Pharming

A

When a phisher changes DNS server information so that customers are directed to another site.

96
Q

Phishing

A

When someone tries to get you to give them your personal information.

97
Q

Plain text

A

Message data before it is encrypted.

98
Q

Pointer

A

A variable that contains a memory address. The pointer ‘points’ to the memory location with that address.

99
Q

Pointer type

A

A variable of pointer type that stores an address of a data value.

100
Q

Polymorphism

A

Giving an action one name that is shared up and down a class hierarchy. Each class in the hierarchy implements the action in a way appropriate to itself.

101
Q

Polynomial growth

A

Growth that has the formnk, e.g.n3wherek= 3 andn= 1, 2, 3, etc.

102
Q

Polynomial time algorithm

A

An algorithm whose execution time grows as a polynomial of input size.

103
Q

Precision

A

The maximum number of significant digits that can be represented.

104
Q

Primary key

A

An attribute or set of attributes which uniquely identifies a tuple.

105
Q

Principle of universality

A

A universal machine is a machine capable of simulating any other machine.

106
Q

Priority queue

A

Each element of a priority queue has an associated priority.

107
Q

Prototype

A

An early or trial working version of the proposed system developed to test possible solutions.

108
Q

Prototyping

A

Building a working model, demonstration system, simplified version, rough copy or trial piece of software to help an analyst.

109
Q

Pseudo-random numbers

A

A series of numbers generated by computer with apparent randomness.

110
Q

Queue

A

A first-in-first-out (FIFO) abstract data type.

111
Q

Recursive definition

A

One that is defined in terms of itself.

112
Q

Recursive routine

A

A routine defined in terms of itself.

113
Q

Referential integrity

A

If a value appears in a foreign key in one table it must also appear in the primary key in another table.

114
Q

Regular expression

A

A notation for defining all the valid strings of a formal language or a special text string for describing a search pattern.

115
Q

Regular language

A

Any language that a finite state machine (FSM) will accept.

116
Q

Relation

A

A set of attributes and tuples, modelling an entity (a table).

117
Q

Relational database

A

A collection of tables which can be linked together by means of primary and foreign keys.

118
Q

Relationship

A

An association or link between two entities.

119
Q

Relative error

A

The absolute error divided by the actual numbers.

120
Q

Robust code

A

The program will function reliably and not crash or go into infinite loops, even with incorrect inputs or unpredictable values.

121
Q

Rooted tree

A

A tree in which one vertex has been designated as the root and every edge is directed away from the root.

122
Q

Router

A

A device that receives packets or from one host (computer) or router and uses the destination IP address that they contain to pass them correctly formatted, to another host (computer) or router.

123
Q

Serial data transmission

A

Single bits are sent one after another along a single wire.

124
Q

Server

A

A computer that provides shared resources to network users.

125
Q

Significant digits

A

Those digits which carry meaning contributing to the accuracy of a number. This includes all digits except leading and trailing zeros where they serve merely as placeholders to indicate the scale of the number.

126
Q

Simple graph

A

A graph without multiple edges in which each edge connects to two different vertices.

127
Q

Software as a service (SaaS)

A

A model of software deployment where an application is hosted as a service provided to customers across the internet.

128
Q

Space-complexity (of an algorithm)

A

How much memory an algorithm needs.

129
Q

Stack

A

A last-in-first-out (LIFO) abstract data type.

130
Q

Stack frame

A

The locations in the stack area used to store the values referring to one invocation of a routine.

131
Q

Stand-alone computer

A

A computer not networked, requiring its own printer and other peripherals plus its own installation of application software.

132
Q

State transition diagram

A

A directed graph whose nodes represent the states. An edge leading from state s to state t is called a transition and is labelled with a symbolic code, eg a | b. The a part of the label is called the transition’s trigger and denotes the input symbol. The b part, which is optional, denotes the output symbol.

133
Q

Static data structure

A

The memory required to store the data structure is declared before run time.

134
Q

System software

A

A program that manages the operation of a computer.

135
Q

Thin-client network

A

A network where all processing takes place in a central server; the clients are dumb terminals with little or no processing tower or local hard disk storage.

136
Q

Time-complexity (of an algorithm)

A

How fast an algorithm runs, expressed as a function of the number of input values.

137
Q

Topology (networks)

A

The shape, configuration or structure of the connections that connect device to the network.

138
Q

Tractable

A

A problem that has a reasonable (polynomial) time solution as the size of the input increases.

139
Q

Transition function

A

Maps (input symbol, current state) to (output symbol, next state, direction of movement).

140
Q

Transition table

A

Tabulates the mappings (input symbol, current state) to (output symbol, next state, direction of movement) for all inputs.

141
Q

Traveller’s problem

A

The solution finds a route that visits each city exactly once before returning to the starting point.

142
Q

Tree

A

A connected undirected graph with no cycles.

143
Q

Trojan

A

A program that hides in or masquerades as desirable software, such as utility or a game, but attacks computers it infects.

144
Q

Tuple

A

A set of attribute values in a database.

145
Q

Turing machine (TM)

A

A formal model of computation that consists of a finite state machine (FSM) that controls one or more tapes, where at least one tape is of unbounded length (ie infinitely long).

146
Q

Undecidable

A

Describes a decision-type algorithmic problem that is non-computable.

147
Q

Underflow

A

The result of a calculation is too small to be represented using the available number of bits.

148
Q

Universal TM, UTM

A

A universal Turing machine can simulate any other Turing machine.

149
Q

Usability

A

The ease with which a user interface can be used by its intended audience to achieve defined goals.

150
Q

Virtual machine

A

The apparent machine that the operating system presents to the user, achieved by hiding the complexities of the hardware behind layers of operating system software.

151
Q

Virus (computer)

A

A small program attached to another program or data file. It replicates itself by attaching itself to other programs.

152
Q

Volumetrics

A

Measurement or assessment of the volume of data that a system will be required to process and store.

153
Q

Web 2.0

A

Software that becomes a service that is accessed over the Internet.

154
Q

Web server extension

A

A program written in native code, ie an executable or a script that is interpreted by an interpreter running on the web server that extends the functionality of the web server and allows it to generate content at the time of the HTTP request.

155
Q

Web services

A

Self-contained, modular applications that can be described, published, located and invoked over a network, generally the web.

156
Q

WiFi

A

Trademarked IEEE 802.11 technologies that support wireless networking of home and business networks.

157
Q

Wireless network

A

Any type of local area network (LAN) in which the nodes (computers or computing devices, often portable devices) are not connected by wires but use radio waves to transmit data between them.

158
Q

Worm

A

A small program that exploits a network security weakness (security hole) to replicate itself through computer networks.

159
Q

Explain how a key-value pair is added to a hash table.

A
  1. Apply hash function to the key
  2. Use the resulting hash value as an index to the array
  3. Check if the location within the array at the index of the hash value is empty
  4. If empty, store the key and paired value at that location at that index in the array
  5. If an item is already present to handle collisions appropriately through (rehashing, linear probing and separate chaining.
160
Q

Separate chaining

A

The linked list data structure is used to implement this technique. So what happens is, when multiple elements are hashed into the same slot index, then these elements are inserted into a singly-linked list which is known as a chain.

161
Q

Function Application

A

Function Application means to apply a function to its arguments and can be described as the process of giving particular inputs to a function.

162
Q

Partial Function Application

A

A function application scheme, where a function is decomposed into smaller intermediate partial functions.

A partial function takes some of the arguments and returns a function awaiting the remainder of the arguments.

f :: A -> B -> C
pf :: A -> B
f :: pf -> C

163
Q
A

Computer Science A Level (13 decks)

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