Exam 2 Answers

• Questions 1-4 The correct answer should be circled on your graded exam
• Question 5a

  size_t polynomial::get_degree()
  {
    size_t i;
  
    for (i=capacity-1; i>0; i--)
         if (data[i] != 0.0)
             return i;
    return 0;
  }
  

• Question 5b Your picture should show the "data" pointers for both polyA and polyB pointing to an array that looks like this:

   *******
   |  0  | [4]
   *******
   |  0  | [3]
   *******
   |  5  | [2]
   *******
   |  9  | [1]
   *******
   |  0  | [0]
   *******
  

  The "capacity" data members for both polynomials should contain the value 5.
• Question 6a

  size_t count_X(node *head_pointer, int X)
  {
     node *p;
     size_t count = 0;
  
     for (p=head_ptr; p!= NULL; p = p->link())
          if (p->data() == X)
              count++;
  
     return count;
  }
  

• Question 6b

  
  size_t count_X( node *head_ptr, int X)
  {
    if (head_ptr == NULL)
        return 0;
    else if (head_ptr->data() == X)
        return 1 + count_X(head_ptr->link(), X);
    else
        return count_X(head_ptr->link(), X);
  }
  

• Question 7

  x = 4 y = 9
  x = 3 y = 3
  3
  2
  13
  4
  7
  

• Question 8

  These functions are O(1): constructor, push, pop, top, empty

  These finctions are O(n): copy constructor, destructor, operator =, size