5 Written questions
5 Matching questions
- depth-first search
- a a search in which children of a node are considered (recursively) before siblings are considered.
- b to look through a data structure until a goal object is found.
- c describes a mapping in which each element of the range is the target of some element of the domain. Also, surjective.
- d the delay between asking for data from an I/O device and the beginning of data transfer.
- e describes a graph in which the arcs may be followed in either direction.
5 Multiple choice questions
- a classification of objects into a tree structure that groups related objects.
- A* search.
- describes a mapping in which each element of the domain maps to a single element of the range. Also, one-to-one.
- a function whose value either does not involve a recursive call, or is exactly the value of a recursive call.
- exclusive or.
5 True/False questions
abstract data type → a tree in which the heights of subtrees are approximately equal.
Boolean matrix → a matrix whose elements are 0 or 1.
ontology → a description of the kinds of objects that exist in a computer program, e.g. a Java class hierarchy.
descendants → in a tree, a node that points to a given node.
radix sort → 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.