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. filter
  2. backtrack
  3. depth
  4. random access
  5. virtual machine
  1. a in a tree search, to move back from the node currently being examined to its parent.
  2. b the number of links between the root of a tree and the leaves.
  3. c an abstract computer that is simulated by an interpreter program running on an actual computer.
  4. d describes a data structure or device in which all accesses have the same cost, O(1).
  5. e a process that removes unwanted elements from a collection.

5 Multiple choice questions

  1. an ordering that can be guaranteed to terminate, e.g. starting at a positive integer and counting down to 0.
  2. an abstracted function that describes the amount of computer time or memory space required by an algorithm, as a function of problem size. For problems larger than a certain size, the actual time or space required will be less than the Big O multiplied by some constant.
  3. search of a binary tree or other structure, in which the size of the set to be searched is cut in half at each step.
  4. last-in, first out: describes the order of a stack.
  5. a case where two data structures share some elements.

5 True/False questions

  1. stack spacea simple case that can be solved easily, without recursion.

          

  2. DFSeXtensible Markup Language, a way of writing data in a tree-structured form by enclosing items in pairs of opening and closing tags, e.g. <zipcode> 78712 </zipcode>

          

  3. null dereferenceto convert from a pointer (address) to the data that is pointed to.

          

  4. ASCIIdescribes a process in which every arriving customer will eventually be served.

          

  5. circularly linked lista linked list in which the last element points back to the first element.

          

Create Set