Previous Section
 < Free Open Study > 
Next Section


quadratic probing
resolving a hash collision by using the rehashing formula (Hash-Value ± I2) % array-size, where I is the number of times that the rehash function has been applied
a data structure in which elements are added to the rear and removed from the front; a "first in, first out" (FIFO) structure
the number of possibilities for each position; the digits in a number system
random probing
resolving a hash collision by generating pseudorandom hash values in successive applications of the rehash function
range of values
the interval within which values must fall, specified in terms of the largest and smallest allowable values
real number
a number that has a whole and a fractional part and no imaginary part
record (struct) data type
a composite data type with a fixed number of components called fields (members); the operations are whole record assignment and selection of individual fields by name
the situation in which a subprogram calls itself
recursive call
a subprogram call in which the subprogram being called is the same as the one making the call
recursive case

See general (recursive) case.

recursive definition
a definition in which something is defined in terms of a smaller version of itself
reference parameter
a formal parameter that receives the location (memory address) of the caller's actual parameter
reference type
a simple data type consisting of an unbounded set of values, each of which is the address of a variable of a given type. The only operation defined on a reference variable is initialization, after which every appearance of the variable is implicitly dereferenced
in top-down design, the expansion of a module specification to form a new module that solves a major step in the computer solution of a problem
regression testing
reexecution of program tests after modifications have been made in order to ensure that the program still works correctly
relational operators
operators that state that a relationship exists between two values; in C++, symbols that cause the computer to perform operations to verify whether the indicated relationship exists
relative matching

See positional matching.

representational error
arithmetic error caused when the precision of the true result of arithmetic operations is greater than the precision of the machine
reserved word
a word that has special meaning in a programming language; it cannot be used as an identifier
responsibility algorithms
the stage in an object-oriented design in which algorithms are written for each of the responsibilities outlined on the CRC cards

See function result.

the point at which the computer comes back from executing a function
placed as far to the right as possible within a fixed number of character positions
a descriptive term for a program that can recover from erroneous inputs and other errors and keep running
the ability of a program to recover following an error; the ability of a program to continue to operate within its environment
the top node of a tree structure; a node with no parent
run-time stack
a data structure that keeps track of activation records during the execution of a program

Previous Section
 < Free Open Study > 
Next Section
Converted from CHM to HTML with chm2web Pro 2.85 (unicode)