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

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

Short Answer

Expert verified

The bit pattern is 3D7.EB4.

Yes, the representation is exact.

Step by step solution

01

Define the concept.

The base 15 number system uses the base 15, the symbols 0 to 9, and A to E where the decimal number system uses base 10 and the binary number system uses base 2.

For example,

In the 15 base number system, “A” is equivalent to the value of decimal number system “10” and that is also equivalent to the value of binary number system “1010”,

In the 15 base number system, “B” is equivalent to the value of decimal number system “11” and that is also equivalent to the value of binary number system “1011”,

In the 15 base number system, “C” is equivalent to the value of decimal number system “12” and that is also equivalent to the value of binary number system “1100” ”,

In the 15 base number system, “D” is equivalent to the value of decimal number system “13” and that is also equivalent to the value of binary number system “1101” ”,

In the 15 base number system, “E” is equivalent to the value of decimal number system “14” and that is also equivalent to the value of binary number system “1110”.

In the 15 base number system, “3” is also equivalent to the value of binary number system “0011”.

In the 15 base number system, “7” is also equivalent to the value of binary number system “0111”.

02

Determine the calculation

The required bit pattern is written below by using the base 15 number system in the fraction and also by assuming there are 24 bits, and without normalization

0011 1101 0111.1110 1011 0100

3D7.EB4 is represented in 24-bit 15 base number system.

0011110101111110101101003D7EB4

Yes, the representation is exact.

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: Write down the bit pattern in the fraction of value 1/3 assuming a floating-point format that uses binary numbers in the fraction. Assume there are 24 bits, and you do not need to normalize the value of 1/3. Is this representation exact?

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: [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?

Question: Calculate the time necessary to perform a multiply using the approach given in Figure 3.3 and 3.4 if an integer is 8 bits wide and each step of the operation takes 4-time units. Assume that in step 1a an addition is always performed -either the multiplicand will be added, or a zero will be. Also assume that the registers have already been initialized (you are just counting how long it takes to do the multiplication loop itself). If this is being done in hardware, the shifts of the multiplicand and multiplier can be done simultaneously. If this is being done in software, they will have to be done one after the other. Solve for each case.

Assume 151 and 214 are unsigned 8-bit integers. Calculate 151 + 214 using saturating arithmetic. The result should be written in decimal. Show your work.

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