Scribd
Upload
56 views11 pages

American University of Beirut Mathematics Department-FAS

This document contains a mathematics test from the American University of Beirut with 4 problems. Problem 1 involves determining the hexadecimal representation of a decimal number in single precision floating point format. Problem 2 involves properties of numbers in single precision format and evaluating a function involving square roots. Problem 3 involves locating roots of a function graphically and using Newton's method, and comparing iterations to the bisection method. Problem 4 involves applying Gaussian elimination to tridiagonal matrices and extracting the resulting upper triangular matrix.

Uploaded by

Mohsen Haj Hassan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
56 views11 pages

American University of Beirut Mathematics Department-FAS

This document contains a mathematics test from the American University of Beirut with 4 problems. Problem 1 involves determining the hexadecimal representation of a decimal number in single precision floating point format. Problem 2 involves properties of numbers in single precision format and evaluating a function involving square roots. Problem 3 involves locating roots of a function graphically and using Newton's method, and comparing iterations to the bisection method. Problem 4 involves applying Gaussian elimination to tridiagonal matrices and extracting the resulting upper triangular matrix.

Uploaded by

Mohsen Haj Hassan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

AMERICAN UNIVERSITY OF BEIRUT

Mathematics Department-FAS
MATH 251
TEST 1
FALL 2010-2011
Closed Book, 75 mn
STUDENT NAME
ID NUMBER
Problem Out of Grade
1 13
2 12
3 13
4 12
TOTAL 50
1
1. (13 points) Determine the Hexadecimal representation of the decimal
number
x = 318.724 10
24
in F
S
( single precision). Use the approximation 10
3
2
10
and rounding
to the closest if necessary.
(x)
2
= (7 points)
2
Bit-String Representation of (x)
2
in F
S
: (4 points)
Hexadecimal representation of x in F
S
: (2 points)
3
2. (12 points)
(a) - What are the numbers in the IEEE Single precision system F
S
immediately to the right or to the left of x = 2
m
(i.e respectively
the successor of x denoted succ(x), and the predecessor of x denoted
pre(x)), in the following cases:
x = 2
m
with 126 < m < +127
pre(x) = (2 points)
succ(x) = (2 points)
4
x = 2
m
with m = 126. Identify pre(x), then write its Binary bit
string representation in F
S
.
pre(x) = (1.5 points)
Binary Bit string representation of pre(x) : (1.5 points)
5
(b) - Determine the values of x for which the following function involves
a diculty. What is it ? What remedy do you propose ?
. (5 points)
f(x) = (

x + 4)
1/2
(

x)
1/2
6
3. (13 points)
(a) Locate the roots of f(x) = e
x
+x
2
x5, and show the results on
a graph. (4 points)
7
(b) Use Newtons method to approximate the negative root of f
up to 4 decimal gures. Express all your computed results in
F(10, 5, 20, +20); round to the closest if needed. (6 points)
(c) How many iterations are theoretically needed to reach such preci-
sion using the Bisection method ? Compare with the number of
iterations used in (b), and justify the results. (3 points)
8
4. (12 points) An (n n)- tridiagonal matrix A
n
is a matrix for which all
the elements are zeros, except those on the 3 Diagonals. It is dened
as follows:
A
n
=

a1 b1 0 0 ... 0
c1 a2 b2 0 ... 0
0 c2 a3 b3 ... 0
.... ... ... ... ... ...
.... ... ... ... ... ...
.... ... ... c
n2
a
n1
b
n1
0 ... 0 0 c
n1
a
n

(a) Apply the Naive Gauss elimination on the following (4 4)-


tridiagonal matrix A
4
. Determine at each reduction the multipli-
ers and the modied elements of the matrix. (6points)
A
4
=

1 5 0 0
2 2 7 0
0 1 4 1
0 0 2 3

9
...
(b) Extract the Upper Triangular matrix U
4
obtained at the end of this
process: (2 points)
U
4
=
10
(c) If the Naive Gauss reduction is applied on the tridiagonal matrix
A
n
, deduce from the results obtained in(a) and (b)
Which elements of A are modied at each reduction: (2 points)
What is the form of the Upper triangular matrix U
n
extracted
at the end of the process: (2 points)
U
n
=
11

You might also like