5 Written questions
5 Matching questions
- recursive case
- a to look through a data structure until a goal object is found.
- b a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.
- c a condition of the input data where the data will be handled by call(s) to the same program.
- d a process that removes unwanted elements from a collection.
- e describes a thought experiment or view of an entity.
5 Multiple choice questions
- describes a data structure that cannot be changed once it has been created, such as Integer or String in Java.
- given two sets, the set difference is the set of elements of the first set that are not members of the second set.
- a number that is defined as an object, so that it has a runtime type and methods that can be used, e.g. Integer in Java.
- in object-oriented programming, a description of a set of similar objects.
- in a tree, the union of a node's parent and the parent's ancestors.
5 True/False questions
preorder → an order of processing a tree in which the parent node is processed before its children.
child → in a tree, a node pointed to by a parent node.
stack frame → the amount of space on the runtime stack required for execution of a program.
parent → to modify the order of a set of elements so that a desired ordering holds between them, e.g. alphabetic order.
interpreter → given two sets, the intersection is the set of elements that are members of both sets.