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. gedanken
  2. first-child/next-sibling
  3. filter
  4. recursive case
  5. search
  1. a to look through a data structure until a goal object is found.
  2. b a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.
  3. c a condition of the input data where the data will be handled by call(s) to the same program.
  4. d a process that removes unwanted elements from a collection.
  5. e describes a thought experiment or view of an entity.

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. given two sets, the set difference is the set of elements of the first set that are not members of the second set.
  3. 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.
  4. in object-oriented programming, a description of a set of similar objects.
  5. in a tree, the union of a node's parent and the parent's ancestors.

5 True/False questions

  1. preorderan order of processing a tree in which the parent node is processed before its children.

          

  2. childin a tree, a node pointed to by a parent node.

          

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

          

  4. parentto modify the order of a set of elements so that a desired ordering holds between them, e.g. alphabetic order.

          

  5. interpretergiven two sets, the intersection is the set of elements that are members of both sets.