Haldia Institute of Technology

B. Tech 2nd year 4th Semester, ECE-III

3rd Class Test’ June 2021
PAPER NAME: Numerical Methods FULL MARKS: 30
PAPER CODE:BS M401 DURATION: 1HOUR
DATE: 29.06.2021, TIME:17.00HRS-18.00HRS
General Instruction:
Please use the following google form link to answer the following questions.

https://forms.gle/LbBXy6SnmnKyUcsL6

Choose the corrective alternative for all the following questions 30 × 1 = 30

𝑏
1. In evaluating 𝑎
𝑓 𝑥 𝑑𝑥, the error in Trapezoidal rule is of
(a) ℎ2 (b) ℎ3 (c) ℎ4 (d) ℎ
𝑏
2. In Simpson’s 1/3rd rule for finding 𝑎
𝑓 𝑥 𝑑𝑥 , 𝑓 𝑥 is approximated by
(a) Line segment (b) Parabola
(c) Circular sector (d) part of ellipse
3. The truncation error in Composite Simpson’s 1/3rd rule is of order
(a)ℎ3 (b) ℎ4 (c) ℎ5 (d) ℎ
𝑏
4. In Trapezoidal rule for finding 𝑎
𝑓 𝑥 𝑑𝑥 , 𝑓 𝑥 is approximated by
(a) Line segment (b) Parabola
(c) Circular sector (d) none of these.
5. In Simpson’s 1/3rd rule the interval of integration is subdivided in
(a) odd number of interval
(b) even number of intervals
(c) both even and odd number of intervals
(d) none of these.
𝑏
6. In Trapezoidal rule for approximating the value of 𝑎
𝑓 𝑥 𝑑𝑥 , the area given by this
integral is approximated by the sum of area of some
(a) rectangle (b) trapezium

Page 1 of 4
 (c) parallelogram (d) none of these.
𝑏
7. In Trapezoidal rule for finding the value of 𝑎
𝑓 𝑥 𝑑𝑥 there exists no error if 𝑓 𝑥 is
(a) parabolic function (b) linear function
(c) Logarithemic function (d) none of these
1
8. The value of 0
𝑥 3 + 3𝑥 + 2013 𝑑𝑥, 𝑛 = 10. Which of the following will give better
result
(a) Simpson’s 1/3rd rule
(b) Trapezoidal Rule
(c) both Simpson’s 1/3rd and Trapezoidal Rule
(d) none of these
9. Minimum number of interval needed for applying Simpson’s 1/3rd rule is
(a) 1 (b) 2 (c) 3 (d) 4.
10. Minimum number of interval needed for applying Trapezoidal rule is
(a) 1 (b) 2 (c) 3 (d) 4.
𝑏
11. By simpson’s 1/3rd rule 𝑎
𝑓 𝑥 𝑑𝑥 =
𝑏−𝑎
(a) 𝑓 𝑎 +𝑓 𝑎+𝑏 +𝑓 𝑏
6
𝑏−𝑎
(b) 𝑓 𝑎 + 2𝑓 𝑎 + 𝑏 + 𝑓 𝑏
6
𝑏−𝑎 𝑎+𝑏
(c) 𝑓 𝑎 + 4𝑓 +𝑓 𝑏
6 2

𝑏−𝑎 𝑎+𝑏
(d) 𝑓 𝑎 + 4𝑓 +𝑓 𝑏
3 2
1
12. The value of 0
𝑥 2 + 2𝑥 − 1 𝑑𝑥, 𝑛 = 10, using Simpson’s 1/3rd rule is
(a)2.33 (b) 2.98
(c) not determinable (d) none of these
1 log 1+𝑥
13. The value of the integral 0
𝑑𝑥 with step length 0.5 by simpson’s 1/3rd rule is
𝑥
1 1
(a) 6 1 + 8 log 1.5 + log 2 (b) 6 4 log 1.5 + log 2
1 1
(c) 6 −48 log 1.5 + log 2 (d) 6 1 − 8 log 1.5 + log 2
24
14. In Trapezoidal rule for finding the approximate value of 12
𝑓 𝑥 𝑑𝑥, the error is
(when the number of sub interval is 12)

Page 2 of 4
 (a) – 𝑓 ′′ 𝜉 (b) −2𝑓 ′′ 𝜉 (c) 𝑓 ′ 𝜉 (d) none of these .
15. Which of the following method always guarantee the convergence
(a) secant method (b) bisection method
(c) Regula falsi method (d) newton raphson method
16. Rate of convergence of Newton Raphson’s method is
(a) linear (b) quadratic
(c) cubic (d) none of these.
17. Newton raphson method is fail when
(a) 𝑓 ′ 𝑥 = 1 (b) 𝑓 ′ 𝑥 = 0
(c) 𝑓 ′ 𝑥 = −1 (d) 𝑓 ′′ 𝑥 = 0
18. The condition of convergence of newton raphson method when applied to an
equation 𝑓 𝑥 = 0 in an interval is
(a) 𝑓 ′ 𝑥 ≠ 0 (b) 𝑓 ′ 𝑥 <1
2 2
(c) 𝑓 ′ 𝑥 > 𝑓 𝑥 𝑓 ′′ 𝑥 (d) 𝑓 ′′ 𝑥 > 𝑓 𝑥 𝑓′ 𝑥
19. One of the root of 𝑥 3 − 17𝑥 + 5 = 0 lies in between
(a) 1 and 2 (b) 0 and 1
(c) 2 and 3 (d) none of these.
20. For the Newton-Raphson’s method, the iterative formula is
𝑓 𝑥𝑛 𝑓 ′ 𝑥𝑛
(a) 𝑥𝑛 +1 = 𝑓 ′ (b) 𝑥𝑛 +1 =
𝑥𝑛 𝑓 𝑥𝑛

𝑓 𝑥𝑛 𝑓 ′ 𝑥𝑛
(c) 𝑥𝑛 +1 = 𝑥𝑛 − 𝑓 ′ (d) 𝑥𝑛+1 = 𝑥𝑛 +
𝑥𝑛 𝑓 𝑥𝑛

21. Newton Raphson’s method is also known as

(a) Normal Method (b) Tangent method
(c) Parallel method (d) none of these.
22. Rate of convergence of bisection method is
(a) linear (b) quadratic
(c) cubic (d) none of these.
23. Bisection method is used for finding the real root of a transcendental equation is
(a) an analytical method (b) graphical method
(c) iterative method (d) none of these

Page 3 of 4
24. Bisection method is
(a) conditionally and surely convergent
(b) unconditionally and surely convergent
(c) conditionally convergent
(d) none of these.
25. The root of a transcendental equation 𝑓 𝑥 = 0 is obtained more rapidly by
Newton-Raphson’s Method when 𝑓 ′ 𝑥 in the neighborhood of the root is
(a) zero (b) small
(c) large (d) none of these.
26. Newton-Raphson’s iterative formula for finding the square root of a real positive
number 𝑅 is
𝑅 𝑅
(a) 𝑥𝑛 +1 = 𝑥𝑛 + 𝑥 (b) 𝑥𝑛 +1 = 𝑥𝑛 − 𝑥
𝑛 𝑛

1 𝑅 1 𝑅
(c) 𝑥𝑛 +1 = 2 𝑥𝑛 + 𝑥 (d) 𝑥𝑛+1 = 2 𝑥𝑛 − 𝑥
𝑛 𝑛

𝑥𝑛 3
27. The iterative scheme 𝑥𝑛+1 = + 𝑥 , with a positive approximation, computes
2 𝑛

(a) 2 (b) 3 (c) 5 (d) 6

28. Regula falsi method is
(a) conditionally convergent (b) linearly convergent
(c) divergent (d) none of these.
29. Regula falsi method used for finding the real roots of an equation is
(a) an analytical method (b) graphical method
(c) iterative method (d) none of these.
30. If 𝑓 𝑎0 𝑓 𝑏0 < 0 and 𝑎0 < 𝑏0 , then the first approximation of one of the roots of
𝑓 𝑥 = 0 by regula falsi method is
𝑎 0 𝑓 𝑏0 +𝑏0 𝑓 𝑎 0 𝑎 0 𝑓 𝑏0 −𝑏0 𝑓 𝑎 0
(a) (b)
𝑓 𝑏0 +𝑓 𝑎 0 𝑓 𝑏0 −𝑓 𝑎 0
𝑎 0 𝑓 𝑎 0 +𝑏0 𝑓 𝑏0 𝑎 0 𝑓 𝑎 0 −𝑏0 𝑓 𝑏0
(c) (d)
𝑓 𝑏0 +𝑓 𝑎 0 𝑓 𝑎 0 −𝑓 𝑏0

Answer Submission link

https://forms.gle/LbBXy6SnmnKyUcsL6

Page 4 of 4