5 Written questions
5 Matching questions
- base case
- greedy algorithm
- a directed acyclic graph.
- b a simple case that can be solved easily, without recursion.
- c to convert from a pointer (address) to the data that is pointed to.
- d an algorithm that always tries the solution path that appears to be the best.
- e to process a set of items using a specified function; another term for reduce.
5 Multiple choice questions
- 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.
- association of one or more elements of a Range set with each element of a Domain set.
- storage that is no longer pointed to by any variable and therefore can no longer be accessed.
- a link or arc between nodes in a graph.
- 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.
5 True/False questions
intersection → describes a mapping in which each element of the domain maps to a single element of the range. Also, one-to-one.
backtrack → in a tree search, to move back from the node currently being examined to its parent.
array → a contiguous block of memory containing elements of the same type, accessed by numeric index.
quadratic → describes a graph with no cycles (circular paths).
pointer → a program that controls a set of other programs or devices.