Manipal University Jaipur

B.Tech. First Year-2023

MA1002-COMPUTATIONAL MATHEMATICS: [2 1 0 3]
Module 3
Numerical Methods III: Solutions of ordinary differential equations (Picard’s Method,
Euler’s and Modified Euler’s Method, Classical Fourth order Runge - Kutta Method).
Multiple Choice Questions
1. Picard’s method is an iterative method to find an approximate solution to an ordinary
differential equation.
a. True
b. False
c. May or may not be true
d. Insufficient information provided
Ans: a

2. Picard’s method is not a successive approximation method i.e. with each successive
approximation, no effect can be seen in the approximate solution obtained from the method.
a. True
b. Fals
c. May or may not be true
d. Insufficient information provided
Ans: b

𝑥 +ℎ
3. The formula for Picard’s method is 𝑦𝑘 = 𝑦0 + ∫𝑥 0 𝑓(𝑥𝑘 , 𝑦𝑘 ) dx, where k is the
0
𝑘 𝑡ℎ number of iteration.
a. True
b. False
c. May or may not be true
d. Insufficient information provided
Ans: b

𝑑𝑦
4. Consider the differential equation 𝑑𝑥 = x with the initial condition y(0) = 1. Take the step size
h = 2. The first approximation of the differential equation using Picard’s method is
a. 1
b. 2
c. 3
d. 4
Ans: c
 𝑑𝑦
5. Consider the differential equation 𝑑𝑥 = 𝑥 2 with the initial condition y(0) = 1 Take the step size
h = 1. The first approximation of the differential equation using Picard’s method is
1
a. 3
2
b. 3
4
c. 3
5
d. 3
Ans: c

6. What is the value of a in the following Picard’s formula? The formula is 𝑦𝑘 = 𝑎 +

𝑥 +ℎ
∫𝑥 0 𝑓(𝑥 , 𝑦) dx, where k is the 𝑘 𝑡ℎ number of iteration.
0
a. 𝑦0
b. 𝑦𝑘
c. 𝑦1
d. None of the above
Ans: a

𝑑𝑦
7. Consider the differential equation 𝑑𝑥 = 5x with the initial condition y(0) = 1. Take the step size
h = 0.5. From the Picard’s method find answer to the first approximation is
1
a. 3
11
b. 8
4
c. 3
13
d. 8
Ans: d

8. The formula for Euler’s method is 𝑦𝑛+1 = 𝑦𝑛 + ℎ 𝑓(𝑥𝑛 , 𝑦𝑛 ) , where n is the 𝑛𝑡ℎ number of
iteration.
a. True
b. False
c. Need more information
d. None of the above
Ans: a

9. Euler’s method is a numerical method used to solve ordinary differential equations.

a. True
b. False
c. Need more information
d. None of the above
Ans: a
10. Euler’s method can be derived from the Taylor’s series method.
a. True
b. False
c. Need more information
d. None of the above
Ans: a

𝑑𝑦
11. Consider the differential equation 𝑑𝑥 = 3𝑥 2 + 1 with the initial condition y(0) = 0. Take the
step size h = 2. The first approximation of the differential equation using Euler’s method is
a. 0
b. 1
c. 2
d. 3
Ans: c

𝑑𝑦
12. Consider the differential equation 𝑑𝑥 = 3x + 1 with the initial condition y(0) = 0. Take the step
size h = 2. The second approximation of the differential equation using Euler’s method is
a. 6
b. 0
c. 2
d. 1
Ans: c

𝑑𝑦
13. Given the ordinary differential equation = 𝑥 2 with initial condition y(0) = 1 and step size h
𝑑𝑥
= 0.1. Find the value of y(0.1) using Euler's method.
a. 0
b. 1
c. -1
d. 3
Ans: b

𝑑𝑦
14. Given the ordinary differential equation 𝑑𝑥 = xy with initial condition y(0) = 1 and step size h
= 0.1. Find the value of y(0.1) using Euler's method.
a. 1.3
b. 1.2
c. 1.1
d. 1
Ans: d
15. The Euler's method usually gives a good approximation as we increase the number of
iterations.
a. True
b. False
c. Absurd question
d. None of the above
Ans: a

16. In which of the following methods, the approximation of the curve of the solution is done
with the help of the tangent in each interval?
a. Picard’s method
b. Euler’s method
c. Newton’s method
d. Runge Kutta method
Ans: b

17. Modified Euler’s method also has the simple Euler’s method as a part of it’s calculation.
a. True
b. False
c. Absurd question
d. None of the above
Ans: a

ℎ 𝑒 𝑓
18. The equation 𝑦𝑘+1 = 𝑦𝑘 + 2 (𝑓(𝑥𝑘 , 𝑦𝑘 ) + 𝑓(𝑥𝑘+1 , 𝑦𝑘+1 )), where fe is calculated using
simple Euler’s method and k is the 𝑘 𝑡ℎ number of iteration, is the part of modified Euler’s
method.
a. True
b. False
c. Absurd question
d. None of the above
Ans: a

19. The ordinary differential equations cannot be solved using modified Euler’s method.
a. True
b. False
c. Absurd question
d. None of the above
Ans: b

20. Modified Euler’s method gives greater improvement in accuracy as compared to simple
Euler’s method.
a. True
b. False
 c. Absurd question
d. None of the above
Ans: a

21. In modified Euler’s method, the average of slopes is considered.

a. True
b. False
c. Absurd question
d. None of the above
Ans: a

𝑑𝑦
22. Consider the differential equation 𝑑𝑥 = 𝑥 2 with the initial condition y(0) = 1 . Take the step
size h = 2. The first approximation of the differential equation using modified Euler’s method
is
a. 10
b. 8
c. 4
d. 2
Ans: d

23. The local truncation error of the modified Euler’s method is of order ℎ3 .
a. True
b. False
c. Absurd question
d. None of the above
Ans: a

24. The global truncation error of the modified Euler’s method is of order ℎ2 .
a. True
b. False
c. Absurd question
d. None of the above
Ans: a

𝑥𝑘+1 − 𝑥𝑘
25. The formula for Regula Falsi method is 𝑥𝑘+1 = 𝑥𝑘 − 𝑓(𝑥𝑘 ) − 𝑓(𝑥𝑘 − 1 )
𝑓( 𝑥𝑘 ) , where k is the
𝑘 𝑡ℎ number of iteration.
a. True
b. False
c. None of the above
d. Need more information
Ans: a
26. Which of the following can be the possible root of the equation 𝑥 3 + 2𝑥 2 + 10x - 20 = 0
using Regula Falsi method.
a. 1.3866
b. 2.4688
c.
d. 2.3866
e. None of the above
Ans: a

27. According to the Regula Falsi method, in which of the following interval does the root of the
equation 𝑥 3 + 2𝑥 2 + 10x - 20 = 0 lies?
a. (2,3)
b. (1,2)
c. (3,4)
d. (0,1)
Ans: b

28. According to the Regula Falsi method, in which of the following interval does the root of the
equation 𝑥 3 + 2𝑥 2 + 50x + 7 = 0 lies?
a. (0,1)
b. (1,2)
c. (2,3)
d. None of the above
Ans: d

29. Which of the following can be the possible root of the equation 𝑥 3 - 9x + 1 = 0 using Regula
Falsi method.
a. 2.86125
b. 1.86125
c. Both the answers are correct
d. None of the above are correct
Ans: a

30. Regula Falsi method is also known as

a. Method of False position
b. Secant method
c. Bisection method
d. Fixed point iteration method
Ans: a