Question: PLEASE SHOW MATH OF IT ALL Given n bits, how many signed numbers can be represented using the sign-and-magnitude method, the ones complement method, and

PLEASE SHOW MATH OF IT ALL

  1. Given n bits, how many signed numbers can be represented using the sign-and-magnitude method, the ones complement method, and the twos complement method, respectively? (5 points)

  1. Number conversion (2.5 x 22 = 55 points)
  1. Convert the following unsigned binary numbers to decimal:

11111

101

  1. Convert the following decimal numbers to binary:

111

35

  1. Convert the following octal numbers to binary:

1111

731

  1. Convert the following unsigned binary numbers to octal:

101010111001

1001

  1. Convert the following decimal numbers to octal:

512

127

  1. Convert the following octal numbers to decimal:

101

2345

  1. Convert the following unsigned binary numbers to hexadecimal:

1010001001001111

1000110011111

  1. Convert the following hexadecimal numbers to binary:

abcdef

3A2B

  1. Convert the following decimal numbers to hexadecimal:

1111

13579

  1. Convert the following hexadecimal numbers to decimal:

bdef

FACE

  1. Convert the following numbers as required:

435 to base-3

2C516 to base-4

  1. Fraction conversion (2.5 x 8 = 20 points)
  1. 0.312510 to octal
  2. 3.62510 to binary
  3. 2.054687510 to hexadecimal
  4. 0.2EC516 to decimal
  5. 0.10112 to decimal
  6. 0.1011012 to hexadecimal
  7. 0.010111012 to octal
  8. 3.5728 to binary

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!