0% found this document useful (0 votes)
24 views3 pages

Chapter 1 SR Solutions 5th GE

Chapter 1 of the document covers number systems including decimal, binary, octal, and hexadecimal conversions and calculations. It provides various examples of converting numbers between these systems and solving related problems. Additionally, it includes exercises on binary-coded decimal (BCD) and arithmetic operations in different bases.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
24 views3 pages

Chapter 1 SR Solutions 5th GE

Chapter 1 of the document covers number systems including decimal, binary, octal, and hexadecimal conversions and calculations. It provides various examples of converting numbers between these systems and solving related problems. Additionally, it includes exercises on binary-coded decimal (BCD) and arithmetic operations in different bases.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Problem Solutions, Global Edition – Chapter 1

CHAPTER 1
© Pearson Education Limited 2016.

1-3.*
Decimal, Binary, Octal and Hexadecimal Numbers from (16) 10 to (31) 10
Dec 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

Bin 1 0000 1 0001 1 0010 1 0011 1 0100 1 0101 1 0110 1 0111 1 1000 1 1001 1 1010 1 1011 1 1100 1 1101 1 1110 1 1111

Oct 20 21 22 23 24 25 26 27 30 31 32 33 34 35 36 37

Hex 10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F

1-7.*
(1011001) 2 = 1 × 26 + 0 × 25 + 1 × 24 + 1 × 23 + 0 × 22 + 0 × 21 + 1 × 20
= 64 + 16 + 8 + 1 = 89
(1100111.001) 2 = 1 × 26 + 1 × 25 + 0 × 24 + 0 × 23 + 1 × 22 + 1 × 21 + 1 × 20 + 0 × 2−1 + 0 × 2−2 + 1 × 2−3
= 64 + 32 + 4 + 2 + 1 + 0.125 = 103.125
(10110010.10101) 2 =1 × 27 + 0 × 26 + 1 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 0 × 20
+1 × 2−1 + 0 × 2−2 + 1 × 2−3 + 0 × 2−4 + 1 × 2−5
= 128 + 32 + 16 + 2 + 0.5 + 0.125 + 0.03125= 178.65625

1-9.*
Decimal Binary Octal Hexadecimal
369.3125 101110001.0101 561.24 171.5
189.625 10111101.101 275.5 BD.A
214.625 11010110.101 326.5 D6.A
62407.625 1111001111000111.101 171707.5 F3C7.A

1-10.*
a)
8|7562 2 16612 0.45 × 8 = 3.6 => 3
8|945 1 0.60 × 8 = 4.8 => 4
8|118 6 0.80 × 8 = 6.4 => 6
8|14 6 0.20 × 8 = 3.2 => 3 3463
8|1 1
0
(7562.45) 10 = (16612.3463) 8
b) (1938.257) 10 = (792.41CB) 16
c) (175.175) 10 = (10101111.001011) 2

1
Problem Solutions, Global Edition – Chapter 1

1-11.*
a) (673.6) 8 = (110 111 011.110) 2
= (1BB.C) 16
b) (E7C.B) 16 = (1110 0111 1100.1011) 2
= (7174.54) 8
c) (310.2) 4 = (11 01 00.10) 2
= (64.4) 8

1-16.*
a) (BEE) r = (2699) 10
11 × r 2 + 14 × r1 + 14 × r 0 =
2699
11 × r 2 + 14 × r − 2685 =0
By the quadratic equation: r = 15 or ≈ –16.27
ANSWER: r = 15
b) (365) r = (194) 10
3 × r 2 + 6 × r1 + 5 × r 0 =194
3 × r 2 + 6 × r − 189 =0
By the quadratic equation: r = – 9 or 7
ANSWER: r = 7

1-18.*
a) 0010 1001 0111 0101 = 2975 10
= 101110011111 2
b) 0001 1001 0010.0010 0101 = 192.25 10
= 11000000.01

1-19.*
(694) 10 = (0110 1001 0100) BCD
(835) 10 = (1000 0011 0101) BCD
1
0110 1001 0100
+1000 +0011 +0101
1111 1100 1001
+0110 +0110 +0000
0001 0101 1 0010 1001

2
Problem Solutions, Global Edition – Chapter 1

1-20.*
(a) 101 100
0111 1000
Move R 011 1100 0 100 column > 0111
Subtract 3 −0011
011 1001 0
Subtract 3 −0011
01 1001
Move R 0 1100 110 100 column > 0111
Subtract 3 −0011
0 1001 110
Move R 0100 1110
Move R 010 01110
Move R 01 001110
Move R 0 1001110 Leftmost 1 in BCD number
shifted out: Finished
(b) 102 101 100
0011 1001 0111
Move R 001 1100 1011 1 101 and 100 columns > 0111
Subtract 3 −0011 -0011
001 1001 1000 1
Move R 00 1100 1100 01 101 and 100 columns > 0111
Subtract 3 −0011 −0011
00 1001 1001 01
Move R 0 0100 1100 101 100 column > 0111
Subtract 3 −0011
0 0100 1001
Move R 0010 0100 1101
Move R 001 0010 01101
Move R 00 1001 001101 100 column > 0111
Subtract 3 −0011
00 0110 001101
Move R 0 0011 0001101
Move R 0001 10001101
Move R 000 110001101 Leftmost 1 in BCD
number shifted out: Finished

1-25.*
a) (11111111) 2
b) (0010 0101 0101) BCD
c) 011 0010 011 0101 011 0101 ASCII
d) 0011 0010 1011 0101 1011 0101 ASCII with Odd Parity

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy