So not everything is about getting 20+ decimal places of precision. Integers are great, sometimes they are enough, sometimes they are *ALMOST* enough (and, well, sometimes they aren't enough).   For example, in music I can have notes that take one beat, notes that take up multiple beats...or notes that take a beat and a half, or others that take a half a beat. I don't ever need to worry about a note that takes 3.071253 beats. If I could represent fractions down to maybe 1/16 of a beat, that would be plenty.   That was kind of a side track.   What I'd like is numbers that fit in a 16 bit int. I want to be able to represent numbers that can represent about 3 places past the decimal point (about 10 bits past the binary point), and I need to have at least +/- 2PI of range. Let's go for 5 bits on the left of the binary point and 11 bits to the right...so we can represent numbers from 15something to -16 range with a resolution of 1/2048.   For this numbering scheme, find the four digit hexadecimal representations (as close as can be represented) for: 1,-1,2,-2, pi,-pi,2pi,-2pi,pi/2 and -pi/2.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

So not everything is about getting 20+ decimal places of precision. Integers are great, sometimes they are enough, sometimes they are *ALMOST* enough (and, well, sometimes they aren't enough).

 

For example, in music I can have notes that take one beat, notes that take up multiple beats...or notes that take a beat and a half, or others that take a half a beat. I don't ever need to worry about a note that takes 3.071253 beats. If I could represent fractions down to maybe 1/16 of a beat, that would be plenty.

 

That was kind of a side track.   What I'd like is numbers that fit in a 16 bit int. I want to be able to represent numbers that can represent about 3 places past the decimal point (about 10 bits past the binary point), and I need to have at least +/- 2PI of range. Let's go for 5 bits on the left of the binary point and 11 bits to the right...so we can represent numbers from 15something to -16 range with a resolution of 1/2048.

 

  1. For this numbering scheme, find the four digit hexadecimal representations (as close as can be represented) for: 1,-1,2,-2, pi,-pi,2pi,-2pi,pi/2 and -pi/2.

Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Random Class and its operations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education