• edited by
25,890 views
56 56 votes

What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding?

$(113. + -111.) + 7.51$

$113. + (-111. + 7.51)$

  1. $9.51$ and $10.0$ respectively

  2. $10.0$ and $9.51$ respectively

  3. $9.51$ and $9.51$ respectively

  4. $10.0$ and $10.0$ respectively

4 Answers

Best answer
114 114 votes

$(113. + -111.) = 1.13 \times 10^2 + -1.11 \times 10^2 = 0.02 \times 10^2 = 2.0 \times 10^0$

$2.0 \times 10^0 + 7.51 \times 10^0 = 9.51 \times 10^0 $

$(-111. + 7.51) = -1.11 \times 10^2 + 7.51 \times 10^0 = -1.11\times 10^2 + 0.08 \times 10^2 = -1.03 \times 10^2 $

$113. + -1.03 \times 10^2 = 1.13 \times 10^2 + -1.03 \times 10^2 = 0.1 \times 10^2 = 10.0$

Reference: https://www.doc.ic.ac.uk/~eedwards/compsys/float/ 

Correct Answer: $A$

• edited by
38 38 votes
3 digit floating point arithmetic is used..
(113.+-111.)+7.51 = 2.00 + 7.51 = 9.51
113.+(-111.+7.51) = 113. + (-111. + 8.00) //rounding off to make compatible 7.51 and 111. with respect  3 digit floating point arithmetic
113. - 103. = 10.0
0 0 votes

2nd part:  113. + (-111. + 7.51)

(-111. + 7.51) = - .111 x 103 + .751 x 10

= 10( - .111 x 102 + .751)

= 10(-11.1 + .751)

= 10(- 10.349)

= - 103.49

now, 113. + (- 103.49) = .113 x 103 - .10349 x 103 

= 103(.113 - .103)  // ignor 49 bcz  three-digit floating point arithmetic with rounding

= 103 x .010

= 10

Answer:
Position:
Show:

Related questions

38 38 votes
5 answers 5 answers
26.7k
26.7k views
Kathleen asked Sep 18, 2014
26,739 views
Let $A = 1111 1010$ and $B = 0000 1010$ be two $8-bit$ $2’s$ complement numbers. Their product in $2’s$ complement is$1100 0100$$1001 1100$$1010 0101$$1101 0101$
27 27 votes
3 answers 3 answers
10.0k
10.0k views
Kathleen asked Sep 18, 2014
10,048 views
If $73_x$ (in base-x number system) is equal to $54_y$ (in base $y$-number system), the possible values of $x$ and $y$ are$8, 16$$10, 12$$9, 13$$8, 11$
123 123 votes
23 answers 23 answers
57.2k
57.2k views
Kathleen asked Sep 18, 2014
57,202 views
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both com...
55 55 votes
5 answers 5 answers
27.7k
27.7k views
Kathleen asked Sep 18, 2014
27,696 views
Consider the partial implementation of a $2-bit$ counter using $T$ flip-flops following the sequence $0-2-3-1-0,$ as shown below.To complete the circuit, the input $X$ sh...