MCQs on Numerical Methods Numerical Methods-I 1. The equation x* —log,, x + cos. =0 is known as al equation (a)Algebraic equation (b)Transcende (c)Polynomial (d)None of these Ans: (b) .gula-Falsi method o) far 1 -quation can be solved by R 2. Which of the following (a) 3x—cosx-1=0 ad 1 2 7, 3x+20y-2=-18 @) 2 =“d+x)y*, O)=1 25, 20x+y de (©) 2x—3y +202 Mathematies-(wee = MEQson Numerical Methods 3. Which of the following method is not used to solve algebraic and transcendental equations? (a)Newton-Raphson method (b) False position method (c)Relaxation Method (d)Method of successive approximation Ans: (c) 4. In bisection method if roots lies between @ and b then f(a)x f(b) is fay<0 (b)=0 (c)> 0 (d) none of these Ans: (a) $5. Newton ~ Raphson formula of successive approximation to find the approximate value of a root of the equation f(x) =0 is @X,y2 x, -L02 f,) (Xie x, + Ans: (b) Hee 8MCQs on Numerical Methods 6. The false position formula to find root of equation {x)= 0 is a. af (a)~bh (b) = bf(b)~af (a) af (6)=bf (a) - @) x1 Tefen) (1 = "FG (x1 = Toa7@y—-(d)None of these Ans: (c) 7. If the root of the equation xlog,, x— 1.2 = Olying between 2.7 and 2.8 then first approximation to root using Regula falsi Method is given by (a) 2.7202 (b)2.7406 (c) 2.7605 (d)2.7806 Ans: (b) 2 8. Order of Convergence of Newton-Raphson Method and Regula-Falsi method are respectively, ———__\§| (2.2 (B), 1.168 (C216 (LAB Ans: (b)as MCQs on Numerical Methods 9. Ione root of equation {(x)=0 is near tox, , then the first approximate of this root as calculated by Newton — Raphson method is. the abscissa of the point , where the following straight line intersect the x-axis (a)normal to the curve y = fx) al the point (Xo . J {(X0)) (btangent to the curve y = {(x) at the point (Xo , ¥ = Xo), ‘Xo)) having the gradient (c) The straight line through the point (Xo (d) Passing through the point (x, f(Xo)) Ans: (b) 10. Condition for convergence of the Newton — Raphson method to a root @ is oa ore 9 £451 (d) None of theseMCQs on Numerical Methods 11. After first iteration of Newton - Raphson method the positive root of equation x is (taking Initial approximation 3/2) (a) 7/4 (b) 97/56 (c) 3/2 (d) 347/200 Ans: (a) 12. Newton - Raphson method converges fast . if f°(@) is (a is the exact value of root) (a) small (b) large (c) zero (d) None of these Ans: (b) 13. The Newton-Raphson methed is used to find the root of equation x7 -2=0. If the iteration are started from -1 , the iteration will (a) converge to-1 —(b) converge to V2 —(c) convergeto- V2 —(d) Not converge Ans: (c)MCQs on Numerical Methods 14, Newton-Raphson iteration formula for finding VC , where C>0 is a VC 3x? -¥C * (a) x= 2 eNG (b) Xei= 2 ve (©) Xo = 2x? 3. Ans: (c) 15. Given the equation x‘ —.x-10=0 by Newton-Raphson method. (4a) The root of the given equation lies between | and2_( £2) \A\ (b) The root of the given equation lies between =I and -2 : 4 (¢) The root of equation lies between 0 and 1 — ~ | (d) No root exist Ans: (a) sanit Sangrah | SatishMCQs on Numerical Methods 16. The first approximation to solution for following system of equations 2x-3y+202=25, 20x+y- using Gauss-Seidal Method with the initial approximation x, = 0... = (a).x, = 1.0025, y, = -0.9998, z, = 0.9998 (b)x, =1, 2, = 1 Ans: (c) (e) x, = 0.85, y, = - 1.0275, 0109 (d) None of the above 17. Which is correct Lower triangular matrix for Bx42y47. 2x+3y 3x+4y 42 =7 using Crout’s Method 24 2 122) [22 [2 3 3 3 30 3 5 : a i@=@=©§©6©6.: Ans: (c) 3 3 3 5 : 1 0 0 1 32 a | 7 5. lMCQs on Numerical Methods 18. Gauss-Seidal iterative method is used to solve (a)differential equation (b)System of non-linear equation (c)System of linear equation (d)Partial differential equations Ans: (c) 14 19, Guass-Scidal methods gives result faster when the pivotal element are | / (a)Smaller than other coefficient (b)Larger than other coefficient Zé (c)Equal to other coefficient (d)None of the above _ | £6 Ans: (b) 20. In the Regula-Falsi method while finding the real root of an equation, the curve AB is replaced by (a)Tangent AB ~~~ (b)Straight Line AB (c)Chord AB (d)AIl of the above atish TiMCQs on Numerical Methods 21. Newton’s Iterative formula to find the value of VN is jent matrix is reduced to Ans: (b) 22. In solving simultaneous equations by Gauss-Jordan method, th (b)Upper triangular matrix (a)Lower triangular matrix (d)Symmetric Matix (c)Diagonal matrix Ans: (c) 23. If f(a) is negative and_(b) is positive then first approximation to the root for an equation J x) =0 using bisection method is given ) Sass) (= H(a-6) (d) x, = (Kay+ so) ; . (fay- Fb) ©) x= 2 Ans: (b) MatheMCQs on Numerical Methods aD 24, As soon as a new value of a variable is found by iteration, it is used immediately in the following ’)\ equations, this method is called eee 8 (a)Gauss-Jordan method (b)Gauss-Seidal Method (c)Gauss elimination method (d)Jacobi's Method Ans: (b) 25. Out of Regula-falsi method, Newton-Raphson method and Bisection method, the rate of convergence is faster for (a) Regula-falsi method (b) Newton-Raphson method (c) Bisection method (AAI of the above Ans: (b) 26. The convergence in the Gauss-Scidal method is thrice as fast as in the Jacobi’s Method (a) True (b) False (e)Can’t say anything (d) Both methods having same convergence rate Ans: (a)MCQs on Numerical Methods 27. Regula Falsi method requires initial approximation to the root a (a)! (b) 2 (c)3 (d)4 |yoaee 8 ' . Ans: (b) Lng aH +c 28. An approximate root of the equation sin. x at second stage that lies between x=1 and x=1.5 is (a) 1.25 (b) 1.125 (c) 1.0625 (4) 1.255 Ans: (b) 1 t zi ai = 29. Newton's Iterative formula to find the value of > is = coe oe ee (@) X41 =, (1 Ns) (b) Xx, 40%,) FOR ZN, : (©) Xpar =X, (2+ NX,) (d) X41 =, (2—Nx,) Fie) = Ans: (4) h TiwariMCQs on Numerical Methods " 30. Newton’s Method has second order of quadratic convergence because x y (Here €, and &,., ate two consecutive error in finding the approximate root by Newton's #" Method) (a) ,2(6,)° (b) &,..0(€,) (©) Ena =(E)" @) 4,4 =) Ans: (a) 31, Find by Newton-Raphson method the first approximate root of the equation x° -6x+4=0 nearer to 0.7 36-90 (a) 0.7321 (b) 0.71 (c) 0.7316 (d) 0.7222 % =oG qa hare) Ans: (a) 32. Find by Newton-Raphson method the first approximate root of the equation 3x — cos x — = eee with initial approximation 0.6 7 (a) 0.62 (b) 0.6071 (c) 0.7210 (@) 0.6062 eee) Ans: (b)MCQs on Numerical Methods 33, Find using Regula Falsi method the first approximate root of the equation xe" = cosx if the root lies between 0 and 1. = (ed) (a) 0.2222 (0) 0.4241 (05154 @o3i4a7 ABC) 34. Find the values of x,y,z in the following system of equations by Gauss elimination method 1-1 2) fx] [-l 011 3 0 o 6{[z} L6 Ans: (c) 35. In Gauss elimination method, upper triangular matrix of coefficient matrix can be found by (a) Column transformation (&) Row transformation Ans: (b) (c) Both (a) & (b) (d) None of these ce Mathe it ah | SiMCQs on Numerical Methods 36. If f(a) and f(b) have opposite signs, then (a) f(%)=0 has no root lying between a and b (b) f(x)=0 has many roots lying between a and b (c) f()=0 has atleast one root lying between a and b Ans: (c) (@) f(x)=0 has exactly one root lying between a and b SO) = Clune + (> | So 37. Which of the following step is not involved in the Gauss Elimination Method? / (a) Elimination of unknowns $(NF @ 400 (b) Reduction to an upper triangular system : =22N-5 20 (c) Finding unknowns by back substitution Ans:(d)_ {:) (@) Evaluation of cofactors ru Face 4a): The root/roots-ofithe equation e* — 4x = 0 lying between 2 (moat aaa z2)-P So ‘ta) Only (I) is correct (b) Only (II) is correct Ans: sy . é ~47) \ (oy both (1) & (II) are correct (d) None of them are correct - ety ‘angrah | Satish Tiwari Tre ety 09]MCQs on Numerical Methods 39. Which of the following methods is used for obtaining the inverse of matrix? (a) Gauss Seidel method (b) Newton-Raphson method yen 8 (c) Gauss-Jordan method (d) Secant Method Ans: (c) 40. What is the main difference between Jacobi's method and Gauss-Seidel method? (a) Computations in Jacobi's method can be done in parallel but not in Gauss-Seidel method. (b) Convergence in Jaccbi's method is faster as compared to Gauss-Seidel method. (c) Gauss-Seidel cannot solve the system of linear equations in three variables whereas Jacobi can (d) Deviation from the correct answer is more in Gauss-Seidel method. Ans: (a)MCQs on Numerical Methods 39. Which of the following methods is used for obtaining the inverse of matri: (a) Gauss Seide! method (b) Newton-Raphson method es (c) Gauss-Jordan method (d) Secant Method Ans: (c) 40. What is the main difference between Jacobi’s method and Gauss-Seidel method? (a) Computations in Jacobi's method can be done in parallel but not in Gauss-Seidel method. (b) Convergence in Jacobi’s method is faster as compared to Gauss-Seidel method. (c) Gauss-Seidel cannot solve the system of linear equations in three variables whereas Jacobi can (d) Deviation from the correct answer is more in Gauss-Seidel method. Ans: (a) 41. While solving by Gauss-Seidel method, which of the esollowins | is the first Iterative solution system; MwMie de 7 a (0.25.1) ——Te: Hea [email protected] = alex) 3fé Mai aor)MCQs on Numerical Methods 42. The coefficient matrix can be expressed by Crout’s method as 1 nm; (a) A=UL=|0 1 0 0 4, 0 (©) A=LU=lhy hy a Ans: (c) ms] [hy 0 ts] {ly by 1 hy hy 7 O}jo 1 4,|[0 0 0 0 hy m; My 1 us (b) A=UL=|0 1 0 0 0 (d) A=LU= , ms My 1 0 0 1 00 ty 10 Ny oh 1 ms i 0 Onex _MCQson Numerical Methods "“eN 32 7 ti i 43. We have, | 2 3 ' ¥ Iytys thy auth + batty, meee 8 34 UI Loa Jlats Fhe fats Hatta tla] What is the value of /,,—7 = - \ 5 8 1 } @s (b) 2 O-3 @-5 : 7 Ans: (a) a r a (2 37] Tom: us] ~ 44. Wehave, 2 \7 15|+ Oi [. \\3 5 41 oo 1 What are the ¢alue of /,, (a) 7,14 (c) 2,715 (d) 315,41 Ans: (b)MCQs on Numerical Methods () 2 37 [4 0 0 Vs) (us 45.Wehave,}2 7 15|=|f, 4; 0|{0 ~T (a) 12,3 Ans: (c) rah | SatMCQs on Numerical Methods 46, If X is true value and X" is its approximate value then Absolute Error , Relative Error and Percentage Error is given by. (QE, =X -X"'|, Ep= (OE, =|X'-X |. By (c)E, =| X -X'|, Ep = (QE, }X'-X |. E,= Ans: (a)MCQs on Numerical Methods 47, Find relative maximum error in the function ars ; fe ASB 5. =I with Ar = Ay = Az = 0.001. (a) 5 (b) 0.3 (c) 0.006 (d) 0.001 Ans: (c) 48. Relative maximum error for the function u(.x,.’,2) is given by 7 A 5 Ai (8) (Eg)ag = ne. (0) (Eq), = Aides. u Au u . (Au) (c) (E, = (d) (E _—s C) (ER as (an). (Ep) as y Ans: (d) MatheMCQs on Numerical Methods 49. Truncation error arises due to (a) approximate given data , limitations of computing aids (b) rounding off the numbers while process of computations (c) use of approximate formula in computation or by truncating the infinite series to some approximate terms. (d) all of these are correct Ans: (c) 50, At which point iterations in the Newton — Raphson method are stop (A)When the consecutive iteratives value of x are not equal (B)When the consecutive iteratives value of x differ by 2 decimal places (C)When the consecutive iterative value of x differ by 3 decimal places (D) When the consecutive iteratives value of x are equal Ans: (4)MCQs on Numerical Methods 5 Numerical Methods-II aN x ‘ 1. Which of the following method is not use to solve first order first degree differential equation <8 (a) Decomposition Method (b) Taylor's Series Method (c) Euler's Method (d)Euler’s modified Method Ans: (a) 2. The solution of a 2y +3e" , given (0) =0, at x=0.1 xv using Taylor's scries method is (a) 0.2487 (b)0.1487 (c) 0.4487 Ans: (d) (4)0.3487 | MateMCQs on Numerical Methods "Se 3. Which of the following represents the Taylor's Series Expansion of = f(x) at x=0 E 2 D Me ete 8 (a) y(x) = y(0) + xy"(0) + FO + sr t+. (4) v(x) = (0) + 29"(0) + = "(0)+ S70) +. ee 3 "(0) +... (c) v(x) = (0) + y"(0) + 50+ (d) yx) = 9(0)—y'(O) + 50 - ro .. Ans: (b) Numerical Solution of Different ee ingrah | Satioh TiwariMCQs on Numerical Methods 4.A£uler’s modified formula is given by, h BUG WAS) wf Me (ay DY) my! = i ¥ ter d+ Sere)" iy a : oo ' AOI A SO It SO eI OI EY ILC I+ HOT) Ans: (C) 5. Euler's formula for 4’, is given by. oo i LOMA Yo tM Vo) ‘h 2 @) \ «) w= 9444 e0)+ Ar] A yi? =¥5 + ALO. b+ SO] Ans: — —MCQs on Numerical Methods 6.1f & = x + yat y(0) = 1 then the first approximate value of y by Picard’s formula is z x (@)yy =1t x47 45 (by =1L4 xt (Oy, = 1+2x +4 (yy sl txtxt ee Ans: (b) 7A 2 = f(x,y) at ylxo} = yo then the first approximate value of yy by Milne’s corrector formula is kh k Ay =y-i(a+4h+ A) yl =n+t(a+4h+h”) A OM? = tZ(h-4h+ Kh”) Dy) = +42 (h-4h-A”) Ans: (b) Sangrah | Satish Tiwari nerical Solution of Differential Equations | Mathematies-G:MCQs on Numerical Methods 8, Runge-Kutta method is better than Taylor's scries method because (a) It does not require prior calculations of higher derivatives, as Taylor's method does. (b) Operation is identical whether the differential equation is linear or non-lincar (c) This method agrees Taylor’s series upto the terms of h’. (d) All of the above Ans: (d) 9. Given * =log(x +") .given y(0) = 2 for x =0.8and h=0.2. i then how many times Euler’s modified formula to be applied to find y(0.8) (a) one (bytwo (c) three (d)four Ans: (d) Numerical Solution ‘angeah | Satish TiwariMCQs on Numerical Methods 10. What is the value of k, using Runge-Kutta Method of fourth order for the differential equation . 9(0)=1 and f= 0.2 a Vex (a0 (b)0.2 (c) 0.3 (d) 04 Ans: (b) 11. Given ‘ fae x7)y? given (0) = 1, (0.1) = 1.06, (0.2) = 1.12, (0.3) = 1.21, 2 “ (OM) = 0.5, (0.11.06) = 0.5674, £(0.2.1.12) = 0.6522, £(0.3.1.21) = 0.7980, then by Milne’s predictor method 1°(0.4) is to be obtained as (a) 1.2772 (b) 1.2798 (c) 1.3808 (d) 1.4043 Ans: (a)MCQs on Numerical Methods 12, The solution of second order differential equation by Runge-Kutta method of fourth order can be obtained by which correct pair of k, and /, (a) ky =he f( 4 4, 13. While finding largest Eigen value using Rayleigh’s power method we continue the multiplication of given matrix with vector X’' till (where / denotes number of iteration) oo a) X' =X" negligible (b) X'-X'' negligible se) Both (a) and (b) are correct Ya) None of the above Ansr@X<) ial Equations | MathMCQs on Numerical Methods 14, To find the numerically largest Eigen value using iterative method we use the equation (a) A=AX (b) AX =X (c) AX Ans: (d) 15. The general formula of Picard’s Method to find solution of first order linear differential equation is (6) az =% + fre wei WY oe + i f(xy, de (9 dan Gy ee 4 oPlernt Le Ans: (d) . Numerical Solution of Differential EquatiMCQs on Numerical Methods 16. we = xy ty? aty(0) = Land k; = 0.1, ky = 0.1155, k; = 0.1172, ky = 0.13598, then the approximate value of y at x= 0.1 by Runge-Kutta forth order formula is (a)1.277 (b)1.1359 (c)1.1168 (d)1.1270 Ans: (c) 17I¢ 2 = xy +y? aty(0) = 1 then using Runge-Kutta method the value of ky = «+ with step size 0.1.is (a)0.1 (b)0.01 p- S)Atinl =o (c)0.001 (d)0.0001 a 7 mal Ans: (a) »-6)d 1970 a 18, The largest Eigen value for the matri a~\ey See (a)4.618 (b)1.586 14 (d)1.568 —— Ma SEE Ans: (c)MCQs on Numerical Methods = f(x,y), then the value ofy at x= x, by Runge-Kutta fourth order method is Vk, + 2kz + 2k3 + ky) 1+ 2ky + 2ky + ky 7 = 2k, + 2ky-ky) -3> $6 AMO Pky + 2hkg—ks) ’ ky + 2ky + 2k3+ks) 7 i LL 6 i) os 20. The largest Eigen value for the matrix 0 | using iterative method is (a) (b)2 3B (aya Ans: (c) tations | MathematiMCQs on Numerical Methods 1 21. Let ¥ =| 0 | be initial Eigen 0) vector while finding largest Eigen value i y method, first ( 24 ae ~ £2) +O ie +2, 7 ( oh: eee Eigen vector X"” for the matrix |2 0 2] can be found as 42 3 1 9 (a) | 0.48 (b) | 4 0.96 9 Ans: (c) Nu icrical Solution of Differential Equations | Mathematies-C:MCQs on Numerical Methods 1 " 4, s 22. Let X" =| 0 |be initial Eigen vector while finding largest Eigen value by iterative method, second @ ye ec 8 0 ed Ao YOu) = Y(otor) approximated Figen value 2° for the matrix | 1 2 7 = yu 003) J=Sot h fous, ) @)1 (b) 4 () 7 =1469 £000) Ans: (c) 23. Using Euler's method # (a) 1 Ay bl (d) 0.2 =\) Ans: (b) Elr@n [- =) ) Numerical Solutio of Differential Equations | Mathematies-Ganit ngrah | Satish TiwariMCQs on Numerical Methods 24. Using Euler's modifi WON) =... (a) Ll (b) 1.0909 (e) 1.0908 (@) 1.09 Ans: (c) 25. Using Euler's modified method, obtain the solution of equation “ =x+| vy : x with initial condition y-=1 at a method y(0.4) = 1.4927. (a) 1.5050 (b) 1.5253 () 1.5521 (d) 1.5626 Ans: (b) . find (0.4) with step size 0.2 and using Euler'sMCQs on Numerical Methods 26. Using Euler’s method (0.2) = 0.2, for the differential equation & yee, (0)=0. hx First approximated value of y(""(0.2 using Euler's modified method is given by (a) 0,2 (b) 0.2421 (c) 0.2464 (d) 0.2468 Ans: (b) 27.1 2 = $0? + xy"), given y(0) = 1, y'(0) = $y" =Ly" @)= then the approximate value of y at x= 0.1 by Taylor's series method (a)1.1112 (61.1359 (01.1168 (d)1.0553 Ans: (4) Numerical Solution of Differential Equations | Mathematics-Ganit Sangrah | Satish TiwariMCQs on Numerical Methods 28.1f 2 = x?y-1, given y(0) = 1, y (0) = -1,y" (0) = 0,y” (0) = 2 then the approximate value of y(0.1)=..... by Taylor's series method (a)0.8022 (b)0.9003 (c)0.7872 (d)0.6221 Ans: (b) 29. Given Bovey, w(0)=L andy, =14+x .... using Picard’s method ie (a) y,=l+xt + of Differential Equations | Mathem:MCQs on Numerical Methods ‘s 30. Given =2—*_ (O21, & =0.2, k, = 0.1667, k, = 0.1662, k, = 0.1414 and h= 0.2 2\ a yx : a", Then (0.2) =..... using Runge-Kutta method of fourth order is. (a) 0.688 (b) 1.2774 (c) 1.1678 (d) 1.2121 Ans: (c) , (0.2) = 1.1960 k, = 0.1891, k, = 0.1795, 0.1793, k, = 0.1688 and A= 0.2 Then y(0.4) can be found as (a) 1.4756 (b) 1.2774 (ec) 1.1678 (d) 1.3752 ..». using Runge-Kutta method of fourth order Ans: (d) Numerical Solution of Differential Equations | MatMCQs on Numerical Methods 0.2, =0.2, h=0.2 then ky (0) ==, ky = 32. Given ¥. 90) = J, =... using Runge-Kutta method of fourth order can be found respectively as (a) -0.1507.0.1642 (6) -0.142.0.162 (ec) 0.1507,-0.1642 (d) 0.142,-0.162 Ans: (b) 33. xy +4y =0, is equivalent to the set of two first order differential equations .... and.... while ae by Runge-Kutta method of fourth order can be found as Sangrah | Satish TiwariMCQs on Numerical Methods Se y= 0, is equivalent to the set of wo first order differential equations (B) (©) (1) (C),(2). 2 (A),3) © (B),(4) (D) (d) (1) © (C),(2) © (B).(3) @ (A).(4) 8 (D) Ans: (c) Numerical Sol ifferential Equations | Mathematics-Ganit Sangrah | Satish TiwariMCQs on Numerical Methods ‘e 2% 39. Match the correct pair 2 Column | Column Il oa (1) False Position Method (A) Series solution of differential Equation (2) Decomposition Method. B) First order first degree simultancous DE (3) Runge-Kutta Method of Fourth order, ) System of linear equation (4) Taylor's Scries Method ) Algebraic & Transcendental Equation (a) (1) <> (C),(2) © (D),(3) € (B),(4) (A) (b) (1) < (C),(2) (D),B) @ (A),(4) @ (B) (c) (1) € (D),(2) & (C),3) © (A), (4) @ (B) (d) (1) (D),(2) & (C), (3) (B),(4) (A) Ans: (d) it Sangeah | Satish TiwariMCQs on Numerical Methods 40. Runge-Kutta Method of fourth order is used to solve (1) First order first degree ordinary differential equation with initial condition (II) Simultaneous first order first degree ordinary differential equation with init (IID) Second order ordinary differential equation with constant coefficient an (a) Only (1) is correct (b) (1) & (II) both are correct (c) (II) and (If) are correct (4) (I) , ID, (IID) are correct Ans: (d) Tee Xena ee 8 ial condition tial condition. 41. Limitation of Picard’s Method is/are (1) It can be applied to limited class of equations in which the successive integrations can be performed casily. (II) The method can be extended to simultancous equations and equations of higher order. (a) Only (1) is correct (b) Only (II) is correct (c) both (1) & (Il) are correct (d) None of them are correct Ans: (c) N ion of Differential Equations | Mathem Sangrah | Satish TiwariMCQs on Numerical Methods 42. Taylor's Serie method provide (1) Approximate solution (Il) Exact Solution (a) Only (1) is correct (b) Only (II) is correct (c) both (1) & (IL) are correct (d) None of them are correct Ans:(c) 43. In Euler's method, the curve of solution is approximated by (a) tangent in cach interval (b) chord in cach interval (c) rectangle in cach interval (d) triangle in each interval (a) 44. Which of the method is known as predictor corrector method (1) Milne’s Method (ID) Euler's Modified Method (IID Taylor's Serie Method (a) Only (1) is correct (c) (I) and (IIL) are correct (b) (1) & (II) are correct (4) (1). AD, (ID) are correct Equations | Mathematics-Ganit Sangrah | Satish TiwariMCQs on Numerical Methods 45, Runge-Kutta method of fourth order is applied to (1) Linear differential equation (Il) Non-linear differential equation (a) Only (1) is correct (b) Only (II) is correct (c) both (I) & (II) are correct (d) None of them are correct Ans: (c) 46. In which of the following method four prior values are required for finding the value ofy at x,, (a) Taylor's Series method (b) Euler's Modified method (c) Runge-Kutta method of fourth order (d) Milne’s method Ans: (d)MCQs on Numerical Methods dz 7 7 47. For the differential equations = =l+axz, & =-xy with step size A= 0.3 hv the value of k, and /, using fourth order Runge-Kutta method can be calculated as (a) 0,0 (b) 0.3,0 (c) 0,0.3 (d) 0.3,0.3 Ans: (b) 48, Which of the following is step by step method (a) Taylor's (b) Picard’s (c) Adams Basforth (d) None Ans: (c) 49.The first approximate value of y; i. c. y{") using modified Euler's method for the equation 2 = for x = 0.1 given y(0) .05, 1 = 1.05 is ere n(Frea) the (a)1.05 er a 1.0525 7 i) (€)1.5025 (a)1.505 2 VF (4 Oy tf OW Lot " 4oret) {@n) + (0-25 +10) ish Tiwari Ans: (b) Numerical Sol Equations | Mathem:50. Match the following: A. Newton-Raphson B. Runge-Kutta C. Gauss-Seidel D. Simpson’s Rule Codes: ABCD (a) 3214 (b) 2341 Ans: (b) Numerical Solution of Different MCQs on Numerical Methods 1. Integration 2. Root finding 3. Ordinary D.E. 4. Solution of system of Linear Equations (c) 1423 (d) None of these Sangrah | Satish Tiwari