第一章 单元测试

1、 问题:Rewrite the polynomial in nested form. The answer is ( ).
选项:
A:
B:
C:
D:
答案: 【


2、 问题:( ) multiplications and ( ) additions are required for the nested form of the polynomial
选项:
A:5, 2
B:5, 3
C:6, 2
D:6, 3
答案: 【
6, 3

3、 问题:The binary representation of the base 10 integers 64 is ( )
选项:
A:(1000000)2
B:(1000001)2
C:(1000002)2
D:(1000003)2
答案: 【
(1000000)2

4、 问题:Convert the binary number (1011.101)2 to base 10. The answer is ( )
选项:
A:83/8
B:93/8
C:103/8
D:113/8
答案: 【
93/8

5、 问题:Convert the base 10 number 0.25 to binary and express as a floating point number fl(x) by using the Rounding to Nearest Rule. The answer is ( )
选项:
A:
B:
C:
D:
答案: 【

6、 问题:For positive integers k = ( ), the number can be represented exactly (with no rounding error) in double precision floating point arithmetic.
选项:
A:1-49
B:1-50
C:1-51
D:1-52
答案: 【
1-50

7、 问题:Do the sum by hand in IEEE double precision computer arithmetic using the Rounding to Nearest Rule. The answer is ( )
选项:
A:
B:
C:
D:
答案: 【

8、 问题:When x = ( ), there is subtraction of nearly equal numbers for , and find an alternate form ( ) that avoids the problem.
选项:
A:0,
B:0,
C:2,
D:2,
答案: 【
0,

9、 问题:Find the Taylor polynomial of degree 2 ( ) about the point x = 0 for the function
选项:
A:
B:
C:
D:
答案: 【

10、 问题:When , 1+ x > 1 in double precision floating point arithmetic, with Rounding to Nearest. ( )
选项:
A:对
B:错
答案: 【

11、 问题:The associative law holds for IEEE computer addition. ( )
选项:
A:对
B:错
答案: 【

第二章 单元测试

1、 问题:Use the Intermediate Value Theorem to find an interval of length one ( ) that contains a root of the equation.
选项:
A:[0, 1]
B:[1, 2]
C:[2, 3]
D:[3, 4]
答案: 【
[2, 3]

2、 问题:Apply two steps of the Bisection Method for the equation to find an approximate root ( ) within 1/8 of the true root.
选项:
A:0.775
B:0.875
C:0.975
D:1.075
答案: 【
0.875

3、 问题:Starting with [2,3], ( ) steps of the Bisection Method are required to calculate the solution within for the equation .
选项:
A:31
B:32
C:33
D:34
答案: 【
33

4、 问题:The fixed points of are ( ).
选项:
A:1, 2
B:2, 3
C:3, 4
D:4, 5
答案: 【
1, 2

5、 问题:Rank the Fix-Point Iterations a); b) ; c) that converge from fastest to slowest ( ).
选项:
A:a > b > c
B:b > a > c
C:c > b > a
D:a > c > b
答案: 【
a > b > c

6、 问题:Find the forward and backward error ( ) for the function , where the root is 3/4 and the approximate root is .
选项:
A:0.01, 0.02
B:0.02, 0.03
C:0.01, 0.04
D:0.02, 0.04
答案: 【
0.01, 0.04

7、 问题:Find the multiplicity ( ) of the root r = 0 of .
选项:
A:1
B:2
C:3
D:4
答案: 【
2

8、 问题:Find the relation ( ) between forward and backward error for finding the root of the linear function .
选项:
A:
B:
C:
D:
答案: 【

9、 问题:Apply two steps of Newton’s Method with initial guess to the equation . The answer is ( )
选项:
A:17/12
B:18/13
C:19/14
D:4/3
答案: 【
18/13

10、 问题:Suppose Newton’s Method is applied to the function f (x) = 1/x. If the initial guess is , find ( ).
选项:
A:
B:
C:
D:
答案: 【

11、 问题:Apply two steps of the Secant Method to the equation with initial guesses and . The answer is ( ).
选项:
A:1.642
B:1.742
C:1.842
D:1.942
答案: 【
1.742

12、 问题:Fixed-Point Iteration of is locally convergent to the given fixed point . ( )
选项:
A:对
B:错
答案: 【

13、 问题:Newton’s Method applied to converges in one step. ( )
选项:
A:对
B:错
答案: 【

第三章 单元测试

1、 问题:Use Gaussian elimination to solve the system , the answer is ( ).
选项:
A:x = 4, y = 2
B:x = 5, y = 3
C:x = 5, y = 2
D:x = 4, y = 3
答案: 【
x = 4, y = 2

本门课程剩余章节答案为付费内容
支付后可长期查看
有疑问请添加客服QQ 2356025045反馈
如需购买期末请联系客服QQ 2356025045
如遇卡顿看不了请换个浏览器即可打开
请看清楚了再购买哦,电子资源购买后不支持退款哦