Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Feedback

Finding the Roots of Algebraic and Transcendental Equations using Numerical Methods

Choose difficulty:

Beginner

Intermediate

Advanced

Which of the following is an iterative method?

a: Gauss Seidel Explanation

Explanation

b: Factorization Explanation

Explanation

c: Gauss Jordan Explanation

Explanation

d: Gauss Elimination Explanation

Explanation

Which of the following is also known as the Newton Raphson method?

a: Chord Method Explanation

Explanation

b: Tangent Method Explanation

Explanation

c: Diameter Method Explanation

Explanation

d: Secant Method Explanation

Explanation

Which of the following methods always converges but may be slower?

a: Bisection Method Explanation

Explanation

b: Newton-Raphson Method Explanation

Explanation

c: Secant Method Explanation

Explanation

d: Regula Falsi Method Explanation

Explanation

The Newton-Raphson method requires which of the following for iteration?

a: Only function values Explanation

Explanation

b: Only derivative values Explanation

Explanation

c: Both function and derivative values Explanation

Explanation

d: No values required Explanation

Explanation

Which of the following is NOT a bracketing method?

a: Bisection Method Explanation

Explanation

b: Regula Falsi Method Explanation

Explanation

c: Secant Method Explanation

Explanation

d: False Position Method Explanation

Explanation

In the Bisection Method, the root lies between two points if:

a: f(a) * f(b) > 0 Explanation

Explanation

b: f(a) * f(b) < 0 Explanation

Explanation

c: f(a) = f(b) Explanation

Explanation

d: f(a) + f(b) = 0 Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)