1. Find the root of x4-x-10 = 0 approximately up to 5 iterations using Bisection Method.

Let a = 1.5 and b = 2.

a) 1.68
b) 1.86
c) 1.88
d) 1.66
2. 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
Can not Determine
Both

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

Bisection method.
a) 0.655
b) 0.665
c) 0.565
d) 0.656

4. The Bisection method is also known as ___________________

a) Binary Chopping
b) Quaternary Chopping
c) Tri region Chopping
d) Hex region Chopping

5. Using Bisection method find the root of 3x2 = 5x+2 in the interval [0,3].
a) 0.617
b) 0.527
c) 0.517
d) 0.717

6. 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

7. 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
8. The Bisection method has which of the following convergences?
a) Linear
b) Quadratic
c) Cubic
d) Quaternary

9. Rate of convergence of the Newton-Raphson method is generally __________

a) Linear
b) Quadratic
c) Super-linear
d) Cubic

10. 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

11. 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

12. 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)

13. 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

14. The equation f(x) is given as x2-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.
15. 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 equal33

16. The Newton Raphson method fails if __________

a) f’(x0)=0
b) f’’(x0)=0
c) f(x0)=0
d) f’’’(x0)=0

17. The Newton Raphson method is also called as ____________

a) Tangent method
b) Secant method
c) Chord method
d) Diameter method

18. The equation f(x) is given as x2-4=0. Considering the initial approximation at x=6 then
the value of x1 is given as ____________
a) 10/3
b) 4/3
c) 7/3
d) 13/3

19. 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

20. 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’

21. The points where the Newton Raphson method fails are called?
a) floating
b) continuous
c) non-stationary
d) stationary
22. Which of the methods is direct method for solving simultaneous algebraic equations?
a) Jacobi’s method
b) Relaxation method
c) Cramer’s rule
d) Gauss seidel method

23. What are the advantages of direct methods for solving the simultaneous algebraic
equations?
a) Rounding of errors get propagated
b) Quite time consuming
c) Requires more recording of data
d) Yield a solution after a finite number of steps for any non-singular set of
equations

24. Numerical techniques more commonly involve _______

a) Iterative method
b) Direct method
c) Elimination method
d) Reduction method

25. Iteration is also called as ________

a) Accurate process
b) Self-correcting process
c) Approximate process
d) Rounding off process

26. Which of the following is an iterative method?

a) Gauss Jordan
b) Gauss Elimination
c) Gauss seidal
d) Factorization

27. Which of the following is not an iterative method?

a) Jacobi’s method
b) Gauss Seidal method
c) Relaxation method
d) Gauss Jordan method

28. Number of iteration depends on the _________

a) Initial value taken to start the iteration
b) Type of linear equations
c) Number of unknowns
d) Approximations to be done

29. olve the given system of equation by Gauss Elimination method.

3x + 4y – z = -6
 -2y + 10z = -8
4y – 2z = -2
a) (-2, -1, -1)
b) (-1, -2, -1)
c) (-1, -1, -2)
d) (-1, -1, -1)
30. Solve this system of equations and comment on the nature of the solution using Gauss
Elimination method.
x+y+z=0
-x – y + 3z = 3
-x – y – z = 2
a) Unique Solution
b) No solution
c) Infinitely many Solutions
d) Finite solutions

31. The aim of elimination steps in Gauss elimination method is to reduce the coefficient
matrix to ____________
a) diagonal
b) identity
c) lower triangular
d) upper triangular

32. Division by zero during in Gaussian elimination of the set of equations [A] * [X]=[C]
signifies the coefficient matrix [A] is ____________
a) Invertible
b) Non Singular
c) Not determinable to be singular or non singular
d) Singular

33. In Gaussian elimination method, original equations are transformed by using

_____________
a) Column operations
b) Row Operations
c) Mathematical Operations
d) Subset Operation

34. The Elimination process in Gauss Elimination method is also known as

_____________
a) Forward Elimination
b) Backward Elimination
c) Sideways Elimination
d) Crossways Elimination

35. The reduced form of the Matrix in Gauss Elimination method is also called
____________
 a) Column Echelon Form
b) Row-Column Echelon Form
c) Column-Row Echelon Form
d) Row Echelon Form

36. What are the coefficients of the equation obtained during the elimination called?
a) Joints
b) Pivots
c) Calculated coefficients
d) Operative coefficients

37. How the transformation of coefficient matrix A to upper triangular matrix is done?
a) Elementary row transformations
b) Elementary column transformations
c) Successive multiplication
d) Successive division

38. In Gauss Jordan method which of the following transformations are allowed?
a) Diagonal transformation
b) Column transformation
c) Row transformation
d) Square transformation

39. The augmented matrix in Gauss Jordan method is reduced to ______________

a) Row Echelon form
b) Column Echelon form
c) Matrix Echelon form
d) Augmented form

40. Which of the following transformations are allowed in Gauss Jordan method?
a) Swapping a row
b) Swapping a column
c) Swapping two rows
d) Swapping two columns

41. The Gauss Jordan method reduces a original matrix into a _____________
a) Identity matrix
b) Null matrix
c) Skew Hermitian matrix
d) Non-symmetric matrix

42. Which of the following methods is used for obtaining the inverse of matrix?
a) Gauss Seidel method
b) Newton Raphson method
c) Gauss Jordan method
d) Secant Method
43. Gauss Seidal method is also termed as a method of _______
a) Successive displacement
b) Eliminations
c) False positions
d) Iterations

44. Gauss seidal method is similar to which of the following methods?

a) Iteration method
b) Newton Raphson method
c) Jacobi’s method
d) Regula-Falsi method

45. What is the main difference between Jacobi’s and Gauss-seidal?

a) Computations in Jacobi’s can be done in parallel but not in Gauss-seidal
b) Convergence in Jacobi’s method is faster
c) Gauss seidal cannot solve the system of linear equations in three variables whereas
Jacobi cannot
d) Deviation from the correct answer is more in gauss seidal

46. The Gauss-Seidel method is applicable to strictly diagonally dominant or

symmetric________ definite matrices.
a) Positive
b) Negative
c) Zero
d) Equal

47. Which of the following method is employed for solving the system of linear
equations?
a) Runge Kutta
b) Newton Raphson
c) Gauss Seidal
d) Simpson’s Rule

48. What is the limitation of Gauss-seidal method?

a) It cannot be used for the matrices with non-zero diagonal elements
b) It is more complex than Jacobi’s method
c) It doesn’t guarantees convergence for each and every matrix
d) It is an iterative technique

49. The modification of Gauss elimination method is called as ___________

a) Gauss Seidal
b) Gauss Jordan
c) Jacobi’s Method
d) Relaxation Method
50.  Which of the following is not a step involved in Gauss Jordan Method?
a) Elimination of unknowns
b) Reduction of systems to diagonal matrix form
c) Performing elimination on equations above as well as below
d) Evaluation of cofactors