Term
|
Definition
| A way of organizing data and its related procedures and functions. |
|
|
Term
|
Definition
| Methaods that do not alter the state or attributes of an object; their purpose is to return information. |
|
|
Term
|
Definition
| A storage register in all ALU that holds data temporarily while the data is processed and before it is transerred to memory. |
|
|
Term
ADSL (Asymmetrical Digital Subscriber Line)
|
|
Definition
| Technology that increases the data rate over existingtelephone lines accommodating voice and digital data transfer. A special modem is needed for access. |
|
|
Term
|
Definition
| A value or object passed to a method when it is called. |
|
|
Term
|
Definition
| Element of data contained in an object; as specified within the object’s class. |
|
|
Term
|
Definition
| A tree in which the right and left subtrees of any node have heights differing by one at the most. See also the definition for “unbalanced tree”. |
|
|
Term
|
Definition
| The way in which an object reacts to the methods applied. |
|
|
Term
|
Definition
| A notation used to describe the relative performance (speed) of an algorithm. |
|
|
Term
|
Definition
| An operator that combines two operands to give a single result, for example, addition, multiplication, division, mod, div. See also the definition for “unary operator”. |
|
|
Term
|
Definition
| A tree in which each node has at most two children. |
|
|
Term
|
Definition
| A queue in which the storage area is fixed and the first item is held in a location that is logically next to the storage location for the last item of the queue. Data items can be thought of as being arranged in a circle. |
|
|
Term
|
Definition
| A situation in which two or more entries in a file or other data structure are given the same memory location through the use of a hash table. |
|
|
Term
|
Definition
| A set of procedural operators with a related syntax, used to indicate the functions to be performed by an operating system. |
|
|
Term
|
Definition
| Concentric disk tracks of a hard disk (one on top of the other) form a cylinder. |
|
|
Term
|
Definition
|
|
Term
|
Definition
| To remove an item from the front of a queue. See also the definition for “enqueue”. |
|
|
Term
|
Definition
| Access to memory and devices without the direct control of the processor. This is most often used for hard disk access and screen display. |
|
|
Term
|
Definition
| Two areas of memory set aside for data transfer between the processor and peripherals. As one is emptied the other is filled up in order to speed up transfer. |
|
|
Term
|
Definition
| A linked list in which each node has both a head pointer and a tail pointer. |
|
|
Term
|
Definition
| Data structures that can change in size during program execution. See also the definition for “static data structures”. |
|
|
Term
|
Definition
| The combination of data and the operations that act on the data to form a single program unit called an “object”. |
|
|
Term
|
Definition
| To add an item to the rear of a queue. See also the definition for “dequeue”. |
|
|
Term
|
Definition
| First-in-first-out. See also the definitions for “queue”, “stack” and “LIFO”. |
|
|
Term
|
Definition
| Records whose size is determined in advance. All such records in a file have the same length. See also the definition for “variable-length records”. |
|
|
Term
|
Definition
| The performing of arithmetical calculations without regard to the position of the radix point. The relative position of the point has to be controlled during calculations. |
|
|
Term
|
Definition
| In floating point arithmetic, the position of the decimal point does not depend on the relative position of the digits in the numbers (as in fixed point arithmetic), since the two parts of the floating point number determine the absolute value of the number. |
|
|
Term
|
Definition
| A file in which, although the records are unordered, a particular record can be found using a sequential access to the index of the file followed by direct access to the data file. See also the definition for “partially-indexed file”. |
|
|
Term
|
Definition
| A link between two computer systems that converts data passing through into the formats needed for each system. |
|
|
Term
|
Definition
| The exchange of predetermined signals when a connection is established between two devices or components. |
|
|
Term
|
Definition
| A method of coding to obtain a search key for the purpose of storing and retrieving items of data. |
|
|
Term
|
Definition
| A table of information that is accessed by way of a shortened search key (the hash value). |
|
|
Term
|
Definition
| A notation for representing logical operators in which the operator is written between the operands, for example, A+B or A*B. See also the definitions for “postfix notation” and “prefix notation”. |
|
|
Term
|
Definition
| The name given to the property whereby an object, which extends another object, inherits the data members and member functions of the original. |
|
|
Term
|
Definition
| Traversal of a tree visiting the nodes in the order left-child, parent, right-child. See also the definitions for “pre-order traversal” and “post-order traversal”. |
|
|
Term
|
Definition
| A sort in which each item in a set is inserted into its proper position in the sorted set according to a specified criterion. See also the definitions for “bubble sort”, “selection sort” and“quicksort”. |
|
|
Term
|
Definition
| A suspension of a process, such as the execution of a computer program caused by an external event, performed in such a way that the process can be resumed. |
|
|
Term
| ISDN (integrated services digital network) |
|
Definition
| An international communications standard for sending voice, video and other data over digital telephone lines. |
|
|
Term
|
Definition
1. In computer security, a sequence of symbols used with a cryptographic algorithm for encrypting or decrypting data.
2. In databases, the key of a record is a field with a unique value that can be used to locate that record. |
|
|
Term
|
Definition
| In a tree, the node to the immediate left of a parent node. See also the definitions for “parent” and “right-child”. |
|
|
Term
|
Definition
| Many programming languages permit user-defined functions to be stored centrally and re-used in various programs. This central storage is called a “library”. A library manager is a utility program that catalogues, pre-compiles and links library modules. |
|
|
Term
|
Definition
| Last-in-first-out. See also the definitions of “stack”, “queue” and “FIFO”. |
|
|
Term
|
Definition
| A data structure technique of storing data in different areas of memory rather than in a contiguous block and keeping track of the data using pointers. |
|
|
Term
|
Definition
| A utility program that brings together the object modules, operating system routines and other utility software to produce a complete, executable program. |
|
|
Term
|
Definition
| A program that copies an object program held in memory into the memory area designated by the operatingsystem for execution. |
|
|
Term
|
Definition
| A circuit whose output can be determined by knowing the input and by following the path through the logic gates. |
|
|
Term
|
Definition
| A combinational circuit that performs an elementary logic operation and usually involves one output. |
|
|
Term
|
Definition
| A program that is usually part of the operating system that controls the allocation of memory to various applications. It is particularly important in multi-tasking systems where applications might otherwise cause conflicts, and for implementing virtual machines and virtual memory. |
|
|
Term
|
Definition
| The output of “nand” is False only if all inputs are True, otherwise the output is True. |
|
|
Term
|
Definition
| The output of “nor” is True if all statements are False, False if at least one statement is True. |
|
|
Term
| Open systems interconnection (OSI) |
|
Definition
| A set of protocols allowing different types of computers to be linked together. |
|
|
Term
|
Definition
| In an arithmetical expression, the operand is the data that is to be operated on. |
|
|
Term
|
Definition
| A character or string of characters that designate an operation. See also the definitions for “binary operator” and “unary operator”. |
|
|
Term
|
Definition
| The generation of a quantity, as a result of an arithmetic operation, that is too large to be contained in the result location. See also the definition for “underflow”. |
|
|
Term
|
Definition
| A group of bits made up of control signals, error control bits, coded information and the destination for the data. |
|
|
Term
|
Definition
| A method of transmitting data in which the data packet is transmitted as one entity irrespective of the whole message. |
|
|
Term
|
Definition
| An interface through which a computer transmits or receives data that consists of several bits sent simultaneously on separate wires. See also the definition for “serial interface”. |
|
|
Term
|
Definition
| A parameter is passed to a routine or method by variable name and type. When the code is run, the parameter is replaced by the value of the variable, and becomes the argument of the routine, referred to by the variable name in the definition. |
|
|
Term
|
Definition
| The node immediately above a given node, at the next level up. There can only be one parent node for each node, but different nodes may share the same parent. |
|
|
Term
|
Definition
| The breaking down of high-level programming language statements into their component parts during the translation process. An example would be identifying reserved words and variables. |
|
|
Term
|
Definition
| A file in which records are ordered in groups. Sequential access to an index followed by direct access to the first record in the group, then sequential access to the desired record, retrieves a particular record. See also the definition for “fully-indexed file”. |
|
|
Term
|
Definition
| A reference to an address that enables the retrieval of a data item or record. Used in dynamic data structures to move from item to item. |
|
|
Term
|
Definition
| Interrogation of devices for such purposes as avoiding contention, determining operational status, or determining readiness to send or receive data. |
|
|
Term
|
Definition
| The ability of different objects to respond appropriately to the same operation. |
|
|
Term
|
Definition
| To remove an item from the top of a stack. |
|
|
Term
|
Definition
| An access point for data entry or exit. |
|
|
Term
|
Definition
A method of forming mathematical expressions in which each operator is preceded by its operands and indicates the operation to be performed on the operands or the intermediate results that precede it; for example, A added to B and the sum multiplied by C is represented
by the expression AB+C*. See also the definitions for “infix notation” and “prefix notation”. |
|
|
Term
|
Definition
| Traversal of a tree by visiting the nodes recursively in the order left- child, right-child, parent. See also the definitions for “pre-order traversal” and “in-order traversal”. |
|
|
Term
|
Definition
| A method of forming mathematical expressions in which each operator precedes its operands and indicates the operation to be performed on the operands or the intermediate results that follow it. See also the definitions for “infix notation” and “postfix notation”. |
|
|
Term
|
Definition
| Traversal of a tree by visiting the nodes recursively in the order parent, left-child, right-child. See also the definitions for “in-order traversal” and “post-order traversal”. |
|
|
Term
|
Definition
| A register that holds the address of the next instruction to be fetched in the fetch execute cycle. |
|
|
Term
|
Definition
| To add an item to the top of a stack. |
|
|
Term
|
Definition
| An abstract data structure where items are inserted at one end and retrieved from the other end (FIFO). (The standard operations are given in 5.2.7.) |
|
|
Term
|
Definition
| A sort in which a list is first partitioned into lower and upper sublists for which all keys are, respectively, less than some pivot key or greater than the pivot key. See also the definitions for “bubble sort”, “selection sort” and “insertion sort”. |
|
|
Term
|
Definition
| The process whereby a method refers to itself. In many programming languages, a procedure or function can call itself. |
|
|
Term
|
Definition
| Contains the location in memory of an object. The object can contain many individual data members. |
|
|
Term
|
Definition
| A part of internal storage that has a specified storage capacity and is usually intended for a specific purpose. |
|
|
Term
|
Definition
| In a tree, the node to the immediate right of a parent node. See also the definitions for “parent” and “left-child”. |
|
|
Term
|
Definition
| n a disk drive, the time required for the disk to revolve until the correct sector is under/over the read/write heads. See also the definition for “seek time”. |
|
|
Term
|
Definition
| The smallest accessible storage unit on a disk. The point at which the sector intersects with a track is used to reference the location. |
|
|
Term
|
Definition
| In a disk drive, the time taken for the read/write heads to position themselves over the appropriate track. See also the definition for “rotational delay”. |
|
|
Term
|
Definition
| A special value that marks the end of a set of data. Also called an “end of data marker” or “rogue value”. |
|
|
Term
|
Definition
| An interface through which a computer transmits or receives data, one bit at a time. See also the definition for “parallel interface”. |
|
|
Term
|
Definition
| Creating classes that operate on a wide variety of different objects, and can be “dropped into” a current project, leading to reduced software cost and increased reliability. |
|
|
Term
|
Definition
| An abstract data structure where only the top is accessible for the insertion and retrieval of items (LIFO). |
|
|
Term
|
Definition
| A class that extends the attributes and methods of a parent class. |
|
|
Term
|
Definition
| A tree that is part of another tree. |
|
|
Term
|
Definition
| A class that provides its attributes and methods to a subclass. |
|
|
Term
|
Definition
| A series of concentric rings placed on a disk surface by the operating system. |
|
|
Term
|
Definition
| A non-linear data structure (representing a strictly hierarchical system of data) where each data item is thought of as a node. |
|
|
Term
|
Definition
1. The process of approximating a number by ignoring all
information beyond a set number of significant figures.
Truncation error is the error introduced by this process.
2. The deletion or omission of a leading or a trailing portion of a string in accordance with specified criteria. |
|
|
Term
|
Definition
| A table that describes a logic function by listing all possible combinations of input values and indicating the output value for each combination. |
|
|
Term
|
Definition
| A method of representing negative numbers in the binary system. |
|
|
Term
|
Definition
| An operator requiring only one operand to give a single result; for example, negation (overbar for a Boolean expression). See also the definition for “binary operator”. |
|
|
Term
|
Definition
| A tree in which the right and left subtrees have heights differing by more than one. See also the definition for “balanced tree”. |
|
|
Term
|
Definition
| The generation of a result whose value is too small for the range of the number representation being used. See also the definition for “overflow”. |
|
|
Term
|
Definition
Records whose length is not determined in advance. Each record is allocated the space that it needs to store the information it holds. See also the definition for “fixed-length record”. |
|
|
Term
|
Definition
| (Exclusive or gate.) The output is True if the two inputs are different; the output is False if the two inputs are alike. |
|
|
