5 Written Questions
5 Matching Questions
- binary search
- depth-first search
- a 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>
- b any effect of a procedure other than returning a value, e.g. printing or modifying a data structure.
- c a search in which children of a node are considered (recursively) before siblings are considered.
- d 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.
- e describes a process in which every arriving customer will eventually be served.
5 Multiple Choice Questions
- an element of a linked list, tree, or graph, often represented by a data structure.
- a group of bits that are treated as a unit and processed in parallel by a computer CPU. Common word sizes are 32 bits and 64 bits.
- an abstract computer that is simulated by an interpreter program running on an actual computer.
- to modify the order of a set of elements so that a desired ordering holds between them, e.g. alphabetic order.
- in object-oriented programming, a description of a set of similar objects.
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.
garbage → 1. data that is incorrect, meaningless, or random; 2. storage that is no longer pointed to by any variable and therefore can no longer be accessed.
set difference → the amount of space on the runtime stack required for execution of a program.
interior node → given two sets, the intersection is the set of elements that are members of both sets.
goal → an item (or description of items) being sought in a search.