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. goal
  2. operator
  3. search
  4. stack frame
  5. boxed number
  1. a to look through a data structure until a goal object is found.
  2. b an item (or description of items) being sought in a search.
  3. c a section of the runtime stack holding the values of all variables for one invocation of a procedure.
  4. d a number that is defined as an object, so that it has a runtime type and methods that can be used, e.g. Integer in Java.
  5. e in a search tree, a program that changes a state into a child state, e.g. a move in a game.

5 Multiple choice questions

  1. 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. in object-oriented programming, a description of a set of similar objects.
  3. a classification of objects into a tree structure that groups related objects.
  4. the next element in a linked list.
  5. 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.

5 True/False questions

  1. 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.

          

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

          

  3. well-founded orderinga case where two data structures share some elements.

          

  4. binary search tree (BST)...

          

  5. LIFOa pointer to the next element in a linked list.