Q1. The bisection method is used to find
a. Derivative of a function at a given point
b. Numerical integration of a function within a range
c. The root of the function
d. None of the above
Q2. In ________ the search starts at the beginning of the list and checks every element in the list.
a. Linear search
b. Binary search
c. Hash search.
d. Binary tree search
Q3. What is the advantage of a recursive approach over an iterative approach?
a. Consumes less memory
b. Less code and easy to implement
c. Consumes more memory
d. More code has to be written