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 is a doubly linked list?
  2. For reference types, what do == and != test?
  3. Which function will produce a linear plot on semi-log paper?
  4. What does the function merge do?
  5. O(log(n)) is better than which function?
  1. a It has pointers that point both forward and backward
  2. b It combines two sorted lists into one sorted list. Duplicated elements are retained.
  3. c O(N). Much, much better.
  4. d The equality of pointer values (i.e. do they have the exact same data address in memory?)
  5. e Exponential

5 Multiple choice questions

  1. add and remove are O(N) for random positions, contains is O(N)
  2. O( n*log(n) )
  3. O(N)
  4. Simple inputs for which the answer is obvious and can be determined immediately.
  5. A linked list links new elements onto the front of the list.

5 True/False questions

  1. What does the function assoc do?It combines two sorted lists into one sorted list. Duplicated elements are retained.

          

  2. In a Cons list, first and rest have different types. What are they?The max of the Big O of the test, then statement, and else statement

          

  3. What does depth-first search do?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

          

  4. 10 bits is equal to about how many decimal digits?9

          

  5. An int is how many bits?32