Ameee Que

Using Bisection method find the root of cos(x) – x * e x
= 0 with a = 0 and b = 1.
a) 0.617
b) 0.527
c) 0.517
d) 0.717
Explanation: Iteration table is given as follows

No. a b c f(a)*f(c)
1 0 1 0.5 0.053
2 0.5 1 0.75 -0.046
3 0.5 0.75 0.625 -0.357
4 0.5 0.625 0.562 -7.52*10-3
5 0.5 0.562 0.531 -2.168*10-3
6 0.5 0.531 0.516 3.648*10-4
7 0.516 0.531 0.524 -9.371*10-5
8 0.516 0.524 0.520 -3.649*10-5
9 0.516 0.520 0.518 -3.941*10-6
10 0.516 0.516 0.517 1.229*10-5

The difference between final values is less than 0.01 hence we stop the iterations.
So one of the roots of cos(x) – x * exp(x) = 0 is approximately 0.517
. Find the root of x4-x-10 = 0 approximately upto 5 iterations using Bisection Method.
Leta=1.5andb=2.
a)1.68
b)1.86
c)1.88
d) 1.66
No. a b c f(a)*f(c)
1 1.5 2 1.75 15.264(+ve)
2 1.75 2 1.875 2.419(+ve)
3 1.75 1.875 1.812 2.419(+ve)

4 1.812 1.875 1.844 -0.303(-ve)
5 1.844 1.875 1.86 -0.027(-ve)
We stop iterations after 5 and thus obtain the approximated value of x. So one of
the roots of x4-x-10 = 0 is approximately 1.86.
If a function is real and continuous in the region from a to b and f(a) and f(b) have
opposite signs then there is no real root between a and b.
a)True
b) False
If a function is real and continuous in the region from a to b and f(a) and f(b) and if
both have different signs then there is at least one real root between a and b. This is
because the function has to cross the x-axis at least once.
4. A function is given by x – e -x = 0. Find the root between a = 0 and b = 1 by using

Bisectionmethod.
a)0.655
b)0.665
c)0.5650
d) 0.656
No. a b c f(a)*f(c)
1 0 1 0.5 0.107
2 0.5 1 0.75 -0.03
3 0.5 0.75 0.625 -0.00956
4 0.5 0.625 0.562 0.0007758
5 0.562 0.625 0.593 -0.0003317
6 0.562 0.593 0.577 -0.0001307
7 0.562 0.577 0.569 -0.00002978
8 0.562 0.569 0.565 0.00002078

The difference between the final iterating values is less than 0.01. So one of the root
of x – e-x = 0 is approximately 0.565.
A function f(x) is given as e -x * (x2+5x+2) + 1 = 0. Let a = 0 and b = -1. Find the root
between a and b using Bisection Method.
a)-0.557
b)-0.575
c)-0.775
d) -0.0577
No. a B c f(a)*f(c)
1 0 -1 -0.5 1.763(+ve)
2 -0.5 -1 -0.75 -0.89(-ve)
3 -0.5 -0.75 -0.625 -0.219(-ve)
4 -0.5 -0.625 -0.562 0.076(+ve)
5 -0.562 -0.625 -0.593 -0.015(-ve)
6 -0.562 -0.593 -0.577 1.733*10-3(+ve)

The difference between the final iterating values is less than 0.01. So one of the
roots of e-x * (x2-5x+2) + 1 = 0 is approximately -0.577.
6. Use Bisection Method to find out the root of x – sinx – 0.5 = 0 between 1 and 2.
a)1.497
b)1.947
c)1.479
d) 1.974
No. a b c f(a)*f(b)
1 1 2 1.5 -8.554*10-4(-)
2 1 1.5 1.25 0.068(+)
3 1.25 1.5 1.375 0.021(+)
4 1.375 1.5 1.437 5.679*10-3(+)
5 1.437 1.5 1.469 1.42*10-3(+)
6 1.469 1.5 1.485 3.042*10-4(+)
7 1.485 1.5 1.493 5.023*10-5(+)
8 1.493 1.5 1.497 2.947*10-6(+)

Since the difference between b and c is less than 0.01 we stop the iterations. So one
of the roots of x-sinx – 0.5 = 0 is approximately 1.497.
7. Find the approximated value of x till 4 iterations for e -x = 3 log(x) using Bisection
Method.
a)1.197
b)1.187
c)1.167
d) 1.176
No. a b c f(a)*f(b)
1 0.5 1.5 1 0.555(+ve)
2 1 1.5 1.25 -1.555*10-3(-ve)
3 1 1.25 1.125 0.063(+ve)
4 1.125 1.25 1.187 0.014(+ve)

Hence we stop the iterations after 4. Therefore the approximated value of x is 1.187.
Find a root of f (x) = 3x + sin(x) – e x = 0. Use 6 iterations to find the approximate
value of x.
a) 0.3605
b) 0.3650
c) 0.3615
d) 0.3655
View Answer
Answer: a
Explanation: The iteration table is given as follows:
No. a b c f(a)*f(b)
1 0 0.5 0.25 0.287(+ve)
2 0.25 0.5 0.393 -0.015(-ve)
3 0.65 0.393 0.34 9.69(+ve)
4 0.34 0.393 0.367 -7.81(-ve)
5 0.34 0.367 0.354 8.9(+ve)
6 0.354 0.367 0.3605 -3.1(-ve)

We have to find the value of x approximated to 6 iterations. So one of the roots of
3x + sin(x) – ex = 0 is approximately 0.3605.
A function is defined as f(x) = x 2 – 3. Between the interval [1,2] find the root of the
function by Bisection Method.
a) 1.7334
b) 1.7364
c) 1.7354
d) 1.7344
View Answer
Answer: d
Explanation: f(x) = x2 – 3.
a b f(a) f(b) c = (a+b)/2 f(c) Substitution n
1 2 -2 1 1.5 -0.75 a=c 0
1.5 2 -0.75 1 1.75 0.062 b=c 0
1.5 1.75 -0.75 0.0625 1.625 -0.359 a=c 0
1.625 1.75 -0.75 0.0625 1.6875 -0.1523 a=c 0
1.625 1.75 -0.3594 0.0625 1.6875 -0.1523 a=c 0
1.6875 1.75 -0.1523 0.0625 1.7188 -0.0457 a=c 0
1.7188 1.75 -0.0457 0.0625 1.7344 0.0081 b=c 0
1.7266 1.7344 -0.0457 0.0081 1.7266 -0.0189 a=c 0

Thus, with the seventh iteration, we note that the final interval, [1.7266, 1.7344], has
a width less than 0.01 and |f(1.7344)| < 0.01. Hence we chose b = 1.7344 to be our
approximation of the root
The Bisection method is also known as ___________________

a) Binary Chopping
b) Quaternary Chopping
c) Tri region Chopping
d) Hex region Chopping
View Answer
Answer: a
Explanation: Bisection Method is also called as Binary Chopping. It is a method
involving the division of the interval into half.
Using Bisection method find the root of 3x 2 = 5x+2 in the interval [0,3].
a) 0.617
b) 0.527
c) 0.517
d) 0.717
Explanation: Function f(x) = 3x2 – 5x – 2 = 0. The Iteration table is given as follows

No. a b c f(a)*f(c)
1 0 3 2.25 Positive
2 1.5 3 2.25 Negative
3 1.5 2.25 1.875 Positive
4 1.875 2.25 2.0625 Negative
5 1.875 2.0625 1.96875 Positive
6 1.96875 2.0625 2.015625 Negative
7 1.96875 2.015625 1.9921875 Positive
8 1.9921875 2.015625 2.00390625 Negative
9 1.9921875 2.00390625 1.99806875 Positive
10 1.998046875 2.00390625 2.000976563 Negative

The difference between final values is less than 0.01 hence we stop the iterations.
So one of the roots of f(x) = 3x2 – 5x-2 = 0 is approximately 2.000976563.
2. Find the root of xe -x -0.3 = 0 using Bisection Method in the interval [1,5].
a) 1.68
b) 1.86
c) 1.88
d) 1.66
View Answer
Answer: b
Explanation: Iteration table is given as follows:
No. a b c f(a)*f(c)
1 1.0 5.0 3.0 (-)
2 1.0 3.0 2.0 (-)
3 1.0 2.0 1.5 (+)
4 1.5 2.0 1.75 (+)
5 1.75 2.0 1.875 (-)

6 1.75 1.875 1.8125 (-)
7 1.75 1.8125 1.78125 (+)
8 1.78125 1.8125 1.796875 (-)
9 1.78125 1.796875 1.7890625 (-)
After 9 iterations the difference between the last 2 values is less than 0.01. Thus the
approximated value of x is 1.7890625.
3. If a function is defined at 2 points 3 and 7 as f(3)=8 and f(7)=12, it is sufficient to

find the roots through Bisection Method.
a) True
b) False
View Answer
Answer: b
Explanation: If a function is real and continuous in the region from a to b and f(a)
and f(b) and if both have different signs then there is at least one real root between
a and b. This is because the function has to cross the x-axis at least once. The given
values are both positive so it is insufficient to find out the roots through Bisection
method.
The function on which we use the bisection method is not necessary to be

continuous on the interval we choose.
a) True
b) False
View Answer
Answer: b
Explanation: The Bisection Method states that function under Bisection Method
must be continuous on the interval on which the Bisection Method is applied.
Moreover the function has to be a real valued to be able to find the roots by
Bisection Method.
If it is provided that f(3) = 4 is one of the initial points. What can be the choice of
second point for solving by Bisection Method?
a) -5 such that f(-5) = -26
b) 0 such that f(0) = 5
c) -3 such that f(-3) = -2
d) 13 such that f(13) = 2
View Answer
Answer: c
Explanation: The Bisection Method involves the procedure of solving a numerical
through a bracketing method. This involves defining 2 points where a bracket is
small enough and such that f(x) crosses the x-axis at least once in that interval.
Hence option -3 such that f(-3) = -2 is more convenient.
What is the percentage decrease in an interval containing root after iteration is

applied by Bisection Method?
a) 20%
b) 30%
c) 40%
d) 50%
View Answer
Answer: d
Explanation: The Bisection Method employs the reduction of any interval by 50%
after each iteration. Hence it is also called as Binary Reduction method
Find the approximated value of x till 6 iterations for x3-4x+9=0 using Bisection
Method. Take a = -3 and b = -2.
a) -2.703125
b) -1.903125
c) -3.903125
d) -0.703125
View Answer
Answer: a
Explanation: Iteration table is given as follows:
No. a b c f(a)*f(c)
1 -3.0 -2.0 -2.5 (-)
2 -3.0 -2.5 -2.75 (-)
3 -2.75 -2.5 -2.625 (-)
4 -2.75 -2.625 -2.6875 (-)
5 -2.75 -2.6875 -2.71875 (+)
6 -2.71875 -2.6875 -2.703125 (-)

Hence we stop the iterations after 6. Therefore the approximated value of x is
-2.703125.
8. The algorithm provided to find the roots of the function using Bisection Method is
given by ____________
a) Bolzano’s theorem
b) Mean Value theorem
c) Bisection theorem
d) Secant theorem
View Answer
Answer: a
Explanation: The Bolzano’s theorem states that if a function is real and continuous
in the region from a to b and f(a) and f(b) and if both have different signs then there
is at least one real root between a and b. This principle or algorithm is used to find
the roots of function using Bisection Method.
A function is defined as f(x) = x 3 – x – 11 = 0. Between the interval [2,3] find the root
of the function by Bisection Method upto 8 iteration?
a) 1.7334
b) 1.7364
c) 1.7354
d) 1.7344
View Answer
Answer: d
Explanation: The Iteration Table is given as follows
No. a b c f(a)*f(c)
1 2.0 3.0 2.5 (-)
2 2.0 2.5 2.25 (+)
3 2.25 2.5 2.375 (+)
4 2.375 2.5 2.4375 (-)
5 2.375 2.4375 2.40625 (-)
6 2.375 2.40625 2.390625 (-)
7 2.375 2.390625 2.3828125 (-)
8 2.375 2.3828125 2.37890625 (-)

Thus, with the 9th iteration, we note that the final value. Hence 2.37890625 is our
approximation of the root.
10. The Bisection method has which of the following convergences?

a) Linear
b) Quadratic
c) Cubic
d) Quaternary
View Answer
Answer: a
Explanation: Bisection Method has a linear convergence. It is generally ½ for most
functions.
. The formula used for solving the equation using Regula Falsi method is x = bf(a)
−af(b)f(a)−f(b).
a) True
b) False
View Answer
Answer: a
Explanation: Let there be two point a and b between which the root lies.
The slope can be written as
y−f(a)x−a=f(a)−f(b)a−b
let y = f(x) = 0
−f(a)x−a=f(a)−f(b)a−b
Therefore,
x = bf(a)−af(b)f(a)−f(b).
2. Find the positive root of the equation 3x-cosx-1 using Regula Falsi method and
correct upto 4 decimal places.
a) 0.6701
b) 0.5071
c) 0.6071
d) 0.5701
View Answer
Answer: c
Explanation: f(0) = -2
f(1) = 1.459697694
Therefore the root lies between 0 and 1 and
a = 0; f(a) = -2
b = 1; f(b) = 1.459697694
Substituting the values in the formula,
x = bf(a)−af(b)f(a)−f(b),
we get x1=−2−0−2−1.459697694=0.57808519; f(x1) = -0.103254906
Therefore, x1 becomes a to find the next point.
X2=−0.103254906−(0.57808519)(1.459697694)−0.103254906−1.459697694= 0.604952253; f(x2) =
-7.67249301*10-3
X3=(−7.67249301∗10−3−(0.604952253)(1.459697694)(−7.67249301∗10−3)−1.459697694 =
0.607017853; f(x3) = -2.991836798*10-4
X4=(−2.991836798∗10−4)−(0.607017853)(1.459697694)(−2.991836798∗10−4)−1.459697694 =0.6070
98383; f(x4) = -1.165728726*10-5
X5=(−1.165728726∗10−5)−(0.607098383)1.459697694(−1.165728726∗10−5)−1.459697694=0.607101
52; f(x5) = -4.54801046*10-7
Therefore x5 becomes a to find the next point.
X6=(−4.54801046∗10−7)−(0.60710152)(1.459697694)(−4.54801046∗10−7)−1.459697694]=
0.607101642
Therefore, the positive root corrected to 4 decimal places is 0.6071.
3. Find the positive root of the equation x 3 + 2x2 + 10x – 20 using Regula Falsi method
and correct upto 4 decimal places.
a) 1.3688
b) 1.3866
c) 1.4688
d) 1.6488
View Answer
Answer: a
f(2) = 16
Therefore, root lies between 1 and 2
a = 1; f(a) = -7
b = 2; f(b) = 16
we get x1=2(−7)−16−7−16=1.304347826; f(x1) = -1.334757952
X2=2(−1.334757952)−(1.304347826)16−1.334757952−16= 1.357912305; f(x2) = -0.229135731
X3=2(−0.229135731)−(1.357912305)16−0.229135731−16=1.366977805; f(x3) = -0.038591868
X4=2(−0.038591868)−16(1.366977805)−0.038591868−16=1.368500975; f(x4) =
-6.478731338*10 -3

X5=2(−6.478731338∗10−3)−16(1.368500975)(−6.478731338∗10−3)−16= 1.368756579; f(x5) =
-1.087052822 * 10-3
X6=2(−1.087052822∗10−3)−16(1.368756579)(−1.087052822∗10−3)−16=1.368799463; f(x6) =
-1.823661977*10-4
X7=2(−1.823661977∗10−4)−16(1.368799463)(−1.823661977∗10−4)−16=1.368806657; f(x7) =
-3.0601008*10-5
X8=2(−3.0601008∗10−5)−1.368806657(16)(−3.0601008∗10−5)−16=1.368807864.
4. Find the positive root of the equation 3x+sinx-e x using Regula Falsi method and
a) 0.4604
b) 0.4306
c) 0.3604
d) 0.4304
View Answer
Answer: c
f(1) = 1.123189156
a = 0; f(a) = -1
b = 1; f(b) = 1.123189156
we get x1=−1−1−1.123189156=0.470989594; f(x1) = 0.265158816
Therefore, x1 becomes b to find the next point.
X2=−0.470989594−1−0.265158816=0.372277051; f(x2) = 0.029533668
X3=−0.029533668−0.029533668−1=0.361597743; f(x3) = 2.940998193*10-3
X4=−0.361597743−1−(2.940998193∗10−3)=0.360537403; f(x4) = 2.89448416*10-3
X5=−0.360537403−1−(2.89448416∗10−3)=0.360433076; f(x5) = 2.84536596 * 10 -5
Therefore x5 becomes b to find the next point.
X6=−0.360433076−1−(2.84536596∗10−5)=0.36042282
5. Find the positive root of the equation x-cosx using Regula Falsi method and
correct to 4 decimal places.
a) 0.73908
b) 0.63908
c) 0.74980
d) 0.64908
View Answer
Answer: a
f(1) = 0.459697694
a = 0; f(a) = -1
b = 1; f(b) = 0.459697694
we get x1=−1−1−0.459697694=0.685073357; f(x1) = -0.089299276
X2=−0.089299276−0.685073357(0.459697694)−0.089299276−0.459697694= 0.736298997; f(x2) =
-4.66039555*10-3
X3=−(−4.66039555∗10−3)−0.736298997(0.459697694)
(−4.66039555∗10−3)−0.459697694=0.738945355; f(x3) = -2.339261948*10-4
X4=(−2.339261948∗10−4)−0.738945355(0.459697694)
(−2.339261948∗10−4)−0.459697694=0.73907813; f(x4) = -1.172028721*10-5
X5=−(1.172028721∗10−5)−0.73907813(0.459697694)
(−1.172028721∗10−5)−0.459697694=0.739084782
Therefore, the positive root corrected to 4 decimal places is 0.73908
View Answer
6. Find the positive root of the equation xex-3 using Regula Falsi method and correct
to 4 decimal places.
a) 1.0498
b) 1.4089
c) 2.0489
d) 2.4089
View Answer
Answer: a
Explanation: f(1) = -0.281718171
f(2) = 11.7781122
a = 1; f(a) = -0.281718171
b = 2; f(b) = 11.7781122
we get x1=2(−0.281718171)−11.7781122−0.281718171−11.7781122=1.023360044; f(x1) =
-0.152471518
X2=2(−0.152471518)−1.023360044(11.7781122)−0.152471518−11.7781122=1.03584141; f(x2) =
-0.081541799
X3=2(−0.081541799)−1.03584141(11.7781122)−0.081541799−11.7781122=1.042470543; f(x3) =
-0.043329034
X4=2(−0.043329034)−1.042470543(11.7781122)−0.043329034−11.7781122=1.045980168; f(x4) =
-0.022944949
X5=2(−0.022944949)−1.045980168(11.7781122)−0.022944949−11.7781122=1.047835063; f(x5) =
-0.012128518
X6=2(−0.012128518)−1.047835063(11.7781122)−0.012128518−11.7781122=1.048809506; f(x6) =
-6.43428458*10-3
X7=2(−6.43428458∗10−3)−1.048809506(11.7781122)−(6.43428458∗10−3)−11.7781122=1.04932885;
f(x7) = -3.396085929*10-3
X8=2(−3.396085929∗10−3)−1.04932885(11.7781122)(−3.396085929∗10−3)−11.7781122=
1.049602886; f(x8) = -1.792004364*10-3
X9=2(−1.792004364∗10−3)−1.049602886(11.7781122)
(−1.792004364∗10−3)−11.7781122=1.049773434; f(x9)=-7.933671744 * 10-4
X10=2(−7.933671744∗10−4)−(1.049773434)11.7781122(−7.933671744∗10−4)−11.7781122 =
1.049837436.
Find the positive root of the equation 4x = e x using Regula Falsi method and correct
to 4 decimal places.
a) 0.5374
b) 0.3574
c) 0.3647
d) 0.4673
View Answer
Answer: b
f(1) = 1.281718172
a = 0; f(a) = -1
b = 1; f(b) = 1.281718172
we get x1=−1−1−1.281718172=0.43826622; f(x1) = 0.203047383
X2=0.43826622−1−0.203047383= 0.364296723; f(x2) = 0.017685609
X3=−0.364296723−1−0.017685609=0.357965878; f(x3) = 1.446702162*10-3
X4=−0.357965878−1−(1.446702162∗10−3)=0.357448756; f(x4) = 1.177221*10-4
X5=−0.357448756−1−(1.177221∗10−4)= 0.357406681
Find the positive root of the equation xlogx = 1.2 using Regula Falsi method and
correct to 4 decimal places.
a) 2.7406
b) 2.4760
c) 2.5760
d) 2.4706
View Answer
Answer: a
Explanation: f(2) = -0.597940008
f(3) = 0.231363764
a = 2; f(a) = -0.597940008
b = 3; f(b) = 0.231363764
we get x1=3(−0.597940008)−2(0.231363764)−0.597940008−0.231363764=2.721014456; f(x1) =
-0.017091075
X2=3(−0.017091075)−2.721014456(0.231363764)−0.017091075−0.231363764=2.740205722; f(x2)
= -3.840558354*10-4
X3=3(−3.840558354∗10−4)−2.740205722(0.231363764)
(−3.840558354∗10−4)−0.231363764)=2.740636257; f(x3) = -8.58117537*10-6
X4=3(−8.58117537∗10−6)−(2.740636257)0.231363764(−8.58117537∗10−6)−0.231363764=2.740645
876.
Find the positive root of the equation e-x = sinx using Regula Falsi method and
a) 0.5855
b) 0.6685
c) 0.5885
d) 0.6885
View Answer
Answer: c
Explanation: f(0) = 1
f(1) = -0.473591543
a = 0; f(a) = 1
b = 1; f(b) = -0.473591543
we get x1=11+0.473591543=0.954782316; f(x1) = -0.431292064
X2=0.9547823161+0.4312920640.667077209; f(x2) = -0.105486008
X3=0.6670772091+0.105486008= 0.60342438; f(x3) = -0.020529909
X4=0.603424381+0.020529909=0.591285345; f(x4) = -3.813368755*10-3
X5=0.5912853451+(3.813368755∗10−3)=0.589039121; f(x5) = -7.021514375*10-4
X6=0.5890391211+(7.021514375∗10−4)=0.588625816; f(x6) = -1.29077269*10 -4
X7=0.5886258161+(1.29077269∗10−4)= 0.588549847; f(x7) = -2.372079757*10-5
X8=0.5885498471+(2.372079757∗10−5)=0.588535886.
10. Find the positive root of the equation x 3 + 2x2 + 50x + 7 = 0 using Regula Falsi
method and correct to 4 decimal places.
a) 0.14073652
b) 0.24073652
c) 0.42076352
d) doesn’t have any positive root
View Answer
Answer: d
Explanation: The given equation doesn’t have any positive root as there is no sign
change for any positive integer.
11. Find the positive root of the equation x 3 – 4x – 9 = 0 using Regula Falsi method
and correct to 4 decimal places.
a) 2.6570
b) 2.7605
c) 2.7506
d) 2.7065
View Answer
Answer: d
f(3) = 6
a = 2; f(a) = -9
b = 3; f(b) = 6
x=bf(a)−af(b)f(a)−f(b),
we get x1=3(−9)−2(6)−9−6=2.6; f(x1) = -1.824
X2=3(−1.824)−2.6(6)−1.824−6= 2.693251534; f(x2) = -0.23722651
X3=3(−0.23722651)−2.693251534(6)−0.23722651−6=2.704918397; f(x3) = -0.028912179
X4=3(−0.028912179)−2.704918397(6)−0.028912179−6=2.70633487; f(x4) =
-3.495420729*10 -3

X5=3(−3.495420729∗10−3)−2.70633487(6)(−3.495420729∗10−3)−6=2.706505851; f(x5) =
-3.973272762*10 -4

X6=3(−3.973272762∗10−4)−2.706505851(6)(−3.973272762∗20−4)−6=2.706525285.
12. Find the positive root of the equation x 3 – 4x + 9 = 0 using Regula Falsi method
and correct to 4 decimal places.
a) 3.706698931
b) 2.706698931
c) 3.076698931
d) no positive roots
View Answer
Answer: b
Explanation: The given equation doesn’t have any positive root ass there is no sign
change for any positive values.
13. Find the positive root of the equation e x = 3x using Regula Falsi method and
correct to 4 places.
a) 0.6190
b) 0.7091
c) 0.7901
d) 0.6910
View Answer
Answer: a
Explanation: f(0) = 1
f(1) = -0.281718171
a = 0; f(a) = 1
b = 1; f(b) = -0.281718171
we get x1=11+0.281718171=0.780202717; f(x1) = -0.158693619
X2=0.7802027171+0.158693619=0.673346865; f(x2) = -0.059251749
X3=0.6733468651+0.059251749=0.635681617; f(x3) = -0.018736045
X4=0.6356916171+0.018736045=0.623990502; f(x4) = -5.610588465*10-3
X5=0.6239905021+(5.610588465∗10−3)=0.62050908; f(x5) = -1.652615179*10-3
X6=0.620509081+(1.652615179∗10−3)=0.619485309; f(x6) = -4.844127073*10-4
X7=0.6194853091+(4.844127073∗10−4)= 0.619195367; f(x7) = -1.417874765*10-4
X8=0.6191953671+(1.417874765∗10−4)=0.619097586; f(x8) = -4.14829789*10 -5
Therefre x8 becomes b to find the next point.
X9=0.6190975861+(4.14828789∗10−5)=0.619071905
What is the region of convergence of Secant Method?

a) 1.5
b) 1.26
c) 1.62
d) 1.66
View Answer
Answer: c
Explanation: The region of convergence of Secant Method is 1.62. It converges faster
than Bisection method
Secant Method is also called as?

a) 2-point method
b) 3-point method
c) 4-point method
d) 5-point method
View Answer
Answer: a
Explanation: Secant Method is also called as 2-point method. In Secant Method we
require at least 2 values of approximation to obtain a more accurate value.
Secant method converges faster than Bisection method.

a) True
b) False
View Answer
Answer: a
Explanation: Secant method converges faster than Bisection method. Secant
method has a convergence rate of 1.62 where as Bisection method almost
converges linearly.
4. The iterative formula for a secant method is given as _________

a) x(n+1)=x(n−1)f[x(n)]−x(n)f[x(n−1)][f[x(n)]−f[x(n−1)]]
b) x(n+1)=x(n)f[x(n)]−x(n)f[x(n−1)][f[x(n)]−f[x(n−1)]]
c) x(n+1)=x(n−1)f[x(n)]−x(n−1)f[x(n−1)][f[x(n)]−f[x(n−1)]]
d) x(n+1)=x(n)f[x(n)]−x(n−1)f[x(n−1)][f[x(n)]−f[x(n−1)]]
View Answer
Answer: a
Explanation: The Iterative formula for a Secant Method is given by
x(n+1)=x(n−1)f[x(n)]−x(n)f[x(n−1)][f[x(n)]−f[x(n−1)]]
Since there are 2 points considered in the Secant Method, it is also called 2-point
method.
5. Secant Method is slower than Newton Raphson Method.

a) True
b) False
View Answer
Answer: b
Explanation: Secant Method is faster as compares to Newton Raphson Method.
Secant Method requires only 1 evaluation per iteration whereas Newton Raphson
Method requires 2.
6. The number of iterations in Secant Method are less as compared to Newton

Raphson.
a) True
b) False
View Answer
Answer: a
Explanation: The number of iterations required for Secant Method is less than
Newton Raphson Method. Secant Method requires only 1 evaluation per iteration
whereas Newton Raphson Method requires 2.
7. A quadratic equation x2-4x+4=0 is defined with an initial guess of 3 and 2.5. Find
the approximated value of root using Secant Method.
a) 1.33
b) 2.33
c) 3.33
d) 4.33
View Answer
Answer: b
Explanation: By Secant Method the iterative formula is given as:
For n=1
x(2)=x(0)f[x(1)]−x(1)f[x(0)][f[x(1)]−f[x(0)]]
x(0)=3 and x(1)=2.5, f(x0)=1 and f(x1)=0.25
Hence x2=2.33.
8. A quadratic equation x2-4x+4=0 is defined with an initial guess of 2 and 2.5. Find
the approximated value of root using Secant Method.
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: b
For n=1
x(2)=x(0)f[x(1)]−x(1)f[x(0)][f[x(1)]−f[x(0)]]
x(0)=2 and x(1)=2.5, f(x0)=0 and f(x1)=0.25
Hence x2=2. Hence for x2=2 f(x) converges to exact root.
9. A quadratic equation x2-4x+4=0 is defined with an initial guess of 10 and 20. Find
the approximated value of x2 using Secant Method.
a) 7.538
b) 7.853
c) 7.358
d) 7.835
View Answer
Answer: a
For n=1
x(2)=x(0)f[x(1)]−x(1)f[x(0)][f[x(1)]−f[x(0)]]
x(0)=10 and x(1)=20, f(x0)=0 and f(x1)=0.25
Hence x2 = 7.538.
0. A quadratic equation x4-x-8=0 is defined with an initial guess of 1 and 2. Find the
approximated value of x2 using Secant Method.
a) 7.538
b) 7.853
c) 7.358
d) 1.571
View Answer
Answer: d
For n=1
x(2)=x(0)f[x(1)]−x(1)f[x(0)][f[x(1)]−f[x(0)]]
x(0)=1 and x(1)=2, f(x 0)=-8 and f(x1)=6
Hence x2= 1.571.
1. Rate of convergence of the Newton-Raphson method is generally __________
a) Linear
b) Quadratic
c) Super-linear
d) Cubic
View Answer
Answer: a
Explanation: Rate of convergence of the Newton-Raphson method is generally
Linear. It states that the value of root through the Newton Raphson method
converges slowly.
. The equation f(x) is given as x3 – x2 + 4x – 4 = 0. Considering the initial

approximation at x=2 then the value of next approximation correct upto 2 decimal
places is given as __________
a) 0.67
b) 1.33
c) 1.00
d) 1.50
View Answer
Answer: b
Explanation: Iterative formula for Newton Raphson method is given by
x(1)=x(0)+f(x(0))f′x(x(0)).
Hence x0=2 (initial guess), f(x0)=8 and f’(x0)=12.
Substituting the values in the equation we get x1=1.33
3. The Newton-Raphson method of finding roots of nonlinear equations falls under

the category of which of the following methods?
a) bracketing
b) open
c) random
d) graphical
View Answer
Answer: b
Explanation: The Newton Raphson method involves the guessing of the root. Hence
it falls under open methods.
. The Iterative formula for Newton Raphson method is given by __________

a) x1 = x0-f(x0)/f’(x0)
b) x0 = x1-f(x0)/f‘(x0)
c) x0 = x1+f(x0)/f’(x0)
d) x1 = x0+f(x0)/f‘(x0)
View Answer
Answer: a
Explanation: The Iterative formula for Newton Raphson method is given by
x(1)=x(0)+f(x(0))f′x(x(0)). It depends on the initial value and converges slowly.
5. If f(x) = x2 – 153 = 0 then the iterative formula for Newton Raphson Method is
given by __________
a) x(n+1) = 0.5 [x(n)+ 153x(n)]
b) x(n+1) = 0.5 [x(n)-153x(n)]
c) x(n+1) = [x(n)+153x(n)]
d) x(n+1) = [x(n)-153x(n)]
View Answer
Answer: a
Explanation: Consider x(n+1)=0.5 [x(n)+ Nx(n)]
Where N=117. Hence x(n+1)=0.5 [x(n)+117x(n)].
6. In Newton Raphson method if the curve f f(x) is constant then __________

a) f’’(x)=0
b) f(x)=0
c) f’(x)=0
d) f’(x)=c
View Answer
Answer: c
Explanation: If the curve f(x) is constant then the slope of the tangent drawn to the
curve at an initial point is zero. Hence the value of f’(x) is zero.
7. For what values of 0 the initial guess will be equal to the next iterative values?
a) 70 degrees
b) 90 degrees
c) 100 degrees
d) 55 degrees
View Answer
Answer: b
Explanation: Iterative formula is given by x(1) = x(0) + f(x(0))f′x(x(0)). For f’(x0) at x=90
degrees approaches ∞. Then for all values of x1=x0. Hence if f(x0) = 0 then the tan0=90
degrees.
8. The equation f(x) is given as x 2-4=0. Considering the initial approximation at x=6
then the value of next approximation correct upto 2 decimal places is given as
__________
a) 3.33
b) 1.33
c) 2.33
d) 4.33
View Answer
Answer: a
x(1)=x(0)+f(x(0))f′x(x(0)).
Substituting the values in the equation we get x1=3.33.
9. At which point the iterations in the Newton Raphson method are stopped?
a) When the consecutive iterative values of x are not equal
b) When the consecutive iterative values of x differ by 2 decimal places
c) When the consecutive iterative values of x differ by 3 decimal places
d) When the consecutive iterative values of x are equal
View Answer
Answer: d
Explanation: When the consecutive values of iterations are equal the iterations of
Newton Raphson method are stopped. This allows maximum accuracy as compared
to other methods.
10. The Newton Raphson method fails if __________

a) f’(x0)=0
b) f’’(x0)=0
c) f(x0)=0
d) f’’’(x0)=0
View Answer
Answer: a
Explanation: When f’(x0) becomes zero then the value of f(x 0)/f’(x0) becomes ∞. Hence
Newton Raphson method fails at f’(x0)=0
1. Rate of convergence of the Newton-Raphson method is generally __________

a) Linear
b) Quadratic
c) Super-linear
d) Cubic
View Answer
Answer: a
Explanation: Rate of convergence of the Newton-Raphson method is generally
Linear. It states that the value of root through the Newton Raphson method
converges slowly.
2. The equation f(x) is given as x3 – x2 + 4x – 4 = 0. Considering the initial

approximation at x=2 then the value of next approximation correct upto 2 decimal
places is given as __________
a) 0.67
b) 1.33
c) 1.00
d) 1.50
View Answer
Answer: b
x(1)=x(0)+f(x(0))f′x(x(0)).
Substituting the values in the equation we get x1=1.33
3. The Newton-Raphson method of finding roots of nonlinear equations falls under

the category of which of the following methods?
a) bracketing
b) open
c) random
d) graphical
View Answer
Answer: b
Explanation: The Newton Raphson method involves the guessing of the root. Hence
it falls under open methods.
4. The Iterative formula for Newton Raphson method is given by __________

a) x1 = x0-f(x0)/f’(x0)
b) x0 = x1-f(x0)/f‘(x0)
c) x0 = x1+f(x0)/f’(x0)
d) x1 = x0+f(x0)/f‘(x0)
View Answer
Answer: a
Explanation: The Iterative formula for Newton Raphson method is given by
x(1)=x(0)+f(x(0))f′x(x(0)). It depends on the initial value and converges slowly.
5. If f(x) = x2 – 153 = 0 then the iterative formula for Newton Raphson Method is
given by __________
a) x(n+1) = 0.5 [x(n)+ 153x(n)]
b) x(n+1) = 0.5 [x(n)-153x(n)]
c) x(n+1) = [x(n)+153x(n)]
d) x(n+1) = [x(n)-153x(n)]
View Answer
Answer: a
Where N=117. Hence x(n+1)=0.5 [x(n)+117x(n)]
6. In Newton Raphson method if the curve f f(x) is constant then __________

a) f’’(x)=0
b) f(x)=0
c) f’(x)=0
d) f’(x)=c
View Answer
Answer: c
Explanation: If the curve f(x) is constant then the slope of the tangent drawn to the
curve at an initial point is zero. Hence the value of f’(x) is zero.
7. For what values of 0 the initial guess will be equal to the next iterative values?
a) 70 degrees
b) 90 degrees
c) 100 degrees
d) 55 degrees
View Answer
Answer: b
Explanation: Iterative formula is given by x(1) = x(0) + f(x(0))f′x(x(0)). For f’(x0) at x=90
degrees approaches ∞. Then for all values of x1=x0. Hence if f(x0) = 0 then the tan0=90
degrees.
then the value of next approximation correct upto 2 decimal places is given as
__________
a) 3.33
b) 1.33
c) 2.33
d) 4.33
View Answer
Answer: a
x(1)=x(0)+f(x(0))f′x(x(0)).
Substituting the values in the equation we get x1=3.33.
9. At which point the iterations in the Newton Raphson method are stopped?
a) When the consecutive iterative values of x are not equal
b) When the consecutive iterative values of x differ by 2 decimal places
c) When the consecutive iterative values of x differ by 3 decimal places
d) When the consecutive iterative values of x are equal
View Answer
Answer: d
Explanation: When the consecutive values of iterations are equal the iterations of
Newton Raphson method are stopped. This allows maximum accuracy as compared
to other methods.
10. The Newton Raphson method fails if __________

a) f’(x0)=0
b) f’’(x0)=0
c) f(x0)=0
d) f’’’(x0)=0
View Answer
Answer: a
Explanation: When f’(x0) becomes zero then the value of f(x 0)/f’(x0) becomes ∞. Hence
Newton Raphson method fails at f’(x0)=0.
1. The value of y’/x’ in terms of the angle 0 is given by _____________

a) tanθ
b) secθ
c) cotθ
d) cosecθ
View Answer
Answer: a
Explanation: The value of derivative of a function f(x) is given as f’(x)=y’/x’. In terms of
theta tangent is the ration of opposite side to adjacent side hence y’/x’=tanθ.
2. The Newton Raphson method is also called as ____________

a) Tangent method
b) Secant method
c) Chord method
d) Diameter method
View Answer
Answer: a
Explanation: Newton Raphson method is also known as Tangent Method. It is
carried out by drawing a tangent to the curve at the point of initial guess.
then the value of x1 is given as ____________
a) 10/3
b) 4/3
c) 7/3
d) 13/3
View Answer
Answer: a
x(1)=x(0)+f(x(0))f′x(x(0)).
Substituting the values in the equation we get x1= 10/3.
4. For decreasing the number of iterations in Newton Raphson method:

a) The value of f’(x) must be increased
b) The value of f’’(x) must be decreased
c) The value of f’(x) must be decreased
d) The value of f’’(x) must be increased
View Answer
Answer: a
Explanation: Iterative formula is given by
x(1)=x(0)+f(x(0))f′x(x(0)).
Hence if f’(x) decreases the value of next iteration approaches the initial one. This
decreases the number of iterations in finding out next iterative value.
5. In Newton Raphson method f’(x) for a given point is given by the formula
____________
a) y/x’
b) y’/x
c) y/x
d) y’/x’
View Answer
Answer: d
Explanation: The derivative of a function f(x) is given as f’(x) = y’/x’. It is defined as the
slope of the tangent drawn at the point of assumed initial value to the curve.
6. If f(x) = x2-117 = 0 then the iterative formula for Newton Raphson Method is given
by ____________
a) x(n+1)=0.25 [x(n)+166x(n)]
b) x(n+1)=0.5 [x(n)+166x(n)]
c) x(n+1)=0.5 [x(n)-166x(n)]
d) x(n+1)=0.25 [x(n)-166x(n)]
View Answer
Answer: b
Where N=117. Hence x(n+1)=0.5 [x(n)+117x(n)].
7. The points where the Newton Raphson method fails are called?
a) floating
b) continuous
c) non-stationary
d) stationary
View Answer
Answer: d
Explanation: The points where the function f(x) approaches infinity are called as
Stationary points. At stationary points Newton Raphson fails and hence it remains
undefined for Stationary points.
8. The convergence of which of the following method depends on initial assumed

value?
a) False position
b) Gauss Seidel method
c) Newton Raphson method
d) Euler method
View Answer
Answer: c
Explanation: The Newton Raphson method the approximation value is found out
by :
x(1)=x(0)+f(x(0))f′x(x(0)). Hence it depends on the initial value x0.
9. The equation f(x) is given as x 3+4x+1=0. Considering the initial approximation at

x=1 then the value of x 1 is given as _______________
a) 1.67
b) 1.87
c) 1.86
d) 1.85
View Answer
Answer: c
x(1)=x(0)+f(x(0))f′x(x(0))
Hence x0=1 (initial guess), f(x0)=6 and f’(x0)= 7.
Substituting the values in the equation we get x1=1.857 which is 1.86 rounded to 2
decimal places.
1. Consider the linear equation Ax b = . Let us express A LDU =+ + , where L is a lower triangular
matrix, D is a diagonal matrix and U is an upper triangular matrix. All diagonal elements of L and U
matrices are zero. Using this definition, we can write: Dx L U x b = −( + + ) . This yields us: ( ) ( ) i i 1 1 (
) x D b L Ux + − = ⎡ ⎤ − + ⎣ ⎦ Which of the following iterative methods does the above expression
represent?
a. Jacobi iteration
b. Gauss-Seidel
c. Successive under-relaxation with ω = 0.5
d. None of the above
2. Rate of convergence of Newton-Raphson method using analytical Jacobian is:
a. Linear
b. Quadratic
c. Super-linear with power of ~1.618
d. Super-linear with power of ~ 2
3. Which of the following methods is least suitable for the following function:
a. Reguli Falsi
b. Secant
c. Fixed Point Iteration
d. Newton-Raphson
4. Which of the statements are false for Thomas Algorithm
a. The computational load increases linearly with number of linear equations
b. It can be used even if some of the off-diagonal elements are zero
c. Partial pivoting may be required for stability
d. Matrix A has to be diagonally dominant to guarantee stability
5. You are given data for variable � at 15 different values of �. Which of the following techniques
will result in a curve that is not guaranteed to pass through all the 15 points in X-Y plane?
a. Cubic spline
b. Newton’s forward difference
c. Linear regression
d. All of the above
1. The Newton-Raphson method of finding roots of nonlinear equations falls under the category of
_____________ methods.
(A) bracketing
(B) open
(C) random
(D) graphical Solution
The correct answer is (B). The Newton-Raphson method is an open method since the guess of the
root that is needed to get the iterative method started is a single point. Other open methods such as
the secant method use two initial guesses of the root but they do not have to bracket the root.
2. The Newton-Raphson method formula for finding the square root of a real number R from the
equation 0 2 x − R = is
, (A) 2 1 i i x x + =
(B) 2 3 1 i i x x + =
(C)         + = + i i i x R x x 2 1 1
(D)         + = − i i i x R x 3x 2 1 1
Solution The correct answer is (C). The Newton-Raphson method formula for solving f(x) = 0 is ( ) ( )
1 i i i i f x f x x x ′ + = − where f x x f x x R ( ) 2 ( ) 2 ′ = = − Thus,         = + = + = − + − + =
−iiiiiiiiiiixRxxRxxxRxxxRxx2122122221
3. The next iterative value of the root of 4 0 2 x − = using the Newton-Raphson method, if the initial
guess is 3, is
(A) 1.5
(B) 2.067
(C) 2.167
(D) 3.000
Solution The correct answer is (C). The estimate of the root is ( ) ( ) 1 i i i i f x f x x x ′ + = − Chose i = 0,
6 2 3 ( ) 2 5 3 4 ( ) 4 3 0 0 2 2 0 0 0 = = × ′ = = = − = − = f x x f x x x Thus, 2.166 6 5 3 ( ) ( ) 0 0 1 0 = = − ′
=−fxfxxx

Ameee Que

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ameee Que

Uploaded by

Copyright:

Available Formats

Using Bisection method find the root of cos(x) – x * e x

Explanation: Iteration table is given as follows

2 0.5 1 0.75 -0.046

3 0.5 0.75 0.625 -0.357

4 0.5 0.625 0.562 -7.52*10-3

5 0.5 0.562 0.531 -2.168*10-3

6 0.5 0.531 0.516 3.648*10-4

7 0.516 0.531 0.524 -9.371*10-5

8 0.516 0.524 0.520 -3.649*10-5

9 0.516 0.520 0.518 -3.941*10-6

10 0.516 0.516 0.517 1.229*10-5

1 1.5 2 1.75 15.264(+ve)

2 1.75 2 1.875 2.419(+ve)

3 1.75 1.875 1.812 2.419(+ve)

5 1.844 1.875 1.86 -0.027(-ve)

4. A function is given by x – e -x = 0. Find the root between a = 0 and b = 1 by using

2 0.5 1 0.75 -0.03

3 0.5 0.75 0.625 -0.00956

4 0.5 0.625 0.562 0.0007758

5 0.562 0.625 0.593 -0.0003317

6 0.562 0.593 0.577 -0.0001307

7 0.562 0.577 0.569 -0.00002978

8 0.562 0.569 0.565 0.00002078

2 -0.5 -1 -0.75 -0.89(-ve)

3 -0.5 -0.75 -0.625 -0.219(-ve)

4 -0.5 -0.625 -0.562 0.076(+ve)

5 -0.562 -0.625 -0.593 -0.015(-ve)

6 -0.562 -0.593 -0.577 1.733*10-3(+ve)

2 1 1.5 1.25 0.068(+)

3 1.25 1.5 1.375 0.021(+)

4 1.375 1.5 1.437 5.679*10-3(+)

5 1.437 1.5 1.469 1.42*10-3(+)

6 1.469 1.5 1.485 3.042*10-4(+)

7 1.485 1.5 1.493 5.023*10-5(+)

8 1.493 1.5 1.497 2.947*10-6(+)

1 0.5 1.5 1 0.555(+ve)

2 1 1.5 1.25 -1.555*10-3(-ve)

3 1 1.25 1.125 0.063(+ve)

4 1.125 1.25 1.187 0.014(+ve)

1 0 0.5 0.25 0.287(+ve)

2 0.25 0.5 0.393 -0.015(-ve)

3 0.65 0.393 0.34 9.69(+ve)

4 0.34 0.393 0.367 -7.81(-ve)

5 0.34 0.367 0.354 8.9(+ve)

6 0.354 0.367 0.3605 -3.1(-ve)

a b f(a) f(b) c = (a+b)/2 f(c) Substitution n

1 2 -2 1 1.5 -0.75 a=c 0

1.5 2 -0.75 1 1.75 0.062 b=c 0

1.5 1.75 -0.75 0.0625 1.625 -0.359 a=c 0

1.625 1.75 -0.75 0.0625 1.6875 -0.1523 a=c 0

1.625 1.75 -0.3594 0.0625 1.6875 -0.1523 a=c 0

1.6875 1.75 -0.1523 0.0625 1.7188 -0.0457 a=c 0

1.7188 1.75 -0.0457 0.0625 1.7344 0.0081 b=c 0

1.7266 1.7344 -0.0457 0.0081 1.7266 -0.0189 a=c 0

The Bisection method is also known as ___________________

Explanation: Function f(x) = 3x2 – 5x – 2 = 0. The Iteration table is given as follows

2 1.5 3 2.25 Negative

3 1.5 2.25 1.875 Positive

4 1.875 2.25 2.0625 Negative

5 1.875 2.0625 1.96875 Positive

6 1.96875 2.0625 2.015625 Negative

7 1.96875 2.015625 1.9921875 Positive

8 1.9921875 2.015625 2.00390625 Negative