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. O(log(n)) is better than which function?
  2. Describe how log(n) grows.
  3. What does the function merge do?
  4. Which function will produce a linear plot on semi-log paper?
  5. What is random access?
  1. a Exponential
  2. b O(N). Much, much better.
  3. c It combines two sorted lists into one sorted list. Duplicated elements are retained.
  4. d describes a data structure in which all accesses have the same costs, O(1). e.g. an array.
  5. e Slowly. log(1000) = 10, log(1,000,000) = 20, log(1,000,000,000) = 30.

5 Multiple choice questions

  1. 9
  2. The same list structure is part of more than one list.
  3. A linked list links new elements onto the front of the list.
  4. 64 bits, or about 19 decimal digits.
  5. O(n²)

5 True/False questions

  1. What is the goal?The function that constructs a pair containing two pointers

          

  2. What is sometimes called a boxed integer?Something as simple as a number, or a pointer to another linked list

          

  3. How big is a pointer?64 bits on modern machines.

          

  4. Since log(n) grows at the rate it does, what number can it be compared to?First can be any Object type, while rest is a Cons or null

          

  5. What is the Big O of quicksort?O(n*log(N)), but could be O(n²) in the worst case.

          

Create Set