Repaso 1
Repaso 1
i 49
8. The parity method for error detection attaches a special parity bit to each trans
mitted group of bits.
IMPORTANT TERMS*
octal number system
hexadecimal number
system
straight binary coding
binary-coded-decimal
(BCD) code
byte
alphanumeric code
American Standard Code
for Information
Interchange (ASCII)
parity method
parity bit
PROBLEMS
SECTIONS 2-1 AND 2-2
2-1.
2-2.
2-3-
(d) 01011011
(e) 11111111
(f) 01110111
(g) 1111010111
(h) 10111111
(d) 1024
(e) 77
(g) 205
(h) 2313
(c) 189
(f)
(i)
405
511
SECTION 2-3
2-4.
2-5.
50
(g) 257
(h) 1204
2-6.
(d) 2000
(e) 165
(f) 5
(f)
2313
These terms can be found in boldface type in the chapter and are defined in the Glossary at the end
of the book.
2-7.
y numbers in Problem 2-
1 to octal.
(c) 2048 (f) 389
2-8.
List the octal num
bers in sequence from 1 2-13. Convert the binary numbers in Problem 2-1 to hexadecimal.
2-14. Convert the hex values in Problem 2-11 to binary.
658 200g.
"When
a
de
2-9.
2-15. List the hex numbers in sequence from 280 to 2A0.
large
cimal number is to be 2-16. How many hex digits are required to represent decimal numbers up to 1 million?
converted to binary, it i
s sometimes
SECTION 2-5
easier to convert it 2-17. Encode these decimal numbers in BCD.
first to octal, and then fr
om octal to binary. Try th
(a) 47 (d) 6727 (g) 42,689,627
is proce
(b) 962 (e) 13 (h) 1204
dure for 2313io co
(c) 187 (f) 888
mpare it with the proced
ure used in Problem 2- 22(e).
1 0
many bits are required to represent the decimal numbers in the ra
2-10. How many octal 18. How
0 1
digits are required to repr nge
1 1 from
0 to 999 using straight binary code? Using BCD code?
esent decimal numbers up
1 0
The
219.
following numbers are in BCD. Convert them to decimal.
to 20,000?
1 1
SECTION 2-4
2-11. Convert these hex
values to decimal.
55
2-7
How many bits are contained in eight bytes?
What is the largest hex number that can be represented in four bytes?
What is the largest BCD-encoded decimal value that can be represented in
three bytes?
Problems
51
2-22. Attach an en-parity bit to each of the ASCII codes for Problem 2-21, and
give the results in hex.
2-23. The following bytes (shown in hex) represent a person's name as it would be
stored in a computer's memory. Each byte is a padded ASCII code. Determine
the name of the person.
42
45
4E
20
53
4D
49
54
48
2-24. Convert the following decimal numbers to BCD code and then attach an oddparity bit.
(a) 74
(b) 38
(c) 8884
(d) 275
(e) 165
(0 9201
2-25. In a certain digital system, the decimal numbers from 000 through 999 are rep
resented in BCD code. An odd-pz-nty bit is also included at the end of each
code group. Examine each of the code groups below, and assume that each
one has just been transferred from one location to another. Some of the
groups contain errors. Assume that no more than two errors have occurred for
each group. Determine which of the code groups have a single error and
which of them definitely have a double error. iHint: Remember that this is a
BCD code.)
(a) 1001010110000
t-parity bit
0100011101100
(b)
(c) 0111110000011
(d)
1000011000101
2-26. Suppose that the receiver received the following data from the transmitter of
Example 2-14:
0
(g)
used as a convenient
____________and____________are
often data?
What errors can the receiver determine in these received
DRILL QUESTIONS
2-27. Perform each of the following conversions. For some of them, you may want
to try several methods to see which one works best for you. For example, a
binary-to-decimal conversion may be done directly, or it may be done as a
binary-to-octal conversion followed by an octal-to-decimal conversion.
(a) l417io =
2
(d)
=
255io
=
110100012
=
IIIOIOIOOOIOOIII2
(f)
5llio
(b)
(c)
(e) 2497io =
(g)
52
2358 =
10
0
8 0
8
0
10
0
0
0
0
0
0
0
10
0
0
0
0
0
0
1
0
0
0
from decimal
to hex
requires repeated
division
by
to its four-bit
binary
equivalent.
(d) The____________
s
e
d
in computer systems.
requires
SECTION 2-7
1. 2267
1. One 2. 9999
2. 32768
SECTION 2-2
1.
1010011
SECTION 2 -8
2. 1011011001
3- 20 bits
SECTION 2-3
4. 627, 630,
1. 396
2. 222; OlGOiOOlO
3- 235
6. 699
631
5. 1111001111
7. 0 to 4095
SECTION 2 -4
1. 9422
2. C2D; 110000101101
4. E9E, E9F, EAO, EM
5. 757
3- 97B5
6. 0 to 65,535
SECTION 2- 5
2. 32
1. IOIIOOIO2; 000101111000 (BCD)
3. Advantage: ease of conversion. Disadvantage: BCD
requires more bits.
1. 43, 4F, 53, 54, 20, 3D, 20, 24, 37, 32 2. STOP
SECTION 2 - 9