Term
|
Definition
| the shortest path between a start node and a goal node in a weighted graph. |
|
|
Term
|
Definition
| any effect of a procedure other than returning a value, e.g. printing or modifying a data structure. |
|
|
Term
|
Definition
| a path between two nodes in a graph that does not revisit any intermediate node. |
|
|
Term
|
Definition
| in a PERT chart or scheduling graph, the amount of time by which the time of an activity could be increased without affecting the overall completion time. |
|
|
Term
|
Definition
| a program or device that operates under control of a master. |
|
|
Term
|
Definition
| to modify the order of a set of elements so that a desired ordering holds between them, e.g. alphabetic order. |
|
|
Term
|
Definition
| an array in which most of the elements are zero or missing. |
|
|
Term
|
Definition
| a graph in which any node is connected to relatively few other nodes. cf. dense graph. |
|
|
Term
|
Definition
| being close together in space, i.e. memory address. |
|
|
Term
|
Definition
| a self-balancing binary tree that places recently accessed elements near the top of the tree for fast access. |
|
|
Term
|
Definition
| describes a sort algorithm in which the relative position of elements with equal keys is unchanged after sorting. |
|
|
Term
|
Definition
| a section of the runtime stack holding the values of all variables for one invocation of a procedure. |
|
|
Term
|
Definition
| the amount of space on the runtime stack required for execution of a program. |
|
|
Term
|
Definition
| a description of the state of a process, such as a board game. |
|
|
Term
|
Definition
| a case where two data structures share some elements. |
|
|
Term
|
Definition
| the next element in a linked list. |
|
|
Term
|
Definition
| describes a mapping in which each element of the range is the target of some element of the domain. Also, onto. |
|
|
Term
|
Definition
| a data structure that links names to information about the objects denoted by the names. |
|
|
Term
|
Definition
| a function whose value either does not involve a recursive call, or is exactly the value of a recursive call. |
|
|
Term
|
Definition
| a classification of objects into a tree structure that groups related objects. |
|
|
