Term
|
Definition
| a data structure representing a sequence of items, which are removed in the same order as they were inserted. |
|
|
Term
|
Definition
| describes a data structure or device in which all accesses have the same cost, O(1). |
|
|
Term
|
Definition
| an algorithm in which the data to be processed or the deice to process it is randomly selected. |
|
|
Term
|
Definition
| a set of values that are the targets of a mapping. |
|
|
Term
|
Definition
| a case where a program calls itself. |
|
|
Term
|
Definition
| a condition of the input data where the data will be handled by call(s) to the same program. |
|
|
Term
|
Definition
| a self-balancing binary tree in which nodes are "colored" red or black. The longest path from the root to a leaf is no more than twice the length of the shortest path. |
|
|
Term
|
Definition
| to apply a given function to the elements of a given list. Also, fold. |
|
|
Term
|
Definition
|
|
Term
|
Definition
| a type in which variables of that type are pointers to objects. In the code Integer i = 3, the variable i holds a pointer to the Integer object that contains the value. In int j = 3, the variable jcontains the value. In Java, only reference types have methods. |
|
|
Term
|
Definition
| to apply a different hashing function to a key when a collision occurs. |
|
|
Term
|
Definition
| the top node of a tree, from which all other nodes can be reached. |
|
|
Term
|
Definition
| a way of storing a multiply-dimensioned array in memory, such that elements of a row are in adjacent memory addresses. |
|
|
Term
|
Definition
| a stack containing a stack frame of variable values for each active invocation of a procedure. |
|
|
Term
|
Definition
| the ability of an algorithm or hardware system to grow to handle a larger number of inputs. |
|
|
Term
|
Definition
| the area of program text over which a variable can be referenced. |
|
|
Term
|
Definition
| to look through a data structure until a goal object is found. |
|
|
Term
|
Definition
| an extra record at the start or end of a data structure such as a linked list, to simplify the processing. |
|
|
Term
|
Definition
| given two sets, the set difference is the set of elements of the first set that are not members of the second set. |
|
|
Term
|
Definition
| to hide similar items with the same name. |
|
|
