Question Types

Start With

Question Limit

of 105 available terms
(1 exact duplicate found)

Advertisement Upgrade to remove ads

5 Written Questions

5 Matching Questions

  1. Determine the Big O of the following code:

    for ( i = 0; i < n; i++)
    for (j = 0; j < n; j++)
    sum += a[i][j];
  2. 32-bits can represent about how many decimal digits?
  3. What will a filter function do?
  4. What is a binary tree?
  5. What are the disadvantages of LinkedList?
  1. a get, set, and remove are O(N)
  2. b Filter removes items from a Collection if they meet a certain condition
  3. c O(n²)
  4. d 9
  5. e A tree in which each node has at most two children

5 Multiple Choice Questions

  1. Polynomial
  2. It combines two sorted lists into one sorted list
  3. An entry in a queue will eventually get serviced and removed so a queue is fair
  4. The item being sought in a search
  5. O(1)

5 True/False Questions

  1. What is the term for items being inserted at the end of a queue?O(1)


  2. When the ratio of times as the size of input is doubled is about 8, what is the Big O?O(n³)


  3. When the ratio of times as the size of input is doubled is about 4, what is the Big O?O(n²)


  4. What is a circularly linked list?The last link points back to the front of the list rather than to null or nil


  5. What does a sentinel node hold or reference?nothing


Create Set