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. word
  2. sentinel
  3. backtrack
  4. FIFO
  5. link
  1. a a pointer to the next element in a linked list.
  2. b in a tree search, to move back from the node currently being examined to its parent.
  3. c 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.
  4. d an extra record at the start or end of a data structure such as a linked list, to simplify the processing.
  5. e first-in, first-out: describes the ordering of a queue. A queue is fair.

5 Multiple choice questions

  1. a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.
  2. a variable containing the address of other data.
  3. describes a data structure that cannot be changed once it has been created, such as Integer or String in Java.
  4. a classification of objects into a tree structure that groups related objects.
  5. the number of links between the root of a tree and the leaves.

5 True/False questions

  1. well-founded orderingan ordering that can be guaranteed to terminate, e.g. starting at a positive integer and counting down to 0.

          

  2. doubly linked lista sequence of records, where each record contains a link to the next one.

          

  3. binary search tree (BST)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. DFSdepth-first search.

          

  5. reference typea type in which variables of that type are pointers to objects. In the code Integer i = 3, the variable i holds a pointer to the Integer object that contains the value. In int j = 3, the variable j contains the value. In Java, only reference types have methods.