Term
|
Definition
| describes a graph with no cycles (circular paths) |
|
|
Term
|
Definition
| a link between two nodes in a graph |
|
|
Term
|
Definition
| information transfer rate of a network connection, in bits/second |
|
|
Term
|
Definition
| a data structure that implements a complete binary tree within an array, such that every parent node has a value that is less than the value of either of its children |
|
|
Term
|
Definition
| a matrix whose elements are 0 or 1 |
|
|
Term
|
Definition
| a set of pairs (x, y) of elements from two sets X and Y |
|
|
Term
|
Definition
| the act of comparing two values to determine which is greater according to some ordering |
|
|
Term
|
Definition
|
|
Term
|
Definition
| describes an arc that can only be traversed in one direction, or a graph with such arcs |
|
|
Term
|
Definition
| the set of values that are the source values of a mapping |
|
|
Term
|
Definition
| another term for hashing with buckets |
|
|
Term
|
Definition
| a series in which each successive term is multiplied by a constant less than 1, e.g. 1 + 1/2 + 1/4 + 1/8 .... |
|
|
Term
|
Definition
| a function that is deterministic but randomizing, i.e. whose output is a relatively small integer that appears to be a random function of the key value |
|
|
Term
|
Definition
| describes a mapping in which each element of the domain maps to a single element of the range. Also, one-to-one. |
|
|
Term
|
Definition
| the delay between asking for data from an I/O device and the beginning of data transfer |
|
|
Term
|
Definition
| association of one or more elements of a Range set with each element of a Domain set |
|
|
Term
|
Definition
| the use of several kinds of memory hardware in a computer system, where the fastest memory (e.g. cache) is smallest, slower memory (RAM) is larger, and the slowest memory (disk) is largest |
|
|
Term
|
Definition
| a tree formed from the nodes of a graph and a subset of its edges, such that all nodes are connected and the total cost of the edges is minimal |
|
|
Term
|
Definition
| describes a mapping in which each element of the range is the target of some element of the domain. Also, surjective. |
|
|
Term
|
Definition
| a representation of a class of objects, containing some constant elements in relation to variable elements |
|
|
Term
|
Definition
| a queue in which the highest-priority elements are removed first; without a priority value, the earliest arrival is removed first |
|
|
Term
|
Definition
| a self-balancing binary tree in which the 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
| the ability of an algorithm or hardware system to grow to handle a larger number of inputs |
|
|
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 graph in which any node is connected to relatively few other nodes. cf. dense graph. |
|
|
Term
|
Definition
| describes a sort algorithm in which the relative position of elements with equal keys is unchanged after sorting. |
|
|
Term
|
Definition
| being close together in time, i.e. memory accesses that occur within a short time of each other. |
|
|
Term
|
Definition
| describes a graph in which the arcs may be followed in either direction |
|
|
Term
|
Definition
| a number that denotes the cost of following an arc in a graph |
|
|
