NAME

Question types


Start with


Question limit

of 105 available terms

Advertisement Upgrade to remove ads
Print test

5 Written questions

5 Matching questions

  1. What does a sentinel node hold or reference?
  2. What is a binary tree?
  3. How many links does a node that isn't the root have coming into it?
  4. What are the two fields of a cons cell called?
  5. What is well-founded ordering?
  1. a car and cdr (original names), or first and rest.
  2. b A tree in which each node has at most two children
  3. c Exactly one
  4. d nothing; a sentinel is an extra node, usually at the front or end, that simplifies coding.
  5. e ordering that can guarantee to terminate (go down to zero)

5 Multiple choice questions

  1. Integer myInteger = Integer.valueOf(myInt);
    Integer myInteger = myInt; // autoboxing
  2. getFirst, addFirst, removeFirst, getLast, addLast, removeLast are all O(1)
  3. O(1)
  4. add and remove are O(N) for random positions, contains is O(N)
  5. Simple inputs for which the answer is obvious and can be determined immediately.

5 True/False questions

  1. What is a Cons?A pointer to the next element

          

  2. What does the function nconc do?It returns the set of elements that are members of either set (basically all elements with no duplicates).
    (union '(i c e) '(c r e a m)) = (i c r e a m)

          

  3. What is the term for items being inserted at the end of a queue?dequeued

          

  4. Since log(n) grows at the rate it does, what number can it be compared to?1

          

  5. What is the best way to remember how to draw a FC/NS Tree?O(log(N))

          

Create Set