5 Written questions
5 Matching questions
- random access
- a the top node of a tree, from which all other nodes can be reached.
- b describes a data structure or device in which all accesses have the same cost, O(1).
- c a case where a program calls itself.
- d all nodes below a given node in a tree.
- e a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.
5 Multiple choice questions
- a case where two data structures share some elements.
- an abstract computer that is simulated by an interpreter program running on an actual computer.
- 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.
- a condition of the input data where the data will be handled by call(s) to the same program.
- the next element in a linked list.
5 True/False questions
sentinel → a process that removes unwanted elements from a collection.
sort → an element of a linked list, tree, or graph, often represented by a data structure.
constructive → describes a function that makes a new data structure but does not modify its arguments.
null dereference → given two sets, the set difference is the set of elements of the first set that are not members of the second set.
tail recursive → a function whose value either does not involve a recursive call, or is exactly the value of a recursive call.