5 Written questions
5 Matching questions
- stack frame
- boxed number
- a to look through a data structure until a goal object is found.
- b an item (or description of items) being sought in a search.
- c a section of the runtime stack holding the values of all variables for one invocation of a procedure.
- d 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.
- e in a search tree, a program that changes a state into a child state, e.g. a move in a game.
5 Multiple choice questions
- eXtensible Markup Language, a way of writing data in a tree-structured form by enclosing items in pairs of opening and closing tags, e.g. <zipcode> 78712 </zipcode>
- in object-oriented programming, a description of a set of similar objects.
- a classification of objects into a tree structure that groups related objects.
- the next element in a linked list.
- in a search tree, the number of children of a given node. Often, the branching factors of individual nodes will vary, so an average value may be used.
5 True/False questions
reference type → a type in which variables of that type are pointers to objects. In the code Integer i = 3, the variable i holds a pointer to the Integer object that contains the value. In int j = 3, the variable j contains the value. In Java, only reference types have methods.
tail recursive → a function whose value either does not involve a recursive call, or is exactly the value of a recursive call.
well-founded ordering → a case where two data structures share some elements.
binary search tree (BST) → ...
LIFO → a pointer to the next element in a linked list.