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. random access
  2. first-child/next-sibling
  3. recursion
  4. descendants
  5. root
  1. a the top node of a tree, from which all other nodes can be reached.
  2. b describes a data structure or device in which all accesses have the same cost, O(1).
  3. c a case where a program calls itself.
  4. d all nodes below a given node in a tree.
  5. e a way of implementing trees that uses two pointers per node but can represent an arbitrary number of children of a node.

5 Multiple choice questions

  1. a case where two data structures share some elements.
  2. an abstract computer that is simulated by an interpreter program running on an actual computer.
  3. 1. 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.
  4. a condition of the input data where the data will be handled by call(s) to the same program.
  5. the next element in a linked list.

5 True/False questions

  1. sentinela process that removes unwanted elements from a collection.

          

  2. sortan element of a linked list, tree, or graph, often represented by a data structure.

          

  3. constructivedescribes a function that makes a new data structure but does not modify its arguments.

          

  4. null dereferencegiven two sets, the set difference is the set of elements of the first set that are not members of the second set.

          

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

          

Create Set