Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Calculate by hand 8.625×101divided by -4.875×100. Show all the steps necessary to achieve your answer. Assume there is a guard, a round bit, and a sticky bit, and use them if necessary. Write the final answer in both the 16-bit floating point format described in Exercise 3.27 and in decimal and compare the decimal result to that which you get if you use a calculator.

Short Answer

Expert verified

The required result will be 0.00480769230.

Step by step solution

01

Define the concept

The decimal number system uses base 10 and the binary number system uses base 2.

For example, “12” is also equivalent to the value of the binary number system “1100”.

The decimal number 8.625×101is equal to 1.0101100100×26in the binary number system.

The decimal number -4.875 is equal to-1.0011100000×22in the binary number system.

02

Determine the calculation

Given numbers are 8.625×101and -4.875×100=-4.875×1=-4.875.

It is needed to do1.0101100100×26-1.0011100000×22

Hence,

The sign will be negative. [As, the sign of one number is positive and the other one is negative].

The exponent will be =6-2=4and15+4=19

.

The decimal number 19 is equal to 10011 in the binary number system.

For the division,

Hence,

1.0001101100×24=1101000001101100=10001.101100=-17.687586.25-4.875=-17.692307692307

Hence, the required result will be 0.00480769230

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Question: [45] The following C code implements a four-tap FIR filter on input array sig_in. Assume that all arrays are 16-bit fixed-point values. for (i 3;i< 128;i ) sig_out[i] sig_in[i-3] * f[0] sig_in[i-2] * f[1] sig_in[i-1] * f[2] sig_in[i] * f[3]; Assume you are to write an optimized implementation this code in assembly language on a processor that has SIMD instructions and 128-bit registers. Without knowing the details of the instruction set, briefly describe how you would implement this code, maximizing the use of sub-word operations and minimizing the amount of data that is transferred between registers and memory. State all your assumptions about the instructions you us

What is 4365 - 3412 when these values represent signed 12-bit octal numbers stored in sign-magnitude format? The result should be written in octal. Show your work.

Question: [30] [5] <§3.5> What decimal number does the bit pattern 0×0C000000 represent if it is a two’s complement integer? An unsigned integer?

IEEE 754-2008 contains a half precision that is only 16 bits wide. The left most bit is still the sign bit, the exponent is 5 bits wide and has a bias of 15, and the mantissa is 10 bits long. A hidden 1 is assumed. Write down the bit pattern to represent -1·5625×10-1assuming a version of this format, which uses an excess-16 format to store the exponent. Comment on how the range and accuracy of this 16-bit floating point format compares to the single precision IEEE 754 standard.

[20] Write down the bit pattern assuming that we are using base 30 numbers in the fraction instead of base 2. (Base 16 numbers use the symbols 0–9 and A–F. Base 30 numbers would use 0–9 and A–T.) Assume there are 20 bits, and you do not need to normalize. Is this representation exact?

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free