Term
|
Definition
| a sort using only the main memory of the computer |
|
|
Term
|
Definition
| given two sets, the intersection is the set of elements that are members of both sets. |
|
|
Term
|
Definition
| a problem that is so hard (typically exponential) that it cannot be solved unless the problem is small. |
|
|
Term
|
Definition
| an object containing data and methods to iterate through a collection of data, allowing processing of one data item at a time. |
|
|
Term
|
Definition
| the delay between asking for data from an I/O device and the beginning of data transfer. |
|
|
Term
|
Definition
| a tree node containing a contents value but with no children. |
|
|
Term
|
Definition
| last-in, first out: describes the order of a stack. |
|
|
Term
|
Definition
| O(n), a problem whose solution requires a linear amount of time or space if the problem is of size n. |
|
|
Term
|
Definition
| a pointer to the next element in a linked list. |
|
|
Term
|
Definition
| a sequence of records, where each record contains a link to the next one. |
|
|
Term
|
Definition
| in a hash table, the fraction of the table's capacity that is filled. |
|
|
Term
|
Definition
| in MapReduce, a program that processes an element of the input and emits one or more (key, value) pairs. |
|
|
Term
|
Definition
| association of one or more elements of a Range set with each element of a Domain set. |
|
|
Term
|
Definition
| a program that controls a set of other programs or devices. |
|
|
Term
|
Definition
| a priority queue in which the maximum element is removed first. |
|
|
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 (e.g. RAM) is larger, and the slowest memory (e.g. disk) is largest. |
|
|
Term
|
Definition
| the processing of data in such a way that data that are located near each other by memory address are accessed nearby in time. |
|
|
Term
|
Definition
| to combine two ordered linear structures into one. |
|
|
Term
|
Definition
| a priority queue in which the minimum element is removed first. |
|
|
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. |
|
|
