Question 1

The real roots of polynomials are usually classified as being either ____ numbers or irrational.

Accepted Answer

A)  royal 
B)  integer 
C)  rational 
D)  transcendental 
A)  royal 
B)  integer 
C)  rational 
D)  transcendental

Question 2

In numerical integration, excessive computation times typically occur when the number of iterations exceeds ____.

Accepted Answer

A)  5 
B)  10 
C)  25 
D)  50 
A)  5 
B)  10 
C)  25 
D)  50

Question 3

An approximation to the area under a complicated curve is obtained by assuming the function can be replaced by simpler functions over a limited ____.

Accepted Answer

A)  range 
B)  time 
C)  phase 
D)  matrix 
A)  range 
B)  time 
C)  phase 
D)  matrix

Question 4

Simpson s rule converges nicely in most instances and it is easy to use.

Accepted Answer

A) True 
 B)False

Question 5

The secant method of root-finding does not pose divergence problems.

Accepted Answer

A) True 
 B)False

Question 6

The ____ method presents the basics on which most root-finding methods are constructed.

Accepted Answer

A)  bisection 
B)  binary 
C)  guessing 
D)  interval 
A)  bisection 
B)  binary 
C)  guessing 
D)  interval

Question 7

The regula falsi method will almost always ____________________faster than the conventional bisection method.

Accepted Answer

The answer of The regula falsi method will almost always...

Question 8

Numerical integration is a stable process.

Accepted Answer

A) True 
 B)False

Question 9

To increase the accuracy of numerical integration methods, the interval is simply subdivided into a larger number of ____________________.

Accepted Answer

The answer of To increase the accuracy of numerical integration...

Question 10

A change in a function s ____, indicating the vicinity of a root has been located, forms the key element in the computer code for locating roots.

Accepted Answer

A)  name 
B)  parameters 
C)  sign 
D)  data type 
A)  name 
B)  parameters 
C)  sign 
D)  data type

Question 11

The very simplest approximation to a function is a(n) ____________________.

Accepted Answer

The answer of The very simplest approximation to a function...

Question 12

The ____________________ method can be shown to be equivalent to replacing the function repeatedly by straight lines drawn through the points x 0 , f ( x 0 ) and x 1 , f ( x 1 ) .

Accepted Answer

The answer of The ____________________ method can be shown to...

Question 13

The regula falsi procedure can be made to converge more rapidly if the interval can be made to collapse from only one direction.

Accepted Answer

A) True 
 B)False

Question 14

The number of ____________________ is not predictable in the regula falsi and modified regula falsi methods.

Accepted Answer

The answer of The number of ____________________ is not predictable...

Question 15

The ____ method is identical to the regula falsi method, except the sign of f ( x ) doesn t need to be checked at each iteration.

Accepted Answer

A)  brute-force 
B)  secant 
C)  regula falsi 
D)  modified regula falsi 
A)  brute-force 
B)  secant 
C)  regula falsi 
D)  modified regula falsi

Question 16

A(n) ____ is a number used to alter the results of one iteration before inserting them into the next.

Accepted Answer

A)  iteration factor 
B)  relaxation factor 
C)  increment 
D)  booster 
A)  iteration factor 
B)  relaxation factor 
C)  increment 
D)  booster

Question 17

____ rule is based on approximating a function by straight-line segments.

Accepted Answer

A)  The trapezoidal 
B)  Simpson s 
C)  Bart s 
D)  Dijkstra s 
A)  The trapezoidal 
B)  Simpson s 
C)  Bart s 
D)  Dijkstra s

Question 18

Numerical integration is fairly safe from problems such as ____.

Accepted Answer

A)  round-off errors 
B)  division by zero 
C)  convergence 
D)  both a and b 
A)  round-off errors 
B)  division by zero 
C)  convergence 
D)  both a and b

Question 19

Many, perhaps most, of the integrals occurring in actual engineering or science problems cannot be expressed in any ____________________ form.

Accepted Answer

The answer of Many, perhaps most, of the integrals occurring...

Question 20

The chapter text cautions that the secant root-finding method can pose ____ problems.

Accepted Answer

A)  convergence 
B)  rounding 
C)  computer memory 
D)  divergence 
A)  convergence 
B)  rounding 
C)  computer memory 
D)  divergence

The real roots of polynomials are usually classified as being either ____ numbers or irrational.

In numerical integration, excessive computation times typically occur when the number of iterations exceeds ____.

An approximation to the area under a complicated curve is obtained by assuming the function can be replaced by simpler functions over a limited ____.

Simpson s rule converges nicely in most instances and it is easy to use.

The secant method of root-finding does not pose divergence problems.

The ____ method presents the basics on which most root-finding methods are constructed.

The regula falsi method will almost always ____________________faster than the conventional bisection method.

Numerical integration is a stable process.

To increase the accuracy of numerical integration methods, the interval is simply subdivided into a larger number of ____________________.

A change in a function s ____, indicating the vicinity of a root has been located, forms the key element in the computer code for locating roots.

The very simplest approximation to a function is a(n) ____________________.

The ____________________ method can be shown to be equivalent to replacing the function repeatedly by straight lines drawn through the points x 0 , f ( x 0 ) and x 1 , f ( x 1 ) .

The regula falsi procedure can be made to converge more rapidly if the interval can be made to collapse from only one direction.

The number of ____________________ is not predictable in the regula falsi and modified regula falsi methods.

The ____ method is identical to the regula falsi method, except the sign of f ( x ) doesn t need to be checked at each iteration.

A(n) ____ is a number used to alter the results of one iteration before inserting them into the next.

____ rule is based on approximating a function by straight-line segments.

Numerical integration is fairly safe from problems such as ____.

Many, perhaps most, of the integrals occurring in actual engineering or science problems cannot be expressed in any ____________________ form.

The chapter text cautions that the secant root-finding method can pose ____ problems.

Preliminaries

Problem Solving Using C++

Assignment, Formatting, and Interactive

Selection Structures

Repetition Statements

Modularity Using Functions

Arrays

Io Streams and Data Files

Completing the Basics

Pointers

Introduction to Classes

Adding Functionality to Your Classes

Structures

Filters

Exam 14: Numerical Methods

The real roots of polynomials are usually classified as being either ____ numbers or irrational.

In numerical integration, excessive computation times typically occur when the number of iterations exceeds ____.

An approximation to the area under a complicated curve is obtained by assuming the function can be replaced by simpler functions over a limited ____.

Simpson s rule converges nicely in most instances and it is easy to use.

The secant method of root-finding does not pose divergence problems.

The ____ method presents the basics on which most root-finding methods are constructed.

The regula falsi method will almost always ____________________faster than the conventional bisection method.

Numerical integration is a stable process.

To increase the accuracy of numerical integration methods, the interval is simply subdivided into a larger number of ____________________.

A change in a function s ____, indicating the vicinity of a root has been located, forms the key element in the computer code for locating roots.

The very simplest approximation to a function is a(n) ____________________.

The ____________________ method can be shown to be equivalent to replacing the function repeatedly by straight lines drawn through the points x 0 , f ( x 0 ) and x 1 , f ( x 1 ) .

The regula falsi procedure can be made to converge more rapidly if the interval can be made to collapse from only one direction.

The number of ____________________ is not predictable in the regula falsi and modified regula falsi methods.

The ____ method is identical to the regula falsi method, except the sign of f ( x ) doesn t need to be checked at each iteration.

A(n) ____ is a number used to alter the results of one iteration before inserting them into the next.

____ rule is based on approximating a function by straight-line segments.

Numerical integration is fairly safe from problems such as ____.

Many, perhaps most, of the integrals occurring in actual engineering or science problems cannot be expressed in any ____________________ form.

The chapter text cautions that the secant root-finding method can pose ____ problems.

Preliminaries

Problem Solving Using C++

Assignment, Formatting, and Interactive

Selection Structures

Repetition Statements

Modularity Using Functions

Arrays

Io Streams and Data Files

Completing the Basics

Pointers

Introduction to Classes

Adding Functionality to Your Classes

Structures

Filters