NAME

Question types


Start with


Question limit

of 172 available terms

Advertisement Upgrade to remove ads
Print test

5 Written questions

5 Matching questions

  1. Big O
  2. cons
  3. weight
  4. taxonomy
  5. child
  1. a a classification of objects into a tree structure that groups related objects.
  2. b a number that denotes the cost of following an arc in a graph.
  3. c 1. in Lisp, the function that constructs a pair of pointers, or basic element of list structure. 2. to make a cons data structure. 3. a cons data structure.
  4. d an abstracted function that describes the amount of computer time or memory space required by an algorithm, as a function of problem size.
  5. e in a tree, a node pointed to by a parent node.

5 Multiple choice questions

  1. describes a mapping in which each element of the domain maps to a single element of the range. Also, one-to-one.
  2. 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. a binary Boolean function whose output is 1 if its inputs are different. Abbreviated XOR.
  4. a linked list in which the last element points back to the first element.
  5. the delay between asking for data from an I/O device and the beginning of data transfer.

5 True/False questions

  1. postorderan order of processing a tree in which the parent node is processed after its children.

          

  2. sparse graphan array in which most of the elements are zero or missing.

          

  3. structure sharinga case where two data structures share some elements.

          

  4. binding lista list structure that represents a set of bindings.

          

  5. max queueto combine two ordered linear structures into one.

          

Create Set