NAME

Question types


Start with


Question limit

of 105 available terms

Print test

5 Written questions

5 Matching questions

  1. O(log(n)) is better than which function?
  2. What does the function nconc do?
  3. How can you find the Big O of a loop?
  4. What is the output:

    (member 'dick '(tom dick harry))
  5. What does the function append() do to a linked list?
  1. a It concatenates two lists to form a single list; it does so by modifying the end of the first list to point to the second list
  2. b The loop count times the Big O of the contents
  3. c O(N). Much, much better.
  4. d (dick harry)
  5. e It concatenates two lists to form a single list.
    (append '(a b c) '(d e)) = (a b c d e)

5 Multiple choice questions

  1. == or !=
  2. The last link points back to the front of the list rather than to null or nil
  3. 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)
  4. a stack that keeps a fresh set of values for each variable in a stack frame
  5. A simple item such as a number or string or a balanced pair of parentheses and everything inside of them.

5 True/False questions

  1. What is a doubly linked list?A tree in which each node has at most two children

          

  2. What are the advantages to ArrayList?get and set are O(1), and add and remove at the end are O(1) so it makes a good stack

          

  3. What is well-founded ordering?ordering that can guarantee to terminate (go down to zero)

          

  4. How many links does a node that isn't the root have coming into it?O(1)

          

  5. What is a reference?A kind of graph composed of nodes and links. It has one root node. Each node except the root has exactly one parent. All nodes are reachable from the root.