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. How does the constructing of a linked list work?
  2. What is a fair data structure?
  3. What should be used to test the equality of the contents or value of a reference type?
  4. What does it mean to divide and conquer?
  5. What does it mean for something to be random access?
  1. a To break down a large problem into two smaller problems, until the problem becomes easy
  2. b .equals()
  3. c A linked list links new elements onto the front of the list.
  4. d Access to any element has the same cost, O(1); (for example, arrays)
  5. e An entry in a queue will eventually get serviced and removed so a queue is fair

5 Multiple choice questions

  1. Integer in Java, a record that has a class, has methods, can be pointed to and used in other structures.
  2. O(N). Much, much better.
  3. O(N)
  4. The loop count times the Big O of the contents
  5. add and remove are O(N) for random positions, contains is O(N)

5 True/False questions

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

          

  2. What is the Big O of inserting at the front of an array or an ArrayList?dequeued

          

  3. What is a root?The uppermost tree node that has no incoming links

          

  4. What does depth-first search do?It searches children of a node before siblings are considered (through recursion)

          

  5. What is the Big O of a matrix multiply?O(n³)