Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 1 - Data Storage - Section 1.6 - Storing Integers - Questions & Exercises - Page 63: 2

Answer

a. 00000110 b. 11111010 c. 11101111 d. 00001101 e. 11111111 f. 00000000

Work Step by Step

Conversion of base ten to two’s complement representation: • We have to first check the number to see if it is positive or negative. • If positive ( leftmost bit is zero ), then convert the number from base ten to binary. • The process is to divide the number by 2 until the quotient is zero. • If it is negative ( leftmost bit is one ), then we first convert the number from base ten to binary and then complement the binary number and add 1. --------------------- a. 00000110 b. 11111010 c. 11101111 d. 00001101 e. 11111111 f. 00000000
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.