Introduction to Computing Systems: From Bits & Gates to C & Beyond
Introduction to Computing Systems: From Bits & Gates to C & Beyond
3rd Edition
ISBN: 9781260424751
Author: PATT, Yale
Publisher: MCGRAW-HILL HIGHER EDUCATION
Expert Solution & Answer
Book Icon
Chapter 2, Problem 52E

Explanation of Solution

Hexadecimal number conversion

  • For converting hexadecimal number “x434F4D50” into unsigned binary, then each hexadecimal digit is represented as a 4-bit binary string.
  • Hence the unsigned binary number of “x434F4D50” is

    0100 0011 0100 1111 0100 1101 0101 0000.

  • The unsigned binary number of “x55544552” is

    0101 0101 0101 0100 0100 0101 0101 0010

  • The 1’s compliment of a hexadecimal number is calculated by converting the binary string into its one’s compliment and inverting all the bits that is 0 to 1 and 1 to 0.
  • Hence the 1’s compliment of “x434F4D50” is

    1011 1100 1011 0000 1011 0010 1010 1111

  • The 1’s compliment of “x55544552” is

    1010 1010 1010 1011 1011 1010 1010 1101

  • The 2’s compliment of a number is calculated by inverting all bits and then adding number 1 to all bits.
  • Hence the 2’s compliment of “x434F4D50” is

    1011 1100 1011 0000 1011 0010 1011 0000

  • The 2’s compliment of “x55544552” is

    1010 1010 1010 1011 1011 1010 1010 1110

  • For converting the binary string into IEEE format, the binary string is divided into three parts that is sign, exponent and fraction.
  • The exponent and fraction part is then converted into decimal.
  • The IEEE 754 floating point is calculated by

    Decimal = (sign)(1.fraction) * 2exponent - bias

  • For converting hexadecimal number “x434F4D50” into ASCII string,
    • The binary value 01000011 represents hexadecimal 43

Blurred answer
Students have asked these similar questions
Using the notation

you can select multipy options
For each of the following, decide whether the claim is True or False and select the True ones: Suppose we discover that the 3SAT can be solved in worst-case cubic time. Then it would mean that all problems in NP can also be solved in cubic time. If a problem can be solved using Dynamic Programming, then it is not NP-complete. Suppose X and Y are two NP-complete problems. Then, there must be a polynomial-time reduction from X to Y and also one from Y to X.
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education