5 Written questions
5 Matching questions
- adjacency list
- association list
- abstract data type
- greedy algorithm
- a an algorithm that always tries the solution path that appears to be the best.
- b a representation of a graph in which each node has a list of nodes that are adjacent to it, i.e. connected to it by an arc.
- c a pointer to data.
- d a list of pairs, where each pair has a key and a value associated with the key.
- e a description of operations on a data type that could have multiple possible implementations.
5 Multiple choice questions
- a pattern that describes a set of similar programs.
- a path between two nodes in a graph that does not revisit any intermediate node.
- a search in which children of a node are considered (recursively) before siblings are considered.
- O(n*log(n)) search algorithm; in-place, not stable. Picks a pivot, reorders so lesser objects are in front of pivot, recursively sorting sub-lists of lesser and sub-lists of greater values.
- to convert from a pointer (address) to the data that is pointed to.
5 True/False questions
symbol table → a problem that is so hard (typically exponential) that it cannot be solved unless the problem is small.
stack frame → a section of the runtime stack holding the values of all variables for one invocation of a procedure.
scalability → describes a sort algorithm in which the relative position of elements with equal keys is unchanged after sorting.
undirected → describes an arc that can only be traversed in one direction, or a graph with such arcs.
Boolean matrix → a matrix whose elements are 0 or 1.