5 Written Questions
5 Matching Questions
- stack space
- divide and conquer
- a in a tree, a node that points to a given node.
- b a data structure that can be identified at runtime as being a member of a class.
- c a problem-solving strategy in which a problem is broken down into sub-problems, until simple subproblems are reached.
- d the amount of space on the runtime stack required for execution of a program.
- e a program that reads instructions, determines what they say, and executes them. The CPU is an interpreter for machine language; the JVM is an interpreter for compiled Java bytecodes.
5 Multiple Choice Questions
- a tree node containing a contents value but with no children.
- a list of pairs, where each pair has a key and a value associated with the key.
- a description of the kinds of objects that exist in a computer program, e.g. a Java class hierarchy.
- describes a thought experiment or view of an entity.
- a sequence of records, where each record contains a link to the next one.
5 True/False Questions
depth-first search → search of a binary tree or other structure, in which the size of the set to be searched is cut in half at each step.
reference → in a tree, a node that points to a given node.
root → the top node of a tree, from which all other nodes can be reached.
Unicode → given two sets, the union is the set of elements that are members of either set.
union → 1. in Lisp, the function that constructs a pair of pointers, or basic element of list structure. 2. a cons data structure. 3. to make a cons data structure.