Scribd
Upload
179 views3 pages

Chapter 1 Problems

This document contains 36 problems related to number systems and conversions between binary, octal, decimal, and hexadecimal number representations. The problems involve tasks like converting between different number bases, performing arithmetic operations in different bases, implementing codes like ASCII and BCD, and using logic gates and truth tables.

Uploaded by

M Naveed Shakir
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
179 views3 pages

Chapter 1 Problems

This document contains 36 problems related to number systems and conversions between binary, octal, decimal, and hexadecimal number representations. The problems involve tasks like converting between different number bases, performing arithmetic operations in different bases, implementing codes like ASCII and BCD, and using logic gates and truth tables.

Uploaded by

M Naveed Shakir
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

PROBLEMS

Answers to problems marked with * appear at the end of the book.


1.1 List the octal and hexadecimal numbers from 16 to 32. Using A, B, and C for the last three
digits, list the numbers from 8 to 28 in base 13.
1.2* What is the exact number of bytes in a system that contains (a) 32K bytes , (b) 64 MB and
(c) 6.4G bytes?
•
1.3 Convert the following numbers with the indicated bases to decimal:
(a)* (4310)5 (b) (198)12
(c) (735)8 (d) (525)6
1.4 What is the largest binary number that can be expressed with 14 bits? What are the
equivalent decimal and hexadecimal numbers?

1.5* Determine the base of the numbers in each case for the following operations to be
correct
(a) 14/2 = 5, (b) 54/4=13
(c) 24 + 17 = 40.
1.6* The solutions to the quadratic equation x2 - 11 x + 22 = 0 are x = 3 and x =6. What is the base
of the numbers?
1.7* Convert the hexadecimal number 68BE to binary, and then convert it from binary to octal.
1.8 Convert the decimal number 431 to binary in two ways: (a) Convert directly to binary; (b)
convert first to hexadecimal and then from hexadecimal to binary. Which method is faster?
1.9 Express the following numbers in decimal:
(a)* (10110.0l01)2 (b)* (16.5)16
(c)* (26.24)8 (d) (FAFA)16
(e) (1010.10l0)2
1.10 Convert the following binary numbers to hexadecimal and to decimal: (a) 1.10010, (b)
110.010. Explain why the decimal answer in (b) is 4 times that in (a).
1.11 Perform the following division in binary: 111011 ÷ 10l.
1.12* Add and multiply the following numbers without converting them to decimal.
(a) Binary numbers 1011 and 101.
(b) Hexadecimal numbers 2E and 34.
1.13 Do the following conversion problems:
(a) Convert decimal 27.315 to binary.
(b) Calculate the binary equivalent of 2/3 out to eight places. Then convert from binary to
decimal. How close is the result to 2/3?
(c) Convert the binary result in (b) into hexadecimal. Then convert the result to decimal.
Is the answer the same?
1.14 Obtain the l's and 2's complements of the following binary numbers:
(a) 10000000
(b) 11011010
(c) 10000101
1.15 Find the 9's and the 10's complement of the following decimal numbers:
(a) 52,784,630 (b) 63,325,000
(c) 25,000,000 (d) 00,00,000

1.16 (a) Find the 16's complement of B2FA. (b) Convert B2FA to binary.
1.17 Perform subtraction on the given unsigned numbers using the 10's complement of the
subtrahend. Where the result should be negative, find its 10's complement and affix a minus sign. Verify
your answers.
(a) 6,428 - 3,409
(b) 2,043 - 6,152
1.18 Perform subtraction on the given unsigned binary numbers using the 2's
complement of the subtrahend. Where the result should be negative, find its 2's
complement and affix a minus sign.
(a) 10011 - 10001 (b) 100010 - 100011
(c) 1001 - 101000 (d) 110000 - 10101
1.19* The following decimal numbers are shown in sign-magnitude form: +9,286 and +801.
Convert them to signed-l0's-complement form and perform the following operations
(note that the sum is + 10,627 and requires five digits and a sign).
(a) (+9,286) + (+801)
(b) (-9,286) + (+801)
1.20 Convert decimal +46 and +29 to binary, using the signed-2's-complement
representation and enough digits to accommodate the numbers. Then perform the
binary equivalent of (+29) + (-49), (-29) + (+49), and (-29) + (-49). Convert the
answers back to decimal and verify that they are correct.
1.21 If the numbers (+9,742)10 and (+641)10 are in signed magnitude format, their
sum is (+ 10,383)10 and requires five digits and a sign. Convert the numbers to
signed-l0's-complement form and find the following sums:
(a) (+9,742) + (+641)
(b) (-9,742) + (+641)
1.22 Convert decimal 8,723 to both BCD and ASCII codes. For ASCII, an even parity
bit is to be appended at the left.
1.23 Represent the unsigned decimal numbers 842 and 537 in BCD, and then show
the steps necessary to form their sum.
1.24 Formulate a weighted binary code for the decimal
digits, using weights (a)* 6, 3, 1, 1
1.25 Represent the decimal number 5,137 in (a) BCD, (b) excess-3 code, (c) 2421 code,
and (d) a 6311 code.
1.26 Find the 9's complement of decimal 5,137 and express it in 2421 code. Show that
the result is the l's complement of the answer to (c) in Problem 1.25. This
demonstrates that the 2421 code is self-complementing.
1.27 Assign a binary code in some orderly manner to the 52 playing cards. Use the
minimum number of bits.
1.28 Write the expression "G. Boole" in ASCII, using an eight-bit code. Include the
period and the space. Treat the leftmost bit of each character as a parity bit.
Each eight-bit code should have even parity. (George Boole was a 19th
century mathematician. Boolean algebra, introduced in the next chapter, bears
his name.)
1.29* Decode the following ASCII code:
10000010 1101001 1101100 1101100 1O00111 1100001 1110100 1100101 1110011.

1.30 The following is a string of ASCII characters whose bit patterns have been
converted into hexadecimal for compactness; 73 F4 E5 76 E5 4A EF 62 73. Of the
eight bits in each pair of digits, the leftmost is a parity bit. The remaining bits are
the ASCII code.
(a) Convert the string to bit form and decode the ASCII.
(b) Determine the parity used: odd or even.
•
1.31* How many printing characters are there in ASCII? How many of them are special
characters. (not letters or numerals)?
1- 32* What bit must be complemented to change an ASCII letter from capital to lowercase and vice
versa?
1.33* The state of a 12-bit register is 100010010111. What is its content if it represents
(a) three decimal digits in BCD?
(b) three decimal digits in the 84-2-1 code?
1.34 List the ASCII code for the 10 decimal digits with an odd parity bit in the leftmost position

1.35 By means of a timing diagram similar to Fig. 1.5, show the signals of the outputs f and g in
Fig.P1.35 as functions of the three inputs a, b, and c. Use all eight possible combinations of a, b,
and c.

abc

g
Figure P1.35

1.36 By means of a timing diagram similar to Fig. 1.5, show the signals of the outputs f ands g in
Fig.P1.36 as functions of the two inputs a and b. Use all four possible combinations of a and b.

a b

Figure P1.36

You might also like