RAJIV GANDHI PRODYOGIKI VISHWAVIDYALAYA (RGPV)

MATHEMATICS – III
MCQS
Module 2

Match the following:

A. Runge-Kutta 1. Integration
B. Simpson’s Rule 2. Root finding of algebraic or transcendental equation
C. Gauss-Seidel 3. Ordinary Differential Equations
D. Newton’s Raphson 4. Solution of system of Linear Equations

The correct sequence is

 A2-B3-C4-D1
 A3-B1-C4-D2
 A3-B4-C2-D3
 A4-B1-C2-D3

The Coefficient matrix in the system of n linear equations with n variables are reduce to
________________ when solved by Gauss- Elimination method

 Lower Triangular matrix

 Upper Triangular Matrix
 Orthogonal Matrix
 Diagonal matrix
If ( ) ( ) ( ), then for ( ) ( )
 0
 1



The error arise in Simpson’s rule for numerical integration with step size has order





Which of the following is an iterative method?

 Gauss Jordan
 Gauss Elimination
 Gauss seidal
 Factorization
Number of iteration depends on the _________

 Initial value taken to start the iteration

 Type of linear equations
 Number of unknowns
 Approximations to be done

The following system of equation has:

x+y+z=4

3x + 3y + 3z = 12

5x + 5y + 6z = 10

• Unique Solution

• No solution

• Infinitely many Solutions

• Finite solutions
While evaluating the definite integral by Trapezoidal rule, the accuracy can be increased by taking -

 Large number of sub-interval

 Even number of sub-intervals
 Odd number of sub-intervals
 Number of intervals is multiple of 3

In solving simultaneous equation by Gauss-Jordan method, the coefficient matrix is reduced to

 Unit Matrix
 Diagonal Matrix
 Null Matrix
 Square Matrix

Simpson 1/3rd rule is used only when the number of intervals n _____

 n is multiple of 3
 n is odd
 n is even
 n is multiple of 2 or 3
Which of the following methods is used for obtaining the inverse of matrix?

 Gauss Seidel method

 Newton Raphson method
 Gauss Jordan method
 Secant Method

For solving system of equation AX=B using Crout’s method

A= LU

* +, * +






Which of the following is an assumption of Jacobi’s method?

 The coefficient matrix has no zeros on its main diagonal

 The rate of convergence is quite slow compared with other methods
 Iteration involved in Jacobi’s method converges
 The coefficient matrix has zeroes on its main diagonal
The transformation of coefficient matrix A (in AX=B) to upper triangular matrix is done using

 Elementary row transformations

 Simultaneous row and column transformation
 Successive division
 Elementary column transformations

What is the main difference between Jacobi’s and Gauss-Seidal?

 Computations in Jacobi’s can be done in parallel but not in Gauss-seidal

 Convergence in Jacobi’s method is faster
 Gauss seidal cannot solve the system of linear equations in three variables whereas Jacobi
cannot
 Deviation from the correct answer is more in gauss seidal

Which of the following is not an iterative method?

 Jacobi’s method
 Gauss Seidal method
 Relaxation method
 Gauss Jordan method
Which of the methods is direct method for solving simultaneous algebraic equations?

 Jacobi’s method
 Relaxation method
 Cramer’s rule
 Gauss seidel method

The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeroes along
________

 Leading diagonal
 Last column
 Last row
 Non-leading diagonal

All the Best

Regards

Dr. Atul Kumar Ray

Visit and Subscribe the Channel.

https://www.youtube.com/channel/UCYg9RXUfbL1fdQhk1KdFsZQ