Scribd
Upload
8K views

Numerical Methods MCQ

The document contains 10 multiple choice questions about numerical methods and discrete mathematics: 1) The bisection method for finding roots is guaranteed to work for all continuous functions. 2) The convergence of the Newton-Raphson method is sensitive to the starting value. 3) When using Newton-Raphson to solve √x, with an initial guess of x0 = 1, the subsequent estimate x1 will be 1.414. 4) The Newton-Raphson method is not preferred when the graph of the function is nearly horizontal at the point where it crosses the x-axis.

Uploaded by

bhattoo07
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
8K views

Numerical Methods MCQ

The document contains 10 multiple choice questions about numerical methods and discrete mathematics: 1) The bisection method for finding roots is guaranteed to work for all continuous functions. 2) The convergence of the Newton-Raphson method is sensitive to the starting value. 3) When using Newton-Raphson to solve √x, with an initial guess of x0 = 1, the subsequent estimate x1 will be 1.414. 4) The Newton-Raphson method is not preferred when the graph of the function is nearly horizontal at the point where it crosses the x-axis.

Uploaded by

bhattoo07
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

Numerical Methods MCQ

1. Which of the following statements applies to the bisection method used for finding roots of
functions?
A. Converges within a few iterations
B. Guaranteed to work for all continuous functions
C. Is faster than the Newton-Raphson method
D. Requires that there be no error in determining the sign of the function

2. The convergence of which of the following method is sensitive to starting value?

A. False position
B. Gauss seidal method
C. Newton-Raphson method
D. All of these

3. We wish to solve by Newton Raphson technique. If initial guess is x0 = 1.0,


subsequent estimate of x (i.e. x1) will be

A. 1.414
B. 1.5
C. 2.0
None of
D.
these
4. Newton-Raphson method of solution of numerical equation is not preferred when

A. Graph of A(B) is vertical


B. Graph of x(y) is not parallel
C. The graph of f(x) is nearly horizontal-where it crosses the x-axis.
D. None of these

5. Newton-Raphson method is applicable to the solution of

A. Both algebraic and transcendental Equations


B. Both algebraic and transcendental and also used when the roots are complex
C. Algebraic equations only
D. Transcendental equations only
6. In which of the following methods proper choice of initial value is very important?

A. Bisection method
B. False position
C. Newton-Raphson
D. Bairsto method
7. Let f(x) be an equation such that f(a) f(b) > 0 for two real numbers a and b. Then
at least one root of f(x) = 0 lies in (a, b)
no root lies in (a, b)
either no root or an even number of roots lie in (a, b)
None of these.
8. Order of convergence of Newton-Raphson method is
1
1.618
2
None of these
9. In Regular-falsi method, the first approximation is given by
af (b) bf (a ) bf (b) af (a ) bf (a ) af (b)
a) x1 b) x1 c) x1 d)
f (b) f (a ) f (b) f (a ) f (a ) f (b)
af (a ) bf (b)
x1
f (a ) f (b)

10. The Newton-Raphson method fails when


a) f ' x is negative b) f ' x is too large c) f ' x is zero d) Never fails.

Discrete Mathematics MCQ


a) K4 is planar while Q3 is not
b) Both K4 and Q3 are planar
c) Q3 is planar while K4 is not
d) Neither K4 nor Q3 are planar

2. What is the chromatic number of an n-vertex simple connected graph which does not contain
any odd length cycle? Assume n >= 2.
a) 2
b) 3
C c) n-1
D d) n

3. Let G be the non-planar graph with the minimum possible number of edges. Then G has

A 9 edges and 5 vertices


B 9 edges and 6 vertices
C 10 edges and 5 vertices
10 edges and 6 vertices

4. Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces
in the planar embedding of the graph is
D
a) 6
b) 8
c) 9
d) 13
5.

Which one of the Following is not Planer graph

a) G1 b) G2 c)G3 d)G4

6. The minimum number of colours required to colour the following graph,

a)2 b) 3 c)4 d)5

7. What is the chromatic number of the following graph?

a) 2 b)3 c)4 d) 5

8. The maximum number of edges in a bipartite graph on 12 vertices is_

a)34 b)3 c)36 d)30

9. Let G be the non-planar graph with the minimum possible number of vertices. Then G has

A 9 edges and 5 vertices


B 9 edges and 6 vertices
C 10 edges and 5 vertices
e) 10 Vertices and 10 Edges

You might also like