Numerical Analysis Midterm

)‫(مش محتاجة حاجة يعني يا شباب يادوب بالنظر‬

1. Approximate Error is defined as __________

(A) Present Approximation – Previous Approximation
(B) Exact Value – Approximate Value
(C) (Exact Value – Approximate Value) / Exact Value
(D) (Present Approximation – Previous Approximation) / Present Approximation

2. Truncation Error is caused by approximating _____________

(A) Irrational Numbers
(B) Fractions
(C) Rational Numbers
(D) Mathematical Procedures

3. Relative Absolute Error is defined as _________

(A) Present Approximation – Previous Approximation
(B) Exact Value – Approximate Value
(C) (Exact Value – Approximate Value) / Exact Value
(D) (Present Approximation – Previous Approximation) / Present Approximation

𝑓(𝑥+ℎ)−𝑓(𝑥)
4. The truncation error in calculating 𝑓 ′ (2) for 𝑓(𝑥) = 𝑥 2 by 𝑓 ′ (2) ≈ ℎ
with
h = 0.2 is __________
(A) -0.2
(B) -2.4
(C) 4.0
(D) 4.2

9
5. The truncation error in finding ∫3 𝑥 3 ⅆ𝑥 with equally proportioned points 3<6<9 is____
(A) 891
(B) 756
(C) 972
(D) 1620
6. If 𝐴 = 3.56 ± 0.05 and 𝐵 = 3.25 ± 0.04, then the values of A + B are_________
(A) 6.81 ≤ 𝐴 + 𝐵 ≤ 6.90
(B) 6.81 ≤ 𝐴 + 𝐵 ≤ 6.90
(C) 6.81 ≤ 𝐴 + 𝐵 ≤ 6.90
(D) 6.81 ≤ 𝐴 + 𝐵 ≤ 6.90

7. The coefficient of the 𝑥 5 term in the Maclaurin polynomial for 𝑠𝑖𝑛(2𝑥) is _________
(A) 0
(B) 0.0083
(C) 0.0167
(D) 0.2667

8. The absolute error in calculating the derivative of 𝑠𝑖𝑛(2𝑥) at 𝑥 = 𝜋 ∕ 4 by using the

𝑓(𝑥+ℎ)−𝑓(𝑥)
approximate expression 𝑓 ′ (𝑥) ≈ is __________
ℎ
ℎ−𝑐𝑜𝑠(2ℎ)−1
(A)
ℎ
ℎ−cos(ℎ)−1
(B)
ℎ
1−𝑐𝑜𝑠(2ℎ)
(C)
ℎ
𝑠𝑖𝑛(2ℎ)
(D)
ℎ

9. Let 𝑓(3) = 6, 𝑓 ′ (3) = 8, 𝑓 ′′ (3) = 11, and that all other higher order derivatives of 𝑓(𝑥)
are zero at 𝑥 = 3, and assuming the function and all of its derivatives exist and are
continuous between 𝑥 = 3 and 𝑥 = 7, then the value of 𝑓(7) Taylor series is ___________
(A) 38
(B) 80
(C) 126
(D) 331

ⅆ𝑦
10. If 𝑦(𝑥) is the solution of ⅆ𝑥 = 𝑦 3 + 2 , 𝑦(0) = 3 then the value of 𝑦(0.2) from a first
order Taylor polynomial around 𝑥 = 0 is ____________
(A) 4.4
(B) 8.8
(C) 24
(D) 29
11. A square matrix [A][i, j] is diagonally dominant if _____________
𝑛
(A) |𝑎𝑖𝑖 | ≥ ∑ |𝑎𝑖𝑗 | , 𝑖 = 1, 2 , … … … , 𝑛
𝑗=1,𝑖≠𝑗
𝑛 𝑛
(B) |𝑎𝑖𝑖 | ≥ ∑ |𝑎𝑖𝑗 | , 𝑖 = 1, 2 , … … … , 𝑛 and |𝑎𝑖𝑖 | > ∑ |𝑎𝑖𝑗 | for at least one 𝑖
𝑗=1,𝑖≠𝑗 𝑗=1,𝑖≠𝑗
𝑛 𝑛
(C) |𝑎𝑖𝑖 | ≥ ∑ |𝑎𝑖𝑗 | , 𝑖 = 1, 2 , … … … , 𝑛 and |𝑎𝑖𝑖 | > ∑ |𝑎𝑖𝑗 | for at least one 𝑖
𝑗=1 𝑗=1
𝑛
(D) |𝑎𝑖𝑖 | ≥ ∑ |𝑎𝑖𝑗 | , 𝑖 = 1, 2 , … … … , 𝑛
𝑗=1

12. At the end of steps of Gauss Elimination method on the following system of
equations
𝑥1 + 2𝑥2 + 3𝑥3 = 6
2𝑥1 − 3𝑥2 + 2𝑥3 = 4
3𝑥1 − 𝑥2 − 𝑥3 = −2
We find that the solution is ____________
(A) [2 , 0 , 2]
(B) [2 , 0 , 0]
(C) [0 , 2 , 0]
(D) [0 , 0 , 2]

13. The goal of forward elimination steps in Gauss Elimination method is to reduce the
coefficient matrix to ___________ matrix
(A) Diagonal
(B) Identity
(C) Lower Triangular
(D) Upper Triangular
14. At the end of forward elimination steps of Gauss Elimination method on the
following equations
4.2857 × 107 −9.2307 × 105 0 0 𝑐1 −7.887 × 103
7
(4.2857 × 10 −5.4619 × 105 −4.2857 × 107 5.4619 × 105 ) (𝑐2) ( 0 )
−6.5 −0.15384 6.5 0.15384 𝑐3 0.007
0 0 4.2857 × 107 −3.6057 × 105 𝑐4 0

the resulting equations in the matrix form are given by

4.2857 × 107 −9.2307 × 105 0 0 𝑐1 −7.887 × 103
( 0 3.7688 × 105 −4.2857 × 107 5.4619 × 105 ) (𝑐2) ( 7.887 × 103 )
0 0 −26.9140 0.579684 𝑐3 1.19530 × 10−2
0 0 0 5.62500 × 105 𝑐4 1.190336 × 104

The determinant of the original coefficient matrix is _____________

(A) 0
(B) 4.2857 × 107
(C) 5.486 × 1019
(D) −2.4453 × 1020

15. Using [𝑥1 , 𝑥2 , 𝑥3 ] = [0 ,0 ,0] as the initial point, the value of [𝑥1 , 𝑥2 , 𝑥3 ] after 3
iterations in The Jacobi method for the following system is _____________
5𝑥1 − 2𝑥2 + 3𝑥3 = −1
−3𝑥1 + 9𝑥2 + 𝑥3 = −1
2𝑥1 − 𝑥2 − 7𝑥3 = −1
(A) [0.192 , 0.328 , −0.416]
(B) [0.412 , 0.912 , −0.842]
(C) [0.901 , 0.012 , −0.021]
(D) [0.212 , 0.721 , −0.822]
16. Using [𝑥1 , 𝑥2 , 𝑥3 ] = [1 ,0 ,1] as the initial point, the value of [𝑥1 , 𝑥2 , 𝑥3 ] after first
iteration in Gauss-Seidel method for the following system is _____________

12 3 −5 𝑎1 1
[ 1 5 3 ] [𝑎2] = [28]
3 7 13 𝑎3 76

(A) [0.50 , 4.90 , 3.09]

(B) [1.43 , 0.92 , 2.84]
(C) [0.91 , 1.01 , 1.02]
(D) [1.21 , 0.72 , 4.82]

17. The following system of equations,

2𝑥1 + 7𝑥2 − 11𝑥3 = 6
𝑥1 + 2𝑥2 + 𝑥3 = −5
7𝑥1 + 5𝑥2 + 2𝑥3 = 17

converges using Gauss-Seidel method, if we can rewrite the above equations as follows:
2 7 −11 𝑥1 6
(A) [1 2 1 ] [𝑥2 ] = [−5]
7 5 2 𝑥3 17

7 5 2 𝑥1 17
(B) [1 2 1 ] [𝑥2 ] = [−5]
2 7 −11 𝑥3 6

7 5 2 𝑥1 6
(C) [1 2 1 ] [𝑥2 ] = [−5]
2 7 −11 𝑥3 17

(D) The equations cannot be rewritten in a form to ensure convergence

18. The bisection method of finding roots of nonlinear equations falls under the
category of ___________
(A) Open methods
(B) Bracketing methods
(C) Random methods
(D) Graphical methods
19. If 𝑓(𝑥) is a real continuous function in [𝑎, 𝑏], and 𝑓(𝑎)𝑓(𝑏) < 0, then for 𝑓(𝑥) = 0,
there is _________ in the domain [𝑎, 𝑏]
(A) One Root
(B) Undeterminable number of Roots
(C) No Root
(D) At least one Root

20. Assuming an initial bracket of [1, 5], the second iterative of the root 𝑡ⅇ −𝑡 − 0.3 = 0
(at the end of 2 iterations) using the bisection method is ___________
(A) 2
(B) 1.5
(C) 4
(D) 3

21. The Newton-Raphson method formula for finding the square root of real number 𝑅
from the equation 𝑥 2 − 𝑅 = 0 is ______________
𝑥
(A) 𝑥𝑖+1 = 𝑖
2
3𝑥𝑖
(B) 𝑥𝑖+1 =
2
1 𝑅
(C) 𝑥𝑖+1 = (𝑥𝑖 + )
2 𝑥 𝑖
1 𝑅
(D) 𝑥𝑖+1 = (3𝑥𝑖 − )
2 𝑥 𝑖

22. At the beginning of an iteration of bisection method, the lower and upper points of
the root are 𝑥𝑙 and 𝑥𝑢 . At the end of the iteration, the absolute relative approximate
error in the estimated value of the root would be _____________
𝑥𝑢
(A) | |
𝑥𝑢 +𝑥𝑙

𝑥𝑙
(B) | |
𝑥𝑢 + 𝑥𝑙

𝑥𝑢 − 𝑥𝑙
(C) | |
𝑥𝑢 + 𝑥𝑙

𝑥𝑢 + 𝑥𝑙
(D) | |
𝑥𝑢 − 𝑥𝑙
23. The bisection method cannot be adopted to solve the equation 𝑥 2 = 0 in spite of the
root existing at 𝑥 = 0 because the function 𝑓(𝑥) = 𝑥 2 _______________
(A) is a polynomial
(B) has repeated roots at 𝑥 = 0
(C) is always non-negative
(D) has a slope equal to zero at 𝑥 = 0

24. If the initial point is 𝑥0 = 1.6 for the Newton-Raphson method, then the next
iterative value of the root 𝑥 2 − 𝑙𝑛(𝑥) − 2 = 0 is _____________
(A) 1.500
(B) 1.065
(C) 1.565
(D) 1.005

25. The initial estimate of the root of the equation 𝑓(𝑥) = 0, is 𝑥0 = 3, 𝑓(3) = 5. If the
angle of the tangent line to the function 𝑓(𝑥) at 𝑥 = 3 is 57𝑜 with respect to the 𝑥-axis.
Then the next estimate of the root by using Newton-Raphson method, 𝑥1 most nearly is
____________
(A) -3.247
(B) -0.247
(C) 3.247
(D) 6.247

26. The next iterative value of the root of 𝑥 2 − 4 = 0 using secant method, if the initial
points are 3 and 4, is ______________
(A) 2.2857
(B) 2.5005
(C) 5.5002
(D) 5.7143

27. The number of polynomials that can go through two fixed data points (𝑥1 , 𝑦1 ) and
(𝑥2 , 𝑦2 ) is ______-
(A) 0
(B) 1
(C) 2
(D) Infinite
28. A unique polynomial of degree ____________ passes through 𝑛 + 1 data points
(A) 𝑛+1
(B) 𝑛 + 1 or less
(C) 𝑛
(D) 𝑛 or less

29. Polynomials are the most commonly used functions for interpolation because they
are easy to _____________
(A) Evaluate
(B) Differentiate
(C) Integrate
(D) Evaluate, Differentiate and Integrate

30. Given three data points (1, 6), (3, 28), (10, 231), it is found that the function
𝑦 = 2𝑥 2 + 3𝑥 + 1 passes through the three data points. Your estimate of 𝑦 at 𝑥 = 2 is
most nearly ____________
(A) 6
(B) 15
(C) 17
(D) 28

31. The following data of the velocity of a body is given as a function of time
Time (s) 0 15 18 22 24
Velocity (m/s) 22 24 37 25 123

The velocity at time = 16s using linear polynomial interpolation is most nearly _________

(A) 27.867 m/s

(B) 28.333 m/s
(C) 30.429 m/s
(D) 43.000 m/s
32. If Velocity vs. time data for a body is approximated by quadratic polynomial
interpolation as 𝑣(𝑡) = 8.6667𝑡 2 − 349𝑡 + 3523, (18 ≤ 𝑡 ≤ 24), then the distance
between times 𝑡 = 19𝑠 and 𝑡 = 22𝑠, using the above interpolant, is most nearly ________
(A) 10.337 m
(B) 88.500 m
(C) 93.000 m
(D) 168.00 m

33. The Newton’s divided difference second order polynomial for the following data
𝑥 2 2.1 2.2
𝑦 1.4142 1.4491 1.4832

is given by 𝑓2 (𝑥) = 𝑏0 + 𝑏1 (𝑥 − 2) + 𝑏2 (𝑥 − 15)(𝑥 − 2.2), then the value of 𝑏1 is most

nearly __________
(A) -0.0411
(B) 0.14333
(C) 0.34924
(D) -1.0001

34. The Newton’s divided difference second order polynomial for the following data
𝑥 2 2.1 2.2
𝑦 1.4142 1.4491 1.4832

is given by 𝑓2 (𝑥) = 𝑏0 + 𝑏1 (𝑥 − 2) + 𝑏2 (𝑥 − 15)(𝑥 − 2.2), then the value of 𝑏2 is most

nearly __________
(A) -0.0411
(B) 0.14333
(C) 0.34924
(D) -1.000
35. The Newton’s divided difference second order polynomial for the following data
𝑥 18 22 24
𝑦 24 25 123

is given by 𝑓2 (𝑥) = 𝑏0 + 𝑏1 (𝑥 − 18) + 𝑏2 (𝑥 − 18)(𝑥 − 22), then the value of 𝑏2 is most

nearly __________
(A) 0.250
(B) 8.125
(C) 24.00
(D) 0.125

36. If Velocity vs. time data for a body is approximated by a second order Newton’s
divided difference polynomial as 𝑣(𝑡) = 𝑏0 + 39.622(𝑡 − 20) + 0.5540(𝑡 − 20)(𝑡 − 15)
(10 ≤ 𝑡 ≤ 20), then the acceleration at 𝑡 = 15 using the above interpolant is most
nearly __________
(A) 0.5540 m/s2
(B) 39.622 m/s2
(C) 36.852 m/s2
(D) 0.3492 m/s2

37. The linear Lagrange polynomial 𝑓1 (𝑥) that passes through two points
[𝑎, 𝑓(𝑎)], [𝑏, 𝑓(𝑏)] is given by ____________

𝑥−𝑏 𝑥−𝑎
(A) 𝑓1 (𝑥) = 𝑓(𝑎) + 𝑓(𝑏)
𝑎−𝑏 𝑎−𝑏

𝑥 𝑥
(B) 𝑓1 (𝑥) = 𝑓(𝑎) + 𝑓(𝑏)
𝑏−𝑎 𝑏−𝑎

𝑓(𝑏)−𝑓(𝑎)
(C) 𝑓1 (𝑥) = 𝑓(𝑎) + (𝑏 − 𝑎)
𝑏−𝑎

𝑥−𝑏 𝑥−𝑎
(D) 𝑓1 (𝑥) = 𝑓(𝑎) + 𝑓(𝑏)
𝑎−𝑏 𝑏−𝑎
38. If the Lagrange polynomial that passes through the three data points
𝑥 0 -1 1
𝑦 1 2 3

is given by 𝑓2 (𝑥) = 𝐿0 (𝑥) + 2𝐿1 (𝑥) + 3𝐿2 (𝑥). Then the value of 𝐿0 (𝑥) at 𝑥 = 2 is ________

(A) 0
(B) -1
(C) -3
(D) -2

39. If the Lagrange polynomial that passes through the three data points
𝑥 15 18 22
𝑦 24 37 25

is given by 𝑓2 (𝑥) = 𝐿0 (𝑥)(24) + 𝐿1 (𝑥)(37) + 𝐿2 (𝑥)(25). Then the value of 𝐿1 (𝑥) at 𝑥 = 16

is most nearly ____________
(A) -0.07143
(B) 0.50000
(C) 0.57143
(D) 4.33333
(E)

40. If the Lagrange polynomial that passes through the three data points
𝑥 0 -1 1
𝑦 1 2 3

is given by 𝑓2 (𝑥) = 𝐿0 (𝑥) + 2𝐿1 (𝑥) + 3𝐿2 (𝑥). Then the value of 𝐿2 (𝑥) at 𝑥 = 2 is ________

(A) 0
(B) 1
(C) 3
(D) 2

‫جود الك من يوسف و شوشة‬

1. A 2. D 3. C 4. A 5. A 6. B 7. D 8. C

9. C 10. B 11. B 12. D 13. D 14. D 15. A 16. A

17. B 18. B 19. D 20. B 21. C 22. C 23. C 24. C

25. B 26. A 27. B 28. C 29. D 30. B 31. B 32. A

33. C 34. A 35. B 36. C 37. D 38. C 39. C 40. C