5 Written Questions
5 Matching Questions
- depth-first search
- a in a tree, a node pointed to by a parent node.
- b last-in, first out: describes the order of a stack.
- c the next element in a linked list.
- d a search in which children of a node are considered (recursively) before siblings are considered.
- e all nodes below a given node in a tree.
5 Multiple Choice Questions
- a classification of objects into a tree structure that groups related objects.
- a function whose value either does not involve a recursive call, or is exactly the value of a recursive call.
- a case where two data structures share some elements.
- given two sets, the intersection is the set of elements that are members of both sets.
- describes a data structure that cannot be changed once it has been created, such as Integer or String in Java.
5 True/False Questions
node → 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.
null dereference → a pointer to data.
inorder → an order of processing a tree in which the parent node is processed in between its children.
DFS → depth-first search.
circular queue → a tree in which each node has at most two children.