Given this place-weighting, or Horner's Algorithm, convert the following eight-bit two's complement binary numbers, i.e. signed arithmetic, into decimal form: (show work) I

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter3: Data Representation
Section: Chapter Questions
Problem 4PE
icon
Related questions
Question
Given this place-weighting, or Horner's Algorithm, convert the following eight-bit
two's complement binary numbers, i.e. signed arithmetic, into decimal form:
(show work)
I
a. 010101012
c. 11000000₂
e. 01010101₂
b. 01110010₂
110101112
f. 011001012
Transcribed Image Text:Given this place-weighting, or Horner's Algorithm, convert the following eight-bit two's complement binary numbers, i.e. signed arithmetic, into decimal form: (show work) I a. 010101012 c. 11000000₂ e. 01010101₂ b. 01110010₂ 110101112 f. 011001012
Expert Solution
steps

Step by step

Solved in 2 steps

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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning