NAME

Question Types


Start With


Question Limit

of 87 available terms

Advertisement Upgrade to remove ads

5 Written Questions

5 Matching Questions

  1. XML
  2. binary search
  3. side-effect
  4. fair
  5. depth-first search
  1. a eXtensible 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>
  2. b any effect of a procedure other than returning a value, e.g. printing or modifying a data structure.
  3. c a search in which children of a node are considered (recursively) before siblings are considered.
  4. d 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.
  5. e describes a process in which every arriving customer will eventually be served.

5 Multiple Choice Questions

  1. an element of a linked list, tree, or graph, often represented by a data structure.
  2. a group of bits that are treated as a unit and processed in parallel by a computer CPU. Common word sizes are 32 bits and 64 bits.
  3. an abstract computer that is simulated by an interpreter program running on an actual computer.
  4. to modify the order of a set of elements so that a desired ordering holds between them, e.g. alphabetic order.
  5. in object-oriented programming, a description of a set of similar objects.

5 True/False Questions

  1. tail recursivea function whose value either does not involve a recursive call, or is exactly the value of a recursive call.

          

  2. garbage1. data that is incorrect, meaningless, or random; 2. storage that is no longer pointed to by any variable and therefore can no longer be accessed.

          

  3. set differencethe amount of space on the runtime stack required for execution of a program.

          

  4. interior nodegiven two sets, the intersection is the set of elements that are members of both sets.

          

  5. goalan item (or description of items) being sought in a search.

          

Create Set