Numerical Analysis MCQ

Test your knowledge with important Numerical Analysis MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Numerical Analysis MCQs at Bissoy

• The parameter E which we use for least square method is called as ____________
  ক

  Sum of residues

  খ

  Residues

  গ

  Error

  ঘ

  Sum of errors
• If the equation y=axb can be written in the linear form Y=A+BX, what are Y, X, A, B?
  ক

  Y=logy, A=loga, B=b and X=logx

  খ

  Y=y, A=a, B=b and X=x

  গ

  Y=y, A=a, B=logb and X=logx

  ঘ

  Y=logy, A=a, B=logb and X=x
• If the equation y=abx can be written in linear form Y=A+BX, what are Y, X, A, B?
  ক

  Y=logy, X=x, A=loga and B=logb

  খ

  Y=y, A=a, B=b and X=x

  গ

  Y=y, A=a, B=logb and X=logx

  ঘ

  Y=logy, A=a, B=logb and X=x
• Find x if x0 = 0.6, n = 2.6 and h = 0.2.
  ক

  12

  খ

  1.2

  গ

  1.12

  ঘ

  1.22
• Find n if x0 = 0.75825, x = 0.759 and h = 0.00005.
  ক

  1.5

  খ

  15

  গ

  2.5

  ঘ

  25
• Newton- Gregory Forward interpolation formula can be used _____________
  ক

  only for equally spaced intervals

  খ

  only for unequally spaced intervals

  গ

  for both equally and unequally spaced intervals

  ঘ

  for unequally intervals
• Which of the following methods is used for obtaining the inverse of matrix?
  ক

  Gauss Seidel method

  খ

  Newton Raphson method

  গ

  Gauss Jordan method

  ঘ

  Secant Method
• Which of the following transformations are allowed in Gauss Jordan method?
  ক

  Swapping a row

  খ

  Swapping a column

  গ

  Swapping two rows

  ঘ

  Swapping two columns
• The augmented matrix in Gauss Jordan method is reduced to ______________
  ক

  Row Echelon form

  খ

  Column Echelon form

  গ

  Matrix Echelon form

  ঘ

  Augmented form
• In Gauss Jordan method which of the following transformations are allowed?
  ক

  Diagonal transformation

  খ

  Column transformation

  গ

  Row transformation

  ঘ

  Square transformation
• The reduced form of the Matrix in Gauss Elimination method is also called ____________
  ক

  Column Echelon Form

  খ

  Row-Column Echelon Form

  গ

  Column-Row Echelon Form

  ঘ

  Row Echelon Form
• The Elimination process in Gauss Elimination method is also known as _____________
  ক

  Forward Elimination

  খ

  Backward Elimination

  গ

  Sideways Elimination

  ঘ

  Crossways Elimination
• In Gaussian elimination method, original equations are transformed by using _____________
  ক

  Column operations

  খ

  Row Operations

  গ

  Mathematical Operations

  ঘ

  Subset Operation
• In which of the following both sides of equation are multiplied by non-zero constant?
  ক

  Gauss Elimination Method

  খ

  Gaussian Inconsistent procedure

  গ

  Gaussian consistent procedure

  ঘ

  Gaussian substitute procedure
• Division by zero during in Gaussian elimination of the set of equations * = signifies the coefficient matrix is ____________
  ক

  * = signifies the coefficient matrix is ____________ ] Invertible

  খ

  A

  গ

  A

  ঘ

  A
• The aim of elimination steps in Gauss elimination method is to reduce the coefficient matrix to ____________
  ক

  diagonal

  খ

  identity

  গ

  lower triangular

  ঘ

  upper triangular
• The points where the Newton Raphson method fails are called?
  ক

  floating

  খ

  continuous

  গ

  non-stationary

  ঘ

  stationary
• If f(x) = x2-117 = 0 then the iterative formula for Newton Raphson Method is given by ____________ b) x(n+1)=0.5 c) x(n+1)=0.5 d) x(n+1)=0.25
  ক

  x(n+1)=0.25

  খ

  x(n)+\(\frac{166}{x(n)}\)

  গ

  x(n)+\(\frac{166}{x(n)}\)

  ঘ

  x(n)+\(\frac{166}{x(n)}\)
• In Newton Raphson method f’(x) for a given point is given by the formula ____________
  ক

  y/x’

  খ

  y’/x

  গ

  y/x

  ঘ

  y’/x’
• The Newton Raphson method is also called as ____________
  ক

  Tangent method

  খ

  Secant method

  গ

  Chord method

  ঘ

  Diameter method
• The value of y’/x’ in terms of the angle 0 is given by _____________
  ক

  tanθ

  খ

  secθ

  গ

  cotθ

  ঘ

  cosecθ
• The Newton Raphson method fails if __________
  ক

  f’(x0)=0

  খ

  f’’(x0)=0

  গ

  f(x0)=0

  ঘ

  f’’’(x0)=0
• At which point the iterations in the Newton Raphson method are stopped?
  ক

  When the consecutive iterative values of x are not equal

  খ

  When the consecutive iterative values of x differ by 2 decimal places

  গ

  When the consecutive iterative values of x differ by 3 decimal places

  ঘ

  When the consecutive iterative values of x are equal
• In Newton Raphson method if the curve f f(x) is constant then __________
  ক

  f’’(x)=0

  খ

  f(x)=0

  গ

  f’(x)=0

  ঘ

  f’(x)=c
• If f(x) = x2 – 153 = 0 then the iterative formula for Newton Raphson Method is given by __________ b) x(n+1) = 0.5 c) x(n+1) = d) x(n+1) =
  ক

  x(n+1) = 0.5

  খ

  x(n)+\(\frac{153}{x(n)}\)

  গ

  x(n)+\(\frac{153}{x(n)}\)

  ঘ

  x(n)+\(\frac{153}{x(n)}\)
• The Newton-Raphson method of finding roots of nonlinear equations falls under the category of which of the following methods?
  ক

  bracketing

  খ

  open

  গ

  random

  ঘ

  graphical
• Rate of convergence of the Newton-Raphson method is generally __________
  ক

  Linear

  খ

  Quadratic

  গ

  Super-linear

  ঘ

  Cubic
• The number of iterations in Secant Method are less as compared to Newton Raphson.
  ক

  True

  খ

  False
• Secant Method is slower than Newton Raphson Method.
  ক

  True

  খ

  False
• Secant method converges faster than Bisection method.
  ক

  True

  খ

  False