5 Written Questions
5 Matching Questions
- extendible hashing
- temporal locality
- binary tree
- a to apply a given function to the elements of a given list. Also, fold.
- b another term for hashing with buckets.
- c a tree in which each node has at most two children.
- d describes a mapping in which each element of the domain maps to a single element of the range. Also, injective.
- e being close together in time, i.e. memory accesses that occur within a short time of each other.
5 Multiple Choice Questions
- a link or arc between nodes in a graph.
- describes a mapping in which each element of the range is the target of some element of the domain. Also, surjective.
- an O(n*k) search algorithm where K = keylength. Stable. Sorts input into bins based on the lowest digit; then combines bins in order and sorts on the next highest digit & so forth.
- being close together in space, i.e. memory address.
- a set of pairs (x, y) of elements from two sets X and Y.
5 True/False Questions
interior node → given two sets, the set of elements that are members of both sets.
balanced tree → a tree in which the heights of subtrees are approximately equal.
binding → analysis of a sentence of a language to determine the elements of the sentence and their relationship and meaning.
recursion → a case where a program calls itself.
A* → an item (or description of items) being sought in a search.