NAME

Question types


Start with


Question limit

of 87 available terms

Advertisement
Print test

5 Written questions

5 Matching questions

  1. base case
  2. fair
  3. random access
  4. set difference
  5. leaf
  1. a describes a data structure or device in which all accesses have the same cost, O(1).
  2. b a tree node containing a contents value but with no children.
  3. c a simple case that can be solved easily, without recursion.
  4. d describes a process in which every arriving customer will eventually be served.
  5. e given two sets, the set difference is the set of elements of the first set that are not members of the second set.

5 Multiple choice questions

  1. describes a data structure that cannot be changed once it has been created, such as Integer or String in Java.
  2. (pronounced "ask-key") an abbreviation of American Standard Code for Information Interchange, a character code that maps between 8-bit binary integers and characters such as letters, numbers, and punctuation. There are 256 possible ASCII codes, of which 95 are printable.
  3. in a search tree, the number of children of a given node. Often, the branching factors of individual nodes will vary, so an average value may be used.
  4. a character code that maps between binary numbers and the characters used in most modern languages, more than 110,000 characters. The lowest values of the UTF-8 encoding of Unicode are the same as ASCII, allowing characters to be 8 bits when staying within the ASCII character set. For other languages, more bits are used. Java uses Unicode.
  5. an item (or description of items) being sought in a search.

5 True/False questions

  1. recursive casea condition of the input data where the data will be handled by call(s) to the same program.

          

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

          

  3. divide and conquera problem-solving strategy in which a problem is broken down into sub-problems, until simple subproblems are reached.

          

  4. worda 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.

          

  5. ancestorsin a tree, the union of a node's parent and the parent's ancestors.