Transient Flows MCQ

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

• The numerical dispersion term of the second-order upwind Euler scheme is of ____________
  ক

  third-order

  খ

  second-order

  গ

  first-order

  ঘ

  no dispersion
• How many numerical diffusion terms does the second-order upwind Euler scheme have?
  ক

  Infinity

  খ

  No diffusion term

  গ

  One term

  ঘ

  Two terms
• Which of these terms cause instability in the Crank-Nicolson scheme when used for finite volume approach?
  ক

  Anti-diffusion term

  খ

  Anti-dispersive term

  গ

  Diffusion term

  ঘ

  Dispersive term
• The results using the Crank-Nicolson scheme for finite volume approach can be reformulated using the ________
  ক

  implicit first-order Euler scheme

  খ

  implicit and explicit first-order Euler schemes

  গ

  explicit first-order Euler scheme

  ঘ

  central difference scheme
• The stability of the Crank-Nicolson scheme for finite volume approach is constrained by ________
  ক

  CFL number

  খ

  Peclet number

  গ

  Time-step size

  ঘ

  Spatial grid size
• The numerical diffusion and numerical anti-diffusion terms are equal for the first-order Euler scheme are equal in magnitude when __________
  ক

  the courant number of diffusion is equal to one

  খ

  the courant number of diffusion is equal to two

  গ

  the courant number of convection is equal to one

  ঘ

  the courant number of convection is equal to two
• When the first-order implicit Euler scheme is unconditionally stable, the solution is ________
  ক

  stationary for large time-steps

  খ

  oscillatory for large time-steps

  গ

  stationary for small time-steps

  ঘ

  oscillatory for small time-steps
• The first-order implicit Euler schemes to discretize the transient term creates ________
  ক

  cross-flow diffusion

  খ

  cross-diffusion

  গ

  numerical anti-diffusion

  ঘ

  numerical diffusion
• Which of these changes should be made in the semi-discretized equation to get the fully discretized equation?
  ক

  Express the face values in terms of the neighbouring face values

  খ

  Express the face values in terms of the cell values

  গ

  Express the cell values in terms of the face values

  ঘ

  Express the cell values in terms of the neighbouring cell values
• The discretization of the transient term using the finite volume approach is more like the spatial discretization of __________
  ক

  the convection term

  খ

  the diffusion term

  গ

  the source term

  ঘ

  the anti-diffusion term
• Which of these statements about the Adams-Moulton method is correct?
  ক

  It involves the terms at the older time-step only

  খ

  It involves the terms at the next time-step

  গ

  It does not involve iterations

  ঘ

  It does not involve older steps
• The Adams-Moulton scheme comes under ____________
  ক

  Backward schemes

  খ

  Forward schemes

  গ

  Multipoint schemes

  ঘ

  Runge-Kutta methods
• The Adams-Moulton scheme is __________
  ক

  explicit

  খ

  implicit

  গ

  a two-level scheme

  ঘ

  a three-level scheme
• For which of these problems is the Crank-Nicolson scheme unconditionally stable?
  ক

  Compressible flows

  খ

  Advection problems

  গ

  Diffusion problems

  ঘ

  Convection-Diffusion problems
• For the transient convection problems, the Crank-Nicolson scheme is stable when _________
  ক

  CFLconv≤2

  খ

  CFLconv≤1

  গ

  CFLconv≥-2

  ঘ

  CFLconv≥-1
• To find the values at the current time-step, the Crank-Nicolson scheme uses ___________
  ক

  t-Δt and t+Δ t steps

  খ

  t-Δ t and t-2Δ t steps

  গ

  t+Δ t and t+2Δ t steps

  ঘ

  t and t+Δt steps
• The Crank-Nicolson scheme is ________
  ক

  fourth-order accurate

  খ

  third-order accurate

  গ

  second-order accurate

  ঘ

  first-order accurate
• The approximation of the derivative taken by the Crank-Nicolson scheme is the same as the __________ of spatial derivative.
  ক

  second order forward difference approximation

  খ

  backward difference approximation

  গ

  forward difference approximation

  ঘ

  central difference approximation
• Which of these is a disadvantage of the Runge-Kutta method over the multipoint method?
  ক

  Computational stability

  খ

  Computational cost

  গ

  Accuracy

  ঘ

  Convergence
• Consider an nth order accurate Runge-Kutta method. How many times is the derivative evaluated at the fourth time-step?
  ক

  one time

  খ

  two times

  গ

  four times

  ঘ

  n times
• The final corrector of the fourth-order Runge-Kutta method uses ___________
  ক

  Midpoint rule

  খ

  Backward Euler method

  গ

  Simpson’s rule

  ঘ

  Trapezoidal rule
• The first two steps of the fourth-order Runge-Kutta method use __________
  ক

  Euler methods

  খ

  Forward Euler method

  গ

  Backward Euler method

  ঘ

  Explicit Euler method
• How many predictor and corrector steps does the fourth-order Runge-Kutta method use?
  ক

  Three predictor and one corrector steps

  খ

  One predictor and three corrector steps

  গ

  Two predictor and two corrector steps

  ঘ

  One predictor and two corrector steps
• The first two steps of the fourth-order Runge-Kutta method finds the value at which point?
  ক

  At the (n+0.5)th point

  খ

  At the (n+1)th point

  গ

  At the (n-1)th point

  ঘ

  At the nth point
• How many steps does the fourth-order Runge-Kutta method use?
  ক

  Two steps

  খ

  Five steps

  গ

  Four steps

  ঘ

  Three steps
• Which of these correctors does the second-order Runge-Kutta method use?
  ক

  Backward Euler corrector

  খ

  Forward Euler corrector

  গ

  Trapezoidal corrector

  ঘ

  Midpoint rule corrector
• The second-order Runge-Kutta method uses __________ as a predictor.
  ক

  backward order method

  খ

  forward Euler method

  গ

  midpoint rule

  ঘ

  multipoint method
• Which of these is correct for the multipoint method?
  ক

  multiple derivatives at each time step

  খ

  only one evaluation of derivative per time step

  গ

  order of accuracy is restricted to four

  ঘ

  extremely unstable
• Which of these is used by the Adam-Bashforth method?
  ক

  Newton’s method

  খ

  Frobenious covariant

  গ

  Frobenious norm

  ঘ

  Lagrange polynomial
• The Adam-Bashforth method is ____________
  ক

  an explicit method

  খ

  an implicit method

  গ

  a first-order accurate method

  ঘ

  a second-order accurate method