NAME

Question Types


Start With


Question Limit

of 172 available terms

Advertisement Upgrade to remove ads

5 Written Questions

5 Matching Questions

  1. one-to-one
  2. quadratic
  3. graph
  4. path
  5. array
  1. a name for a O(n^2) algorithm
  2. b a contiguous block of memory containing elements of the same type, accessed by numeric index.
  3. c a sequence of steps along arcs in a graph.
  4. d describes a mapping in which each element of the domain maps to a single element of the range. Also, injective.
  5. e a set of nodes and arcs connecting the nodes.

5 Multiple Choice Questions

  1. analysis of a sentence of a language to determine the elements of the sentence and their relationship and meaning.
  2. an order of processing a tree in which the parent node is processed before its children.
  3. a sort using external storage in addition to main memory.
  4. describes a thought experiment or view of an entity.
  5. an algorithm that always tries the solution path that appears to be the best.

5 True/False Questions

  1. dense grapha graph such that a large fraction of possible connections among nodes are present, i.e. the number of edges is of the order of the number of vertices squared. cf. sparse graph.

          

  2. unparsingconverting an abstract syntax tree into a sentence in a language, such as a programming language.

          

  3. Splay treea self-balancing binary tree that places recently accessed elements near the top of the tree for fast access.

          

  4. intractablea problem that is so hard (typically exponential) that it cannot be solved unless the problem is small.

          

  5. deptha tree node containing a contents value but with no children.

          

Create Set