5 Written questions
5 Matching questions
- a an extra record at the start or end of a data structure such as a linked list, to simplify the processing.
- b converting an abstract syntax tree into a sentence in a language, such as a programming language.
- c a number that denotes the cost of following an arc in a graph.
- d analysis of a sentence of a language to determine the elements of the sentence and their relationship and meaning.
- e the set of values that are the source values of a mapping.
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.
- a data structure that can be identified at runtime as being a member of a class.
- the delay between asking for data from an I/O device and the beginning of data transfer.
- describes a graph with no cycles (circular paths).
- a description of the kinds of objects that exist in a computer program, e.g. a Java class hierarchy.
5 True/False questions
reference type → a type in which variables of that type are pointers to objects.
bucket → a circular path in a graph.
quick sort → O(n*log(n)) search algorithm; in-place, not stable. Picks a pivot, reorders so lesser objects are in front of pivot, recursively sorting sub-lists of lesser and sub-lists of greater values.
XML → to process a set of items using a specified function; another term for reduce.
bandwidth → a sequence of steps along arcs in a graph.