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. What is the best way to remember how to draw a FC/NS Tree?
  2. An int is how many bits?
  3. What does the function nreverse do?
  4. What are the different representations of trees that we are concerned with for Novak's class?
  5. Determine the Big O of the following code:

    for ( i = 0; i < n; i++)
    {
    for (j = 0; j < n; j++)
    {
    sum += a[i][j];
    }
    }
  1. a 32
  2. b The right hand nodes all fall down
  3. c O(n²)
  4. d Binary trees, First-Child/Next-sibling, Linked lists, Implicit
  5. e It reverses a list in place by turning the pointers around.

5 Multiple Choice Questions

  1. Replaces the element at the specified position in this list with the specified element.
  2. Something as simple as a number, or a pointer to another linked list
  3. O(N)
  4. null
  5. O(n³)

5 True/False Questions

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

          

  2. What is a pointer (aka reference)?The memory address of the beginning of a record, or block of storage

          

  3. What is the Big O of accessing some element in the middle of a LinkedList?O(N)

          

  4. What is a tree?The function that constructs a pair of pointers

          

  5. What is the term for items being removed from the front of a queue?The right hand nodes all fall down

          

Create Set