5 Written questions
5 Matching questions
- pattern variable
- load factor
- memory locality
- a a part of a pattern that can match variable parts of an input.
- b the processing of data in such a way that data that are located near each other by memory address are accessed nearby in time.
- c describes a function that makes a new data structure but does not modify its arguments.
- d in a hash table, the fraction of the table's capacity that is filled.
- e a circular path in a graph.
5 Multiple choice questions
- a binary Boolean function whose output is 1 if its inputs are different. Abbreviated XOR.
- a simulation in terms of events, in which the highest-priority (least time) event is removed from an event queue and executed, which may have the effect of scheduling future events.
- a function whose value either does not involve a recursive call, or is exactly the value of a recursive call.
- storage that is no longer pointed to by any variable and therefore can no longer be accessed.
- an order of processing a tree in which the parent node is processed after its children.
5 True/False questions
reduce → directed acyclic graph.
balanced tree → a tree in which the heights of subtrees are approximately equal.
bandwidth → describes a sorting algorithm that can process items one at a time.
circularly linked list → a queue implemented within an array, where the first element of the array logically follows the last element.
sparse array → an order of processing a tree in which the parent node is processed before its children.