Print test
5 Written questions
5 Matching questions
 pivot
 directed
 binding
 Dijkstra's algorithm
 binary search
 a an optimal greedy algorithm to find the minimum distance and shortest path in a weighted graph from a give start node.
 b in Quicksort, a "center" value used in partitioning the set to be sorted.
 c search of a binary tree or other structure, in which the size of the set to be searched is cut in half at each step.
 d describes an arc that can only be traversed in one direction, or a graph with such arcs.
 e an association of a name with a value.
5 Multiple choice questions
 given two sets, the set of elements of the first set that are not members of the second set.
 a process that removes unwanted elements from a collection.
 the set of values that are the source values of a mapping.
 a number that denotes the cost of following an arc in a graph.
 a section of the runtime stack holding the values of all variables for one invocation of a procedure.
5 True/False questions

immutable → describes a data structure that cannot be changed once it has been created, such as Integer or String in Java.

taxonomy → a classification of objects into a tree structure that groups related objects.

dense graph → a graph such that a large fraction of possible connections among nodes are present, i.e. the number of edges is of the order of the number of vertices squared. cf. sparse graph.

bijective → describes a relation that is both injective and surjective (onetoone and onto).

Big O → lastin, first out: describes the order of a stack.