NAME

Question types


Start with


Question limit

of 87 available terms

Advertisement Upgrade to remove ads
Print test

5 Written questions

5 Matching questions

  1. quadratic
  2. circular queue
  3. recursion
  4. cons
  5. circularly linked list
  1. a 1. in Lisp, the function that constructs a pair of pointers, or basic element of list structure. 2. a cons data structure. 3. to make a cons data structure.
  2. b O(n2), a problem whose solution requires a quadratic amount of time or space if the problem is of size n.
  3. c a linked list in which the last element points back to the first element.
  4. d a case where a program calls itself.
  5. e a queue implemented within an array, where the first element of the array logically follows the last element.

5 Multiple choice questions

  1. first-in, first-out: describes the ordering of a queue. A queue is fair.
  2. an order of processing a tree in which the parent node is processed after its children.
  3. given two sets, the set difference is the set of elements of the first set that are not members of the second set.
  4. to combine two ordered linear structures into one.
  5. a formal description of a language in terms of vocabulary and rules for writing phrases and sentences.

5 True/False questions

  1. gedankena variable containing the address of other data.

          

  2. DFS1. in Lisp, the function that constructs a pair of pointers, or basic element of list structure. 2. a cons data structure. 3. to make a cons data structure.

          

  3. successorin a tree, the union of a node's parent and the parent's ancestors.

          

  4. association lista sequence of records, where each record contains a link to the next one.

          

  5. first-child/next-siblinga way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.

          

Create Set