Computer Science and Numerical Methods Flashcards
6 cards from real EIT practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 6 Computer Science and Numerical Methods flashcards as text
Gaussian elimination is used to solve:
Answer: Systems of linear algebraic equations
Gaussian elimination uses elementary row operations to reduce a linear system to upper triangular form for back-substitution.
What is the hexadecimal equivalent of decimal 255?
Answer: FF
255 = 15×16¹ + 15×16⁰ = FF in hexadecimal.
Euler's method for solving ODEs advances the solution using:
Answer: A forward difference approximation of the derivative
Euler's method uses yₙ₊₁ = yₙ + h·f(xₙ, yₙ), a first-order forward difference step.
A high condition number for a matrix indicates that the corresponding linear system is:
Answer: Numerically ill-conditioned and sensitive to perturbations
A high condition number means small changes in the input data cause large changes in the solution.
Among bisection, false position, secant, and Newton-Raphson methods, which converges fastest near a simple root?
Answer: Newton-Raphson method
Newton-Raphson achieves quadratic (second-order) convergence, doubling correct digits each iteration.
Big-O notation O(1) describes an algorithm whose run time:
Answer: Is constant regardless of input size
O(1) (constant time) means the algorithm takes the same amount of time regardless of input size.