NAME

Question types


Start with


Question limit

of 172 available terms

Print test

5 Written questions

5 Matching questions

  1. adjacency list
  2. reference
  3. association list
  4. abstract data type
  5. greedy algorithm
  1. a an algorithm that always tries the solution path that appears to be the best.
  2. 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.
  3. c a pointer to data.
  4. d a list of pairs, where each pair has a key and a value associated with the key.
  5. e a description of operations on a data type that could have multiple possible implementations.

5 Multiple choice questions

  1. a pattern that describes a set of similar programs.
  2. a path between two nodes in a graph that does not revisit any intermediate node.
  3. a search in which children of a node are considered (recursively) before siblings are considered.
  4. 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.
  5. to convert from a pointer (address) to the data that is pointed to.

5 True/False questions

  1. symbol tablea problem that is so hard (typically exponential) that it cannot be solved unless the problem is small.

          

  2. stack framea section of the runtime stack holding the values of all variables for one invocation of a procedure.

          

  3. scalabilitydescribes a sort algorithm in which the relative position of elements with equal keys is unchanged after sorting.

          

  4. undirecteddescribes an arc that can only be traversed in one direction, or a graph with such arcs.

          

  5. Boolean matrixa matrix whose elements are 0 or 1.