Explore topic-wise MCQs in Computational Fluid Dynamics.

This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Computational Fluid Dynamics knowledge and support exam preparation. Choose a topic below to get started.

1.

Which of these is correct for the multipoint method?

A. multiple derivatives at each time step
B. only one evaluation of derivative per time step
C. order of accuracy is restricted to four
D. extremely unstable
Answer» C. order of accuracy is restricted to four
Discussion
2.

Which of these is used by the Adam-Bashforth method?

A. Newton s method
B. Frobenious covariant
C. Frobenious norm
D. Lagrange polynomial
Answer» E.
Discussion
3.

The Adam-Bashforth method is ____________

A. an explicit method
B. an implicit method
C. a first-order accurate method
D. a second-order accurate method
Answer» B. an implicit method
Discussion
4.

To increase the order of accuracy, the multipoint method uses ___________

A. highly stable two-level methods for prediction and correction
B. higher-order two-level methods for prediction and correction
C. additional points where data is already available
D. additional points where data is interpolated
Answer» D. additional points where data is interpolated
Discussion
5.

The predictor-corrector method is maximum ___________

A. second-order accurate
B. cannot be defined
C. third-order accurate
D. fourth-order accurate
Answer» C. third-order accurate
Discussion
6.

The stability of the two-level predictor-corrector method matches with that of the __________

A. midpoint rule
B. trapezoidal rule
C. backward Euler method
D. forward Euler method
Answer» E.
Discussion
7.

The two-level predictor-corrector method is __________

A. second-order accurate
B. first-order accurate
C. fourth-order accurate
D. third-order accurate
Answer» B. first-order accurate
Discussion
8.

Which of these formulae is used for the corrector step of the two-level predictor-corrector method?

A. <sup>n+1</sup>= <sup>n</sup>+ ( frac{1}{3} ) [2f(t<sup>n</sup>, <sup>n</sup> )+f(t<sup>n+1</sup>, <sup>n+1*</sup>)] t
B. <sup>n+1</sup>= <sup>n</sup>+ ( frac{1}{2} ) [2f(t<sup>n</sup>, <sup>n</sup> )+f(t<sup>n+1</sup>, <sup>n+1*</sup>)] t
C. <sup>n+1</sup>= <sup>n</sup>+ ( frac{1}{3} ) [f(t<sup>n</sup>, <sup>n</sup> )+2f(t<sup>n+1</sup>, <sup>n+1*</sup>)] t
D. <sup>n+1</sup>= <sup>n</sup>+ ( frac{1}{2} ) [f(t<sup>n</sup>, <sup>n</sup> )+f(t<sup>n+1</sup>, <sup>n+1*</sup>)] t
Answer» E.
Discussion
9.

In the two-level predictor-corrector method, the prediction is done using _____________

A. trapezoidal rule
B. explicit Euler method
C. midpoint rule
D. implicit Euler method
Answer» C. midpoint rule
Discussion
10.

The predictor-corrector method is a combination of ______________

A. midpoint and trapezoidal rules
B. backward Euler method and Trapezoidal rule
C. implicit and explicit methods
D. forward and backward Euler methods
Answer» D. forward and backward Euler methods
Discussion