Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
29. Suppose we use a machine that represents integers in 9 bits. Our unsigned integers act like what set of modulo numbers? (Hint: When counting up, where does a 9 bit number reset to zero.)

29. Suppose we use a machine that represents integers in 9 bits. Our unsigned integers act like what set of modulo numbers? (Hint: When counting up, where does a 9 bit number reset to zero.)

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
← = O homework2_integer_representati X New folder 3 of 3 73°F Partly sunny + https://asulearn.appstate.edu/pluginfile.php/3557675/mod_resource/content/4/homework2_integer... A&P of Hearing Fla... Unit 5 Quiz Questio... A Course Catalog - A... Communication an... SLP 261 Final Study... T 29. Suppose we use a machine that represents integers in 9 bits. Our unsigned integers act like what set of modulo numbers? (Hint: When counting up, where does a 9 bit number reset to zero.) C Week 2: Tongue, Ve... 30. Suppose we use a machine that represents integers in 9 bits using two's complement notation. How many integers can be represented in the machine? 31. Suppose we use a machine that represents integers in 9 bits using two's complement notation. What is the largest possible positive integer expressed in binary? 32. Suppose we use a machine that represents integers in 9 bits using two's complement notation. What is the largest possible positive integer expressed in decimal? 33. Suppose we use a machine that represents integers in 9 bits using two's complement notation. What is the smallest possible negative integer expressed in binary? H 34. Suppose we use a machine that represents integers in 9 bits using two's complement notation. What is the smallest possible negative integer expressed in decimal? 35. What is the smallest number of bits that can be used to store an integer on a computer which must be able to handle integers in the range of 2,000,000,000 down to -2,000,000,000? $ q > A T x Other favorites 0< 12:41 PM 9/22/2022
Transcribed Image Text:← = O homework2_integer_representati X New folder 3 of 3 73°F Partly sunny + https://asulearn.appstate.edu/pluginfile.php/3557675/mod_resource/content/4/homework2_integer... A&P of Hearing Fla... Unit 5 Quiz Questio... A Course Catalog - A... Communication an... SLP 261 Final Study... T 29. Suppose we use a machine that represents integers in 9 bits. Our unsigned integers act like what set of modulo numbers? (Hint: When counting up, where does a 9 bit number reset to zero.) C Week 2: Tongue, Ve... 30. Suppose we use a machine that represents integers in 9 bits using two's complement notation. How many integers can be represented in the machine? 31. Suppose we use a machine that represents integers in 9 bits using two's complement notation. What is the largest possible positive integer expressed in binary? 32. Suppose we use a machine that represents integers in 9 bits using two's complement notation. What is the largest possible positive integer expressed in decimal? 33. Suppose we use a machine that represents integers in 9 bits using two's complement notation. What is the smallest possible negative integer expressed in binary? H 34. Suppose we use a machine that represents integers in 9 bits using two's complement notation. What is the smallest possible negative integer expressed in decimal? 35. What is the smallest number of bits that can be used to store an integer on a computer which must be able to handle integers in the range of 2,000,000,000 down to -2,000,000,000? $ q > A T x Other favorites 0< 12:41 PM 9/22/2022
Expert Solution
Step 1

29.

The bit range for an unsigned number is 9 bits.

 

Beginning with 0, the range of numbers will be 1.

 

The maximum number is 2^(n-1)

 

-1

N bits are present.

The unsigned number range is described here along with the beginning and ending numbers.

 

The unsigned number range for n=9 bits is

0 to 2^(9-1) -1

0 to 2^8-1

0 to 256-1

0 to 255

Here, a 9-bit number range of unsigned values is provided.

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Binary numbers
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
SEE MORE TEXTBOOKS