Two question I missed on a recent exam. I disagree with what my teacher says is the correct answer. What do you guys think? 7. (10 pts) In algorithm analysis it is important to establish: a) an exact formula for time requirement as a function of problem size. b) a measure of growth of the time requirement as a function of problem size. c) a measure of growth of the time requirement as a function of code size. d) All of the above. e) Just a) and c) Correct answer = b My answer = a My argument: The exact formula is a measure. And if we are arguing importance, the exact formula is needed to come up with the measure, presumably the Big O, of the algorithm. 13. (10 pts) Traversing and printing data in a linked list involves N + 1 assignments and N print operations. Thus the algorithm is of order O(f(n)) where f(n) is a) N + 1. b) 2*N +1. c) N. d) All of the above. e) None of the above. Correct answer = d My answer = c My argument: First, Big O only cares about the most significant term of the function. Second, if 2*N + 1 is the exact formula and N is the most significant term (both answers being at least somewhat correct in that respect), how is N + 1 correct since it is only a piece of the function?