# Jargon

4.5 / 5 based on 2 ratings

- Created by: GeriB
- Created on: 24-05-18 10:04

Absolute Error

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

1 of 158

Abstract data type (ADT)

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

2 of 158

Abstraction

Representation that is arrived at by removing unnecessary details.Representation that is arrived at by removing unnecessary details.

3 of 158

Aggregation

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.

4 of 158

Ajax

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

5 of 158

Algorithm

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

6 of 158

Application programming interface (API)

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

7 of 158

Association

If the relationship is not inheritance or aggregation it is an association.

8 of 158

Asymptotic behaviour of f

Behaviour of the function f(n) for very large values of n.

9 of 158

Asynchronous serial data transmission

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.

10 of 158

Attribute

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

11 of 158

Automation

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

12 of 158

Backus-Naur Form, (BNF)

Backus-Naur Form, (BNF)

13 of 158

Bandwidth

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

14 of 158

Base case

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

15 of 158

Baseband system

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.

16 of 158

Basic operation

The operation which contributes most to the total running time.

17 of 158

Baud rate

The rate at which signals on a wire may change.

18 of 158

Behaviours

The functions of the object or what the object does.

19 of 158

Bit rate

The number of bits transmitted per second.

20 of 158

Broadband

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

21 of 158

Bubble sort

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

22 of 158

Cipher text

Message data after it has been encrypted.

23 of 158

Circular queue

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.

24 of 158

Class definition

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

25 of 158

Client

A computer that uses the services provided by a server.

26 of 158

Client-server system

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

27 of 158

Closed path/circuit

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.

28 of 158

Communication protocol

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

29 of 158

Complexity of a problem

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

30 of 158

Composite key

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

31 of 158

Computational complexity

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

32 of 158

Composition

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 die

33 of 158

Conceptual model

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.

34 of 158

Cryptanalysis

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

35 of 158

Cryptography

The science of designing cipher systems.

36 of 158

Cycle

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

37 of 158

Data Model

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.

38 of 158

Data transmission

Movement of data.

39 of 158

Database

A structured collection of data.

40 of 158

Database management system

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

41 of 158

Decryption

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

42 of 158

Degree (of a vertex)

The number of neighbours for that vertex.

43 of 158

Degree of relationship

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.

44 of 158

Deterministic finite state machine (FSM)

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

45 of 158

Directed graph

A diagram consisting of vertices, joined by directed edges.

46 of 158

Dynamic allocation

Memory space is only allocated when required at runtime.

47 of 158

Dynamic data structure

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

48 of 158

Dynamic web page content

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

49 of 158

Embedded computer system

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

50 of 158

Encapsulation

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

51 of 158

Encryption

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

52 of 158

Entity

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

53 of 158

Evaluation

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

54 of 158

Explorer's problem

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

55 of 158

Exponential growth

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

56 of 158

Exponential time algorithm

An algorithm whose execution time grows exponentially with input size.

57 of 158

Feasibility study

A study that investigates the potential of a new system.

58 of 158

Finite state machine

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, based upon the input that it receives and its current state.

59 of 158

Floating point notation

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

60 of 158

Foreign key

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

61 of 158

Gateway

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

62 of 158

General case

The solution in terms of itself for a value n.

63 of 158

Graph

A diagram consisting of vertices joined by edges.

64 of 158

Halting problem

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

65 of 158

Halting state

A state that has no outgoing transition.

66 of 158

Handshaking protocol

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

67 of 158

Heuristic

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.

68 of 158

Human-computer interaction

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

69 of 158

Inheritance

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

70 of 158

Instantiation

An object is defined based on a class.

71 of 158

Internet

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

72 of 158

Interpreter

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.

73 of 158

Intractable

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

74 of 158

Labelled or weighted graph

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

75 of 158

Linear queue

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

76 of 158

Linear search

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.

77 of 158

Linear time algorithm

An algorithm that executes in O(n) time.

78 of 158

List

A collection of elements with an inherent order.

79 of 158

Maintainability of software

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

80 of 158

Maintenance

Fixing bugs, changing parameters and responding to changing requirements.

81 of 158

Mealy machine

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

82 of 158

Model

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.

83 of 158

Neighbours

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

84 of 158

Non-computable

An algorithmic problem that admits no algorithm.

85 of 158

Normalisation

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

86 of 158

Normalised entities

A set of entities that contain no redundant data.

87 of 158

Null pointer

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

88 of 158

Object

An instance of a class.

89 of 158

Operating system role

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 hardware complexities

90 of 158

Order of complexity

Of a problem is its big O complexity.

91 of 158

Overflow

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

92 of 158

Parallel data transmission

Multiple bits are sent down several wires simultaneously.

93 of 158

Peer-to-peer network

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.

94 of 158

Pharming

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

95 of 158

Phishing

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

96 of 158

Plain text

Message data before it is encrypted.

97 of 158

Pointer

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

98 of 158

Pointer type

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

99 of 158

Polymorphism

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.

100 of 158

Polynomial growth

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

101 of 158

Polynomial time algorithm

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

102 of 158

Precision

The maximum number of significant digits that can be represented.

103 of 158

Primary key

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

104 of 158

Principle of universality

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

105 of 158

Priority queue

Each element of a priority queue has an associated priority.

106 of 158

Prototype

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

107 of 158

Prototyping

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

108 of 158

Pseudo-random numbers

A series of numbers generated by computer with apparent randomness.

109 of 158

Queue

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

110 of 158

Recursive definition

One that is defined in terms of itself.

111 of 158

Recursive routine

A routine defined in terms of itself.

112 of 158

Referential integrity

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

113 of 158

Regular expression

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

114 of 158

Regular language

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

115 of 158

Relation

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

116 of 158

Relational database

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

117 of 158

Relationship

An association or link between two entities.

118 of 158

Relative error

The absolute error divided by the actual numbers.

119 of 158

Robust code

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

120 of 158

Rooted tree

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

121 of 158

Router

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.

122 of 158

Serial data transmission

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

123 of 158

Server

A computer that provides shared resources to network users.

124 of 158

Significant digits

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.

125 of 158

Simple graph

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

126 of 158

Software as a service (SaaS)

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

127 of 158

Space-complexity (of an algorithm)

How much memory an algorithm needs.

128 of 158

Stack

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

129 of 158

Stack frame

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

130 of 158

Stand-alone computer

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

131 of 158

State transition diagram

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.

132 of 158

Static data structure

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

133 of 158

System software

A program that manages the operation of a computer.

134 of 158

Thin-client network

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.

135 of 158

Time-complexity (of an algorithm)

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

136 of 158

Topology (networks)

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

137 of 158

Tractable

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

138 of 158

Transition function

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

139 of 158

Transition table

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

140 of 158

Traveller’s problem

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

141 of 158

Tree

A connected undirected graph with no cycles.

142 of 158

Trojan

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

143 of 158

Tuple

A set of attribute values in a database.

144 of 158

Turing machine (TM)

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).

145 of 158

Undecidable

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

146 of 158

Underflow

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

147 of 158

Universal TM, UTM

A universal Turing machine can simulate any other Turing machine. A UTM, U, is an interpreter that reads the description of any arbitrary Turing machine M and faithfully executes operations on data D precisely as M does.

148 of 158

Usability

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

149 of 158

Virtual machine

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.

150 of 158

Virus (computer)

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

151 of 158

Volumetrics

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

152 of 158

Web 2.0

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

153 of 158

Web server extension

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.

154 of 158

Web services

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

155 of 158

WiFi

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

156 of 158

Wireless network

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.

157 of 158

Worm

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

158 of 158

## Other cards in this set

### Card 2

#### Front

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

#### Back

Abstract data type (ADT)

### Card 3

#### Front

Representation that is arrived at by removing unnecessary details.Representation that is arrived at by removing unnecessary details.

#### Back

### Card 4

#### Front

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.

#### Back

### Card 5

#### Front

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

#### Back

## Related discussions on The Student Room

- Being overwhelmed by jargon when learning a new skill »
- CIE A Level Computer Science Sucks! »
- What do you do in computer science and how often a week do you have lessons on it? »
- Queen Mary Computing and information systems MSC (Convserion) »
- Introduction to Computer Science/Software Engineering »
- computer science at University »
- Combinational Logic Devices »
- Modules to take - CS final year »
- How to revise BTEC IT/Comp.? »
- "Without going to the University of Bradford, I wouldn't be where I am today." »

## Similar Computing resources:

0.0 / 5

4.0 / 5 based on 2 ratings

1.5 / 5 based on 7 ratings

5.0 / 5 based on 1 rating

Teacher recommended

2.0 / 5 based on 1 rating

2.5 / 5 based on 4 ratings

3.0 / 5 based on 1 rating

3.0 / 5 based on 1 rating

2.0 / 5 based on 1 rating

3.0 / 5 based on 1 rating

## Comments

No comments have yet been made