Print test
5 Written questions
5 Matching questions
 circularly linked list
 linear
 geometric series
 stack frame
 pattern
 a name for O(n) algorithm
 b a linked list in which the last element points back to the first element.
 c a section of the runtime stack holding the values of all variables for one invocation of a procedure.
 d a series in which each successive term is multiplied by a constant less than 1, e.g. 1 + 1/2 + 1/4 + 1/8 + ...
 e a representation of a class of objects, containing some constant elements in relation to variable elements.
5 Multiple choice questions
 1. in Lisp, the function that constructs a pair of pointers, or basic element of list structure. 2. to make a cons data structure. 3. a cons data structure.
 a priority queue in which the maximum element is removed first.
 a sort using only the main memory of the computer.
 in Quicksort, a "center" value used in partitioning the set to be sorted.
 an item (or description of items) being sought in a search.
5 True/False questions

depth → the number of links between the root of a tree and the leaves.

DFS → depthfirst search.

A* → a heuristic search algorithm that attempts to find a desired goal using a heuristic function to estimate the distance from a given node to the goal.

grammar → a contiguous block of memory containing elements of the same type, accessed by numeric index.

stable → describes a sort algorithm in which the relative position of elements with equal keys is unchanged after sorting.