UAH NUMERICAL METHODS FINAL
PAPER PREMIUM CRITICAL
ASSESSMENT QUESTIONS WITH
INDISPENSIBLE CONVERGENCE
NARRATIVE AND ERROR ANALYSIS
COMMENTARY
◍ Pseudocode is. Answer: a computer-like description of steps that
does not use any particular computer language's syntax or grammar
◍ An analytical solution is an exact solution. Answer: True
◍ ___ suppresses outputs to command window and separates rows in
an array. Answer: ;
◍ A numerical method is a well-defined procedure to solve a
problem. Answer: true
◍ The equal sign, "=", is used to assign values to a variable. Answer:
true
◍ A student is attempting to create a function file named
quiz1_question4.m After three tries they type a function declaration
that works correctly. All four attempts are listed below. Which is error
free. Answer: function [d, e] = quiz1_question4(a, b, c)
,◍ Anonymous functions need to be defined before being used.
Answer: true
◍ choose the statement that is equivalent to the expression below:
8+3*12^2. Answer: 8+3*(12^2)
◍ If the error is O(h^2), halving the step size will do what to the
error. Answer: the error will be 1/4 what it was
◍ will the following statement be positive or negative? -3*(-6)^2.
Answer: negative
◍ Why do we have to pay attention to errors as engineers?. Answer:
Errors can impact the reliability of our calculations
◍ The false position method determines its next guess by drawing a
straight line between the function evaluated at the two brackets and
seeing where it intersects the x-axis. Answer: true
◍ All bracketing methods require two initial estimates that surround
the root. Answer: true
◍ The false position algorithm is identical to the bisection algorithm,
except for the calculations for the estimated root location. Answer:
true
, ◍ A bracket with opposite signed function values always contains
exactly one root. Answer: false
◍ The bisection method will find all of the roots inside a given
bracket. Answer: false
◍ The bisection algorithm is an open method. Answer: false
◍ Incremental search is a root finding method. Answer: true
◍ The secant method is guaranteed to converge. Answer: false
◍ For the third iteration in the newton-raphson method, you will use
the estimated root location from the first iteration as the new initial
point. Answer: false
◍ MATLAB's built in fzero function requires three arguments: a
function handle, a value for the left bracket and a value for the right
bracket. Answer: false
◍ For the fourth iteration in the newton-raphson method, you will use
the estimated root location from the third iteration as the new initial
point. Answer: true
PAPER PREMIUM CRITICAL
ASSESSMENT QUESTIONS WITH
INDISPENSIBLE CONVERGENCE
NARRATIVE AND ERROR ANALYSIS
COMMENTARY
◍ Pseudocode is. Answer: a computer-like description of steps that
does not use any particular computer language's syntax or grammar
◍ An analytical solution is an exact solution. Answer: True
◍ ___ suppresses outputs to command window and separates rows in
an array. Answer: ;
◍ A numerical method is a well-defined procedure to solve a
problem. Answer: true
◍ The equal sign, "=", is used to assign values to a variable. Answer:
true
◍ A student is attempting to create a function file named
quiz1_question4.m After three tries they type a function declaration
that works correctly. All four attempts are listed below. Which is error
free. Answer: function [d, e] = quiz1_question4(a, b, c)
,◍ Anonymous functions need to be defined before being used.
Answer: true
◍ choose the statement that is equivalent to the expression below:
8+3*12^2. Answer: 8+3*(12^2)
◍ If the error is O(h^2), halving the step size will do what to the
error. Answer: the error will be 1/4 what it was
◍ will the following statement be positive or negative? -3*(-6)^2.
Answer: negative
◍ Why do we have to pay attention to errors as engineers?. Answer:
Errors can impact the reliability of our calculations
◍ The false position method determines its next guess by drawing a
straight line between the function evaluated at the two brackets and
seeing where it intersects the x-axis. Answer: true
◍ All bracketing methods require two initial estimates that surround
the root. Answer: true
◍ The false position algorithm is identical to the bisection algorithm,
except for the calculations for the estimated root location. Answer:
true
, ◍ A bracket with opposite signed function values always contains
exactly one root. Answer: false
◍ The bisection method will find all of the roots inside a given
bracket. Answer: false
◍ The bisection algorithm is an open method. Answer: false
◍ Incremental search is a root finding method. Answer: true
◍ The secant method is guaranteed to converge. Answer: false
◍ For the third iteration in the newton-raphson method, you will use
the estimated root location from the first iteration as the new initial
point. Answer: false
◍ MATLAB's built in fzero function requires three arguments: a
function handle, a value for the left bracket and a value for the right
bracket. Answer: false
◍ For the fourth iteration in the newton-raphson method, you will use
the estimated root location from the third iteration as the new initial
point. Answer: true
