Explore topic-wise InterviewSolutions in .

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

51.

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 interpolatedThe question was posed to me in my homework.Asked question is from Transient Flows in portion Transient Flows of Computational Fluid Dynamics

Answer»

The CORRECT ANSWER is (c) ADDITIONAL points where data is already available

For explanation I would say: To increase the order of accuracy of the predictor-corrector method, multiple points are USED instead of two points. The EXTRA points are those obtained from the previous calculations.

52.

The predictor-corrector method is maximum ___________(a) second-order accurate(b) cannot be defined(c) third-order accurate(d) fourth-order accurateThe question was posed to me during an interview for a job.My enquiry is from Transient Flows topic in portion Transient Flows of Computational Fluid Dynamics

Answer»
53.

Which of these formulae is used for the corrector step of the two-level predictor-corrector method?(a) Φ^n+1=Φ^n+\(\frac{1}{3}\) [2f(t^n,Φ^n )+f(t^n+1,Φ^n+1*)]Δt(b) Φ^n+1=Φ^n+\(\frac{1}{2}\) [2f(t^n,Φ^n )+f(t^n+1,Φ^n+1*)]Δt(c) Φ^n+1=Φ^n+\(\frac{1}{3}\) [f(t^n,Φ^n )+2f(t^n+1,Φ^n+1*)]Δt(d) Φ^n+1=Φ^n+\(\frac{1}{2}\) [f(t^n,Φ^n )+f(t^n+1,Φ^n+1*)]ΔtThe question was posed to me in exam.I'd like to ask this question from Transient Flows in portion Transient Flows of Computational Fluid Dynamics

Answer»

The correct CHOICE is (d) Φ^n+1=Φ^n+\(\frac{1}{2}\) [f(t^n,Φ^n )+f(t^n+1,Φ^n+1*)]Δt

Best explanation: The predicted RESULT of the two-level prediction-correction method is CORRECTED using the trapezoidal rule. The trapezoidal rule uses the linear interpolation between two time POINTS. The formula is

Φ^n+1=Φ^n+\(\frac{1}{2}\) [f(t^n,Φ^n )+f(t^n+1,Φ^n+1*)]Δt.

54.

Which of these methods is stable for non-linear systems?(a) Forward Euler method(b) Backward Euler method(c) Trapezoidal method(d) Midpoint ruleThis question was posed to me in unit test.My question is based upon Transient Flows in portion Transient Flows of Computational Fluid Dynamics

Answer»

The CORRECT choice is (b) Backward Euler method

For explanation I would SAY: Though the trapezoidal rule is unconditionally stable, it is not the case for non-linear problems. But, the backward Euler method behaves well and SMOOTH for non-linear systems ALSO. They PRODUCE smooth results for large time steps too.

55.

What is the equivalent of (ρC ΦC)^t+Δt/2 using the second-order upwind Euler scheme for finite volume approach?(a) \(\frac{3}{2}\) (ρC ΦC)^t+(ρC ΦC)^t-Δt(b) (ρC ΦC)^t+\(\frac{1}{2}\) (ρC ΦC)^t-Δt(c) \(\frac{3}{2}\) (ρC ΦC)^t+\(\frac{1}{2}\) (ρC ΦC)^t-Δ t(d) \(\frac{1}{2}\)(ρC ΦC)^t+\(\frac{1}{2}\) (ρC ΦC)^t-Δ tI have been asked this question by my college director while I was bunking the class.My question is taken from Transient Flows topic in portion Transient Flows of Computational Fluid Dynamics

Answer»
56.

Which of these statements about the Adams-Moulton method is correct?(a) It involves the terms at the older time-step only(b) It involves the terms at the next time-step(c) It does not involve iterations(d) It does not involve older stepsThis question was posed to me in unit test.This intriguing question originated from Transient Flows in division Transient Flows of Computational Fluid Dynamics

Answer»

Right option is (b) It INVOLVES the terms at the next time-step

Easy explanation: The Adams-Moulton method involves the INFORMATION at the UPCOMING steps also. The ADVANTAGE of the Adams-Moulton method is that it NEEDS only n steps to get an order of accuracy equal to n+1.

57.

The Adams-Moulton scheme comes under ____________(a) Backward schemes(b) Forward schemes(c) Multipoint schemes(d) Runge-Kutta methodsThis question was posed to me in unit test.The doubt is from Transient Flows in chapter Transient Flows of Computational Fluid Dynamics

Answer» RIGHT choice is (c) Multipoint schemes

Easiest explanation: The Adams-Moulton scheme is a multipoint predictor-corrector METHOD. These methods use more than TWO time-steps for their prediction. Many methods use this scheme as their corrector STEP too.
58.

Which of these terms is added to the source term of the momentum equations of the transient PISO algorithm?(a) product of the latest central coefficient and latest velocity(b) product of the current central coefficient and previous velocity(c) product of the previous central coefficient and previous velocity(d) product of the initial central coefficient and current velocityThis question was posed to me in final exam.I'm obligated to ask this question of Transient SIMPLE and PISO Algorithms topic in section Transient Flows of Computational Fluid Dynamics

Answer»

The correct option is (c) product of the previous central coefficient and previous velocity

To explain: To the source TERM of the u-momentum equation, the term \(a_P^0 \, u_P^0\) is added. Where, \(a_P^0\) is the initial central coefficient and \(u_P^0\) is the initial velocity in u-direction. A SIMILAR term is added to the sources of the other momentum equations ALSO.

59.

Consider an n^th order accurate Runge-Kutta method. How many times is the derivative evaluated at the fourth time-step?(a) one time(b) two times(c) four times(d) n timesThis question was posed to me during an interview for a job.The question is from Transient Flows in portion Transient Flows of Computational Fluid Dynamics

Answer»
60.

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 unstableI had been asked this question during an internship interview.Question is from Transient Flows topic in section Transient Flows of Computational Fluid Dynamics

Answer»

The correct choice is (b) only one evaluation of derivative per TIME step

Explanation: The multipoint approach has a lot of advantages. The main advantage is that any order of accuracy can be obtained by using a different number of points. Also, at one time-step, only one new derivative has to be EVALUATED. OTHERS are those STORED from the older time-steps.

61.

The trapezoidal rule is ___________(a) stable when Δ t>1(b) stable when Δ t

Answer»
62.

What is the condition of stability for the forward Euler method when the function is real?(a) \(\Delta t\frac{\partial f}{\partial\phi}

Answer»

Right choice is (b) \(\big|\Delta t\frac{\partial F}{\partial\phi}\big|<2\)

To explain: The forward Euler method is conditionally STABLE. For this method to be stable, it needs the following condition to be SATISFIED.

\(\big|1+\Delta t\frac{\partial f}{\partial\phi} \big|<1\)

When the FUNCTION f is real, this becomes

\(\big|\Delta t\frac{\partial f}{\partial\phi} \big|<2\).

63.

How many numerical diffusion terms does the second-order upwind Euler scheme have?(a) Infinity(b) No diffusion term(c) One term(d) Two termsI got this question by my college director while I was bunking the class.The query is from Transient Flows topic in section Transient Flows of Computational Fluid Dynamics

Answer»

Correct answer is (B) No DIFFUSION term

The explanation is: The transient term discretization ALSO has similar properties like the convection term discretization. The second-order upwind EULER scheme does not have any numerical diffusion or anti-diffusion terms. These terms are present for the first-order SCHEMES only.

64.

Which of these techniques is used by the PISO algorithm?(a) Neighbour splitting(b) Source splitting(c) Coefficient splitting(d) Operator splittingThe question was asked in an online interview.My query is from Transient SIMPLE and PISO Algorithms topic in section Transient Flows of Computational Fluid Dynamics

Answer»

The correct choice is (d) Operator splitting

Easy explanation: The temporal accuracy of the PISO ALGORITHM depends on the DIFFERENCING scheme used. This includes the operator splitting TECHNIQUE used. Operator splitting uses different methods to calculate different variables.

65.

The numerical diffusion and numerical anti-diffusion terms are equal for the first-order Euler scheme are equal in magnitude when __________(a) the courant number of diffusion is equal to one(b) the courant number of diffusion is equal to two(c) the courant number of convection is equal to one(d) the courant number of convection is equal to twoThis question was addressed to me in examination.I'm obligated to ask this question of Transient Flows in section Transient Flows of Computational Fluid Dynamics

Answer»

Right CHOICE is (C) the courant number of convection is equal to one

The best I can explain: The numerical DIFFUSION term of the first-order implicit Euler SCHEME and numerical anti-diffusion term of the first-order explicit Euler scheme are equal in MAGNITUDE and opposite in sign when the courant number of convection is equal to one.

66.

The first two steps of the fourth-order Runge-Kutta method use __________(a) Euler methods(b) Forward Euler method(c) Backward Euler method(d) Explicit Euler methodThis question was addressed to me in quiz.The above asked question is from Transient Flows topic in portion Transient Flows of Computational Fluid Dynamics

Answer»

The CORRECT option is (a) EULER METHODS

Easy explanation: All the steps of the Runge-Kutta method use the two-level formulae for INITIAL value problems. The first step uses the forward Euler method and the SECOND step uses the backward Euler method. Collectively, we can say that these two steps use Euler methods.

67.

How many steps does the fourth-order Runge-Kutta method use?(a) Two steps(b) Five steps(c) Four steps(d) Three stepsThis question was posed to me in final exam.This interesting question is from Transient Flows topic in chapter Transient Flows of Computational Fluid Dynamics

Answer»

The CORRECT choice is (c) Four steps

Best EXPLANATION: All the Runge-Kutta methods are of high orders. The fourth-order Runge-Kutta method is a method which uses four steps. These four steps include the predictor and the CORRECTOR steps.

68.

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 methodsI have been asked this question in a job interview.I would like to ask this question from Transient Flows topic in section Transient Flows of Computational Fluid Dynamics

Answer»

The correct option is (c) implicit and explicit methods

Easiest explanation: Explicit methods are very EASY to PROGRAM and they need LESS computational cost. But they are not STABLE. The implicit methods are unconditionally stable but more expensive and ITERATIVE. So, the positives of both of these methods are combined by the predictor-corrector method.

69.

What is the maximum possible accuracy for the two-level methods?(a) Fifth-order(b) Fourth-order(c) Third-order(d) Second-orderThe question was asked in an internship interview.The origin of the question is Transient Flows topic in section Transient Flows of Computational Fluid Dynamics

Answer»

Right option is (d) Second-order

The explanation is: The TWO-level SCHEMES can at most give an accuracy of order two. The TRAPEZOIDAL and midpoint rules and ALSO the backward Euler method are second-order ACCURATE. But, this does not determine the accuracy of the method solely.

70.

Which of these methods will not come under a two-level method?(a) Forward Euler method(b) Adams method(c) Trapezoidal method(d) Midpoint ruleThe question was asked by my college director while I was bunking the class.The question is from Transient Flows in chapter Transient Flows of Computational Fluid Dynamics

Answer» RIGHT option is (b) Adams method

For EXPLANATION I WOULD say: The Adams method is a multipoint method. Some of the TWO-level methods are the forward and backward Euler methods, the midpoint rule and the trapezoidal rule. They do not use more than two points to solve the SYSTEM.
71.

According to the first-order explicit Euler scheme, the value at time-step t-\(\frac{\Delta t}{2}\) is approximated to be equal to the value at __________(a) t+\(\frac{\Delta t}{2}\)(b) t(c) t-Δt(d) t+ΔtThis question was addressed to me in semester exam.I need to ask this question from Transient Flows in portion Transient Flows of Computational Fluid Dynamics

Answer»

Correct choice is (b) t

The best explanation: The VALUE at t-\(\frac{\Delta t}{2}\) is at the interface of two CELLS. One has the cell centre t and the other has the cell centre t-Δ t. The first-order explicit Euler scheme is downstream biased. THEREFORE, the value at t is taken to approximate the value at t-\(\frac{\Delta t}{2}\).

72.

The first-order implicit Euler schemes to discretize the transient term creates ________(a) cross-flow diffusion(b) cross-diffusion(c) numerical anti-diffusion(d) numerical diffusionThe question was asked in exam.The question is from Transient Flows topic in portion Transient Flows of Computational Fluid Dynamics

Answer»

Right OPTION is (d) numerical diffusion

The BEST I can explain: As the TRANSIENT term behaves LIKE the convection term while discretizing, numerical diffusion is produced by the first-order implicit Euler schemes. The VALUE of the numerical diffusion can be obtained using the Taylor series expansion.

73.

The first two steps of the fourth-order Runge-Kutta method finds the value at which point?(a) At the (n+0.5)^th point(b) At the (n+1)^th point(c) At the (n-1)^th point(d) At the n^th pointI have been asked this question at a job interview.This intriguing question comes from Transient Flows in portion Transient Flows of Computational Fluid Dynamics

Answer»

The CORRECT choice is (a) At the (n+0.5)^TH point

Explanation: The first two STEPS of the fourth-order Runge-Kutta method find the values at the (n+0.5)^th point. It does not DIRECTLY move to the next step. It finds the value at an intermediate point between the current and the next POINTS.