5 Written questions
5 Matching questions
- minimum spanning tree
- priority queue
- load factor
- a 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.
- b in a hash table, the fraction of the table's capacity that is filled.
- c a collection, such as a linked list, of values that hash to the same value.
- d describes a sort that does not require any additional memory.
- e a queue in which the highest-priority elements are removed first; within a priority value, the earliest arrival is removed first.
5 Multiple choice questions
- a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.
- Extensible Markup Language, a way of writing data in a tree-structured form by enclosing it in tags.
- a self-balancing sorted binary tree, in which the heights of subtrees differ by at most 1.
- an algorithm in which the data to be processed or the device to process it is randomly selected.
- 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.
5 True/False questions
operator → a variable containing the address of other data.
topological sort → a sort using only the main memory of the computer.
edge → a link or arc between nodes in a graph.
Splay tree → a tree with a high branching factor, to minimize the number of disk accesses required to access a desired record.
pattern → a variable containing the address of other data.