NAME

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. What is a fair data structure?
  3. What is a Cons?
  4. What does it mean for a function to be intractable?
  5. What is a runtime stack?
  1. a a stack that keeps a fresh set of values for each variable in a stack frame
  2. b The function that constructs a pair of pointers
  3. c O(n²)
  4. d It can only be computed when n is relatively small (for example, exponential)
  5. e An entry in a queue will eventually get serviced and removed so a queue is fair

5 Multiple Choice Questions

  1. It provides a simple lookup tool to find information in a linked list
  2. In a tree, it is a node that points to a given node
  3. getFirst, addFirst, removeFirst, getLast, addLast, removeLast are all O(1)
  4. 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. Down arrows represent the first child, while side arrows represent the next sibling

5 True/False Questions

  1. An int is how many bits?32

          

  2. What is the Big O of inserting at the front of a LinkedList?O(N)

          

  3. How many children can a node have?Any number

          

  4. What is sometimes called a boxed integer?A function that creates a list but modifies the original list's arguments

          

  5. What is a linked list?A data structure where each element has two fields: a link and contents

          

Create Set