Scribd
Upload
14 views28 pages

Jrs Mantra, Patna: Objective Question Marathon - 8

The document consists of a series of objective questions related to numerical methods and techniques, including iterative and direct methods for solving equations. It covers various topics such as the bisection method, fixed-point iteration, and the Newton-Raphson method, along with their advantages, limitations, and convergence rates. Each question provides multiple-choice answers to assess understanding of these numerical analysis concepts.

Uploaded by

dinesh8474dk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views28 pages

Jrs Mantra, Patna: Objective Question Marathon - 8

The document consists of a series of objective questions related to numerical methods and techniques, including iterative and direct methods for solving equations. It covers various topics such as the bisection method, fixed-point iteration, and the Newton-Raphson method, along with their advantages, limitations, and convergence rates. Each question provides multiple-choice answers to assess understanding of these numerical analysis concepts.

Uploaded by

dinesh8474dk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 28

JRS MANTRA, PATNA

Objective Question
Marathon - 8

By Nilesh Sir
QUESTION 01
 Choose the most suitable answer from the following options:

 The time taken to solve a system of equations using direct method


is more than the time taken by iterative methods.
 (a) True

 (b) False

 (c) both (a) and (b)

 (d) none of these


QUESTION 02
 The process of constructing a sequence of vectors and obtaining
the solution of a system using specified accuracy is called

 (a) Elimination

 (b) Reduction

 (c) Iteration

 (d) Raphson method


QUESTION 03
 Numerical techniques more commonly involve

 (a) Iterative method

 (b) Direct method

 (c) Elimination method

 (d) Reduction method


QUESTION 04
 What is the primary drawback of using direct methods of
solution?

 (a) They yield solution after a certain amount of fixed


computation

 (b) They have large calculations involved

 (c) They make use of back substitution

 (d) They do not achieve the desirable accuracy


QUESTION 05
 In an iterative method, the amount of computation depends on
the

 (a) Number of variables

 (b) Degree of accuracy

 (c) Rounding of errors

 (d) Ease of using the operators


QUESTION 06
 Iteration is also called as

 (a) Accurate process

 (b) Self-correcting process

 (c) Approximate process

 (d) Rounding off process


QUESTION 07
 Which of the following is an iterative method?

 (a) Gauss Jordan

 (b) Gauss Elimination

 (c) Gauss seidal

 (d) Factorization
QUESTION 08
 Why iterative methods are called as self correcting?

 (a) Iterations involve repetition

 (b) Checks occurring during the process ensure that the errors are
reduced

 (c) Any error made at any stage of computation gets automatically


corrected in the subsequent steps

 (d) After each step, validity of the method is checked


QUESTION 09
 Which of the following is not an iterative method?

 (a) Jacobi's method

 (b) Gauss Seidal method

 (c) Relaxation method

 (d) Gauss Jordan method


QUESTION 10
 Number of iteration depends on the

 (a) Initial value taken to start the iteration

 (b) Type of linear equations

 (c) Number of unknowns

 (b) Approximations to be done


QUESTION 11
 What is the primary objective of the bisection method in
numerical analysis?

 (a) Maximizing computational efficiency

 (b) Finding all roots of a polynomial

 (c) Locating a root within a given interval

 (d) Minimizing the number of function evaluations


QUESTION 12
 In the bisection method, how is the next interval determined
after evaluating the function at the midpoint?

 (a) By comparing the midpoint with the endpoints

 (b) By halving the interval

 (c) By evaluating the function at both endpoints

 (d) By adjusting based on the derivative


QUESTION 13
 What is the convergence rate of the bisection method?

 (a) Linear convergence

 (b) Quadratic convergence

 (c) Exponential convergence

 (d) Convergence rate varies with the function


QUESTION 14
 Which of the following conditions is necessary for applying the
bisection method?

 (a) The function must be continuous

 (b) The function must be differentiable

 (c) The function must be polynomial

 (d) The function must be monotonic


QUESTION 15
 In the bisection method, how does the width of the interval
change with each iteration?

 (a) It decreases by a constant factor

 (b) It increases by a constant factor

 (c) It decreases by a constant amount

 (d) It varies depending on the function


QUESTION 16
 What is the advantage of the bisection method over other root-
finding methods?

 (a) It guarantees convergence to the root

 (b) It requires fewer iterations

 (c) It can handle complex functions

 (d) It always finds all roots within an interval


QUESTION 17
 What is the primary goal of the fixed-point iteration method in
numerical analysis?

 (a) Maximizing computational efficiency

 (b) Finding the derivative of a function

 (c) Converging to a fixed point of a function

 (d) Minimizing the number of function evaluations


QUESTION 18
 How is the fixed-point iteration method initialized?

 (a) By setting an initial guess for the root

 (b) By finding the derivative of the function

 (c) By setting an upper bound for the interval

 (d) By choosing an arbitrary function


QUESTION 19
 What condition ensures convergence of the fixed-point iteration
method?

 (a) The function must be differentiable

 (b) The function must be continuous

 (c) The function must be polynomial

 (d) The function must have a root


QUESTION 20
 In fixed-point iteration, what does the iteration formula look
like?

 (a) x=f(x)

 (b) x = f’(x)

 (c) 1=x-f(x)

 (d) x=x+f(x)
QUESTION 21
 How is the stopping criterion typically determined in fixed-point
iteration?

 (a) When the iteration count exceeds a predefined limit

 (b) When the function value approaches zero

 (c) When the difference between consecutive iterates is small

 (d) When the derivative of the function becomes zero


QUESTION 22
 What is limitation of the fixed-point iteration method?

 (a) It always converges to the exact root

 (b) It may diverge for certain functions

 (c) It requires knowledge of the derivative

 (d) It is not suitable for nonlinear equations


QUESTION 23
 What is the primary objective of the secant method in numerical
analysis?

 (a) Maximizing computational efficiency

 (b) Locating a root within a given interval

 (c) Minimizing the number of function evaluations

 (d) Ensuring convergence to the global minimum


QUESTION 24
 Rase of convergence of the Newton-Raphson method is generally
convergence to the

 (a) linear

 (c) super-linear

 (b) quadratic

 (d) cubic
QUESTION 25
 The equation f(x) is given as x³-x2 +4x-4=0. Considering the initial
approximation at x = 2, then the value of next approximation
correct upto 2 decimal places is given by

 (a) 0.67

 (b) 1.33

 (c) 1.00

 (d) 1.50
QUESTION 26
 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
Thank
You

You might also like