Taken to be the worst case complexity of the most efficient algorithm which solves the problem.Ī software system that enables the definition, creation and maintenance of a database and which provides controlled access to this database. Communication protocolĪ set of agreed signals, codes and rules to be used for data and information exchange between computers. Closed path/circuitĪ sequence of edges that start and end at the same vertex and such that any two successive edges in the sequence share a vertex. Client-server systemĪ system in which some computers (the clients), request services provided by other computers, the servers. ClientĪ computer that uses the services provided by a server. Class definitionĪ template that can be used to create objects of that class. 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. Message data after it has been encrypted. Passes are made until no further swaps are needed. Bit rateĪ sorting algorithm where during a pass, neighbouring values are compared and swapped. The functions of the object or what the object does. The rate at which signals on a wire may change. The operation which contributes most to the total running time. Baseband systemĪ 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. Base caseĪ value that has a solution which does not involve any reference to the general case solution. Backus-Naur Form, (BNF)įor a transmission medium, the range of signal frequencies it may transmit. Turning an abstraction into a form that can be processed by a computer. AttributeĪ property or characteristic of an entity (databases) or an object (OOP). 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. Instead, the clocks are synchronised temporarily at the start of a transmission. Transmission system in which the sender and receiver have separate clocks which are not kept synchronised. Asymptotic behaviour of fīehaviour of the function f( n) for very large values of n. There are different types of association: composition and aggregation. AssociationĪn association is a relationship between two classes. Application programming interface (API)Ī layer of software that allows application programs to call on the services of the operating system. It can be represented as a Turing machine program. AlgorithmĪ sequence of unambiguous instructions for solving a problem. Web technology that allows only the part of a web page that needs updating to be fetched from the web server. These objects have an existence independent of the aggregated object and can continue to exist even after the aggregated object is disposed of. AggregationĪ 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. Representation that is arrived at by removing unnecessary details. Abstract data type (ADT)Ī data type whose properties are specified independently of any particular programming language. The difference between the actual number and the nearest representable value. The following subject specific vocabulary provides definitions of key terms used in AQA's AS and A-level Computer Science specifications.
0 Comments
Leave a Reply. |