This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSci 5302 HW1 v2 Due: Feb. 09 2010 • In the last 2 problems, hand in a written description of how you set up and solved the problem. You are not required to hand in the computer source code, but you should describe the algorithms you used, including how you initialized the methods and how you decided to stop. The computer code might be useful to give some partial credit in case of incorrect answers. If you use only code fragments in an interactive system, you can hand in a transcript of those, with handwritten explanations. You are not required to write a closed form algorithm to find the answers. 1. Assume you use the following 4 digit decimal arithmetic ± W . XYZ × 10 ± E where • W is any decimal digit 1 , . . . , 9 (0 is admitted only for true zero) • W , Y , Z , E are any decimal digits 0 , . . . , 9. Assume that we use the “round–to–even” rule, that overflows become inf ’s and that underflows become zeroes. The “round–to–even” rule says that any result that is not already representable should be rounded to the nearest representable number ignoring exponent limits. If the result is exactly half way between two representable numbers, it should be rounded to the representable number that ends in an even digit. If the resulting number has an exponent beyond the exponent limits, then the answer is one of the exceptional values. Answer the following questions (a) Compute 3 . 194 × 10 +1 + 4...
View
Full Document
 Spring '08
 Boley,D
 Algorithms, Numerical digit, Positional notation, Decimal

Click to edit the document details