Which of the following statements applies to the bisection method used for finding roots of functions:
converges within a few iterations
guaranteed to work for all continuous functions
is faster than the Newton-Raphson method
requires that there be no error in determining the sign of the function
The answer is B.
The method is guaranteed to converge to a root of $f$ if $f$ is a continuous function on the interval $[a, b]$ and $f(a)$ and $f(b)$ have opposite signs. The absolute error is halved at each step so the method converges linearly, which is comparatively slow.