NAME

Question types


Start with


Question limit

of 105 available terms

Print test

5 Written questions

5 Matching questions

  1. What is the Big O of accessing some element in the middle of an ArrayList?
  2. What does it mean for a function to be intractable?
  3. To compare against null, what should be used?
  4. How can you find the Big O of an if statement?
  5. What does it mean to divide and conquer?
  1. a It can only be computed when n is relatively small (for example, if the function is exponential)
  2. b The max of the Big O of the test, then statement, and else statement
  3. c To break down a large problem into two smaller problems, until the problem becomes easy
  4. d O(1)
  5. e == or !=

5 Multiple choice questions

  1. First can be any Object type, while rest is a Cons or null
  2. A linked list links new elements onto the front of the list.
  3. Slowly. log(1000) = 10, log(1,000,000) = 20, log(1,000,000,000) = 30.
  4. It provides a simple lookup tool to find information in a linked list. (assoc 'b '((a 1) (b 2) (c 3))) = (b 2)
  5. It tests whether a given item is an element of a list. It returns the remainder of the list beginning with the desired element

5 True/False questions

  1. What are the advantages of LinkedList?Something as simple as a number, or a pointer to another linked list

          

  2. What is the term for items being removed from the front of a queue?dequeued

          

  3. What is the output:

    (member 'dick '(tom dick harry))
    (dick harry)

          

  4. What are the different representations of trees that we are concerned with for Novak's class?O(N)

          

  5. What does a sentinel node hold or reference?nothing; a sentinel is an extra node, usually at the front or end, that simplifies coding.