abstract data structure
A way of organizing data and its related procedures and functions. Also called Abstract Data Type (ADT) Queue, Stack, Linked-List, Tree
Methods that do not alter the state or attributes of an object; their purpose is to return information. getText() , getSize() , etc.
A storage register in the ALU that holds data temporarily while the data is processed and before it is transferred to memory.
ADSL (Asymmetrical Data Subscriber Line)
Technology that increases the data rate over existingh telephone lines accommodating voice and digital data transfer. A special modem is needed for access.
A value or object passed to a method when it is called
Eloement of data contained in an object; as specified within the object's class.
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".
The way in which an object reacts to the methods applied
A notation used to describe the relative performance (speed) of an algorithm.
An operator that combines two operands to give a single result, for example, addition, multiplication, division, mod, div.
a tree in which each node has at most two children.
A queue in which the storage area is fixed (e.g. array) 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.
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.
A set of procedural operators with a related syntax, used to indicate the functions to be performed by an operating system.
Concentric disk tracks of a hard disk (one on top of the other) form a cylinder
De Morgan's Law
if A and B are Boolean expressions, then not (A or B) = not A and not B not (A and B) = not A or not B
To remove an item from the front of a queue.
Access to memory and devices without the direct control of the processor. This is most often used for hard disk access and screen display.
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.
doubly linked list
A linked list in which each node has both a head pointer and a tail pointer.
dynamic data structure
Data structures that can change in size during program execution. See also the definition for "static data structures".
The combination of data and the operations that act on the data to form a single program unit called an "object".
To add an item to the rear of a queue.
First In First Out.
Records whose size is determined in advance. All such records in a file have the same length.
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.
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.
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.
A link between two computer systems that converts data passing through into the formats needed for each system.
The exchange of predetermined signals when a connection is established between two devices or components.
A method of coding to obtain a search key for the purpose of storing and retrieving items of data.
A table of information that is accessed by way of a shortened search key (the hash value).
A notation for representing logical operators in which the operator is written between the operands, for example, A+B or A*B.
The name given to the property whereby an object, which extends another object, inherits the data members and member functions of the original.
Traversal of a tree visiting the nodes in the order left child, parent, right child.
A sort in which each item in a set is inserted into its proper position in the sorted set according to a specified region.
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.
ISDN (integrated services digital network)
An international communications standard for sending voice, video and other data over digital telephone lines.
In computer security, a sequence of symbols used with a cryptographic algorithm for encrypting or decrypting data. OR In databases, the key of a record is a field with a unique value that can be used to locate that record.
In a tree, the node to the immediate left of a parent node.
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.
Last in First out.
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.
A utility program that brings together the object modules, operating system routines and other utility software to produce a complete, executable program.
A program that copies an object program held in memory into the memory area designated by the operating system for execution.
A circuit whose output can be determined by knowing the input and by following the path through the logic gates.
A combinational circuit that performs an elementary logic operation and usually involves one output. ex. AND, OR, NOT, XOR, NAND, NOR