Prev
Next
The smallest unit of information for data storage and transmission. Each bit is considered to be either a “0” or a “1”.
A class that extends the attributes and methods of a parent class.
A class that provides its attributes and methods to a subclass.
A combination of specifiers, the method name and the parameter list, that uniquely identifies the method.
A combinational circuit that performs an elementary logic operation and usually involves one output.
A computer-based system for defining, creating, manipulating, controlling, managing and using databases.
A device that detects measurable elements of a physical process for transfer to a computer.
A device that identifies the destination of messages and sends them via an appropriate route.
A file in which records are ordered and are retrieved using sequential access.
A finite set of different characters that is complete for a given purpose, for example, the 128 ASCII characters.
A group of bits made up of control signals, error control bits, coded information and the destination for the data.
A group of bits that can be addressed, transferred and manipulated as a single unit by the central processing unit.
A method of coding to obtain a search key for the purpose of storing and retrieving items of data.
A method of representing negative numbers in the binary system.
A notation used to describe the relative performance (speed) of an algorithm.
A program that provides services requested by client programs.
A program used to detect, trace and eliminate errors in computer programs or other software.
A sequence of instructions suitable for processing by a computer.
A sequence of symbols that can be evaluated.
A tree in which each node has at most two children.
A tree in which the right and left subtrees have heights differing by more than one.
A tree in which the right and left subtrees of any node have heights differing by one at the most.
A tree that is part of another tree.
A value or object passed to a method when it is called.
A variable that is defined and is capable of being used only in one specified program block.
A way of organizing data and its related procedures and functions.
An abstract data structure where items are inserted at one end and retrieved from the other end (FIFO).
An abstract data structure where only the top is accessible for the insertion and retrieval of items (LIFO).
An error in the rules that govern the structure of language statements.
An object that is created when an abnormal situation arises in a program.
An ordered set of well-defined instructions for the solution of a problem in a finite number of steps.
The ability of different objects to respond appropriately to the same operation.
The behaviour or operation of an object.
The combination of data and the operations that act on the data to form a single program unit called an “object”.
The generation of a quantity, as a result of an arithmetic operation, that is too large to be contained in the result location.
The generation of a result whose value is too small for the range of the number representation being used.
To add an item to the rear of a queue.
To add an item to the top of a stack.
To remove an item from the front of a queue.
To remove an item from the top of a stack.
Traversal of a tree by visiting the nodes recursively in the order left-child, right-child, parent.
Traversal of a tree by visiting the nodes recursively in the order parent, left-child, right-child.
Traversal of a tree visiting the nodes in the order left-child, parent, right-child.
Comments