5 Written questions
5 Matching questions
- hash function
- a the delay between asking for data from an I/O device and the beginning of data transfer.
- b a function that is deterministic but randomizing, i.e. whose output is a relatively small integer that appears to be a random function of the key value.
- c an order of processing a tree in which the parent node is processed before its children.
- d any effect of a procedure other than returning a value, e.g. printing or modifying a data structure.
- e the next element in a linked list.
5 Multiple choice questions
- a situation in which many elements hash to the same hash value.
- a node of a tree that has children.
- the process of collecting garbage for recycling.
- a variable containing the address of other data.
- a condition of the input data where the data will be handled by call(s) to the same program.
5 True/False questions
tail recursive → a function whose value either does not involve a recursive call, or is exactly the value of a recursive call.
sort → to modify the order of a set of elements so that a desired ordering holds between them, e.g. alphabetic order.
iterator → an object containing data and methods to iterate through a collection of data, allowing processing of one data item at a time.
exclusive or → a binary Boolean function whose output is 1 if its inputs are different. Abbreviated XOR.
external sort → O(n*log(n)) search algorithm; stable, not in-place; breaks data in half, sorts, merges, repeats.