5 Written questions
5 Matching questions
- abstract data type
- a describes a function that makes a new data structure but does not modify its arguments.
- b in MapReduce, a program that processes an element of the input and emits one or more (key, value) pairs.
- c describes an arc that can only be traversed in one direction, or a graph with such arcs.
- d a description of operations on a data type that could have multiple possible implementations.
- e in a tree, the union of a node's parent and the parent's ancestors.
5 Multiple choice questions
- describes a relation that is both injective and surjective (one-to-one and onto).
- the amount of space on the runtime stack required for execution of a program.
- a representation of a graph in which a boolean matrix contains a 1 at position (i,j) iff there is an arc from node i to node j.
- a tree in which the heights of subtrees are approximately equal.
- a directed graph with no cycles.
5 True/False questions
tree rotation → a representation of a class of objects, containing some constant elements in relation to variable elements.
heuristic search → A* search.
Cartesian product → a node of a tree that has children.
circular queue → a queue implemented within an array, where the first element of the array logically follows the last element.
side-effect → to look through a data structure until a goal object is found.