Skip to content
Related Articles

Related Articles

Aptitude | GATE CS 1998 | Question 3

View Discussion
Improve Article
Save Article
  • Last Updated : 08 Sep, 2021

Which of the following statements applies to the bisection method used for finding roots of functions:
(A) converges within a few iteration
(B) guaranteed to work for all continuous functions
(C) is faster than the Newton-Raphson method
(D) requires that there be no error in determining the sign of the function

Answer: (B)

Explanation: This method is guaranteed to convert to the root off if f is a continuous function in space [a, b] and f (a) and f (b) have opposing symbols. The total error is limited to half of each step so that the path is changed sequentially, which is relatively slow.


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!