5 Written questions
5 Matching questions
- a the next element in a linked list.
- b given two sets, the intersection is the set of elements that are members of both sets.
- c a variable containing the address of other data.
- d 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.
- e a tree node containing a contents value but with no children.
5 Multiple choice questions
- a description of the state of a process, such as a board game.
- an element of a linked list, tree, or graph, often represented by a data structure.
- a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.
- describes a data structure or device in which all accesses have the same cost, O(1).
- a condition of the input data where the data will be handled by call(s) to the same program.
5 True/False questions
structure sharing → a case where two data structures share some elements.
stack frame → in a tree search, to move back from the node currently being examined to its parent.
sort → to modify the order of a set of elements so that a desired ordering holds between them, e.g. alphabetic order.
ontology → given two sets, the union is the set of elements that are members of either set.
depth → to look through a data structure until a goal object is found.