Dr.

Amara Al Sayegh
Name: 10- 4- 2018
ID #: Math213- Midterm- Spring 2017 75 min.

1) Convert the decimal number (1426)10 to binary form, show your work.
2) Convert the binary number (10100110)2 to decimal form, show your work.
3) Convert the binary fraction (0.10001)2 to decimal form, show your work.
4) Convert (2/7)10 to an infinite repeating binary fraction, show your work.
5) Convert the base 6 number (251)5 to decimal form, show your work.
6) How many distinct positive numbers can be represented in a floating point system using base 𝛽 = 8, precision t
= 4 and exponent range L = -9 and U = 10? (Don’t worry about special characters.)
7) The sequence of 64 binary digits: (𝛽 = 2, 𝑡 = 52, 𝐿 = −1022, 𝑈 = 1023)
11000010011010111000000000000000000000000000000000000000000000111
is a double precision word. To what decimal number does the above word correspond?
8) Investigate the nature of a fixed-point iteration when
1
𝑔(𝑥) = −4 + 4𝑥 − 𝑥 2
2
a) Solve g(x) = x and show that x1* = 2 and x2* = 4 are fixed points.
b) Use the fixed point iteration scheme and the starting value x0= 1.9 to compute x1, x2, x3.
c) Use the fixed point iteration scheme and the starting value x0= 3.8 and compute x1, x2, x3.
d) Find the absolute errors Ek and the relative errors Rk for the values xk in parts (b) and (c). Comment.
9) The square root of a positive number R can be computed from the iterative formula:

1 𝑅
𝑥𝑛+1 = (𝑥𝑛 + )
2 𝑥𝑛

a) Establish this relation by applying Newton’s method to some f(x).

b) Let x* be the root of the above obtained f(x).
i. Show that:
(𝑥𝑛 − 𝑥 ∗ )2
𝑥𝑛+1 − 𝑥 ∗ =
2𝑥𝑛
ii. Deduce: 𝑥𝑛 ≥ 𝑥 ∗ ∀ 𝑛 ≥ 1, 𝑥0 > 0
iii. Show that the obtained sequence is decreasing.
iv. Show that the sequence {𝑥𝑛 } converges to the root 𝑥 ∗ .
v. Show that the convergence is quadratic.
c) Perform three iterations of the above scheme to compute√2, starting with 𝑥𝑜 = 1.
d) Using f(x) obtained in part (a), apply 3 iterations of the bisection method to compute √2, starting with the
interval [1,2].
e) Compare the absolute error on the approximation obtained in part (c) to that obtained in part (d).
Comment.
10) If we use the secant method on f(x) = x3-2x+2 starting with x0=1 and x1=1, what are x2 and x3?
11) Given an absolute error atoll > 0, determine the minimum number of iterations of the bisection method needed
knowing that the initial interval is [a,b].