1. Turn our bisection function into a complete program. Your program should solve the equation


    Your program should prompt the user for values for neg and pos. It should refuse to compute the root until valid values are entered.

  2. Compare the following versions of the ``summation'' program:

    Use each of these programs to compute the sum for n = one million. Carefully explain why the differences in the answers arise. Which one do you think is correct? Why?

Joseph L. Zachary
Hamlet Project
Department of Computer Science
University of Utah