Scribd
Upload
8 views3 pages

Worksheet 1

This worksheet from Addis Ababa Institute of Technology's Digital Logic Design course includes various exercises on number base conversions, binary arithmetic, and gray code encoding. Students are tasked with performing conversions between binary, decimal, octal, hexadecimal, and BCD, as well as executing binary arithmetic operations and exploring properties of gray code. The document also includes questions on determining bases for certain operations and encoding schemes for specific digit ranges.

Uploaded by

Fethulmubin
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
8 views3 pages

Worksheet 1

This worksheet from Addis Ababa Institute of Technology's Digital Logic Design course includes various exercises on number base conversions, binary arithmetic, and gray code encoding. Students are tasked with performing conversions between binary, decimal, octal, hexadecimal, and BCD, as well as executing binary arithmetic operations and exploring properties of gray code. The document also includes questions on determining bases for certain operations and encoding schemes for specific digit ranges.

Uploaded by

Fethulmubin
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

Addis Ababa Institute of Technology

School of Electrical and Computer Engineering


Worksheet 1

Course no. ECEG 3201 Course Title: Digital Logic Design

1. Perform the following conversions:


a. 1043.2510 = ?2
b. 110110102 = ?10
c. 110110102 = ?8
d. FE24816 = ?8
e. 1101000101.010101102 = ?16
f. 96310 = ?BCD
g. 757.2510 = ?16
2. Assuming 8-bit binary values including sign bit, perform the following conversions:
a. +10310 = ?2 in signed magnitude
b. -10310 = ?2 in signed magnitude
c. -10310 = ?2 in 1’s complement
d. -10310 = ?2 in 2’s complement
e. +10310 = ?2 in 2’s complement
3. Assuming 8-bit binary values, including sign bit, perform the following subtractions using 2s
complement addition (showing all your work) :
a. 12310 – 6810 = ?2
b. 6810 -12310 = ?2
c. -6810 -12310 = ?2
4. Perform the following binary arithmetic
a. 10001 * 101
b. 110110 * 11101
c. 11101001/101
d. 10001101/110
5. What is the exact number of bytes in a system that contains (a) 32K bytes, (b) 64M bytes,
and (c) 6.4G bytes?
6. Determine the base of the numbers in each case for the following operations to be
correct:
a. 024+043+013+033 = 223
b. 14/2 = 5
c. 54/4 = 13
d. 24 + 17 = 40

Page 1 of 3
2019/2020 A. Y
7. The solutions to the quadratic equation x2 - 11x + 22 = 0 are x = 3 and x = 6. What is the
base of the numbers?
8. As you recall from class, the defining property of the gray code encoding is that the
representations of adjacent values are only 1 bit apart from each other. Do keep in mind
that the gray code adjacency behavior wraps around.
a. Give a valid gray code mapping scheme for the blanks in the following table. If you
are confident that it is impossible to assign a mapping to some value, put an X and
briefly explain why this cannot be done.

b. Give a valid gray code mapping scheme for the blanks in the following table. If you
are confident that it is impossible to assign a mapping to some value, put an X and
briefly explain why this cannot be done.

c. Suppose that you wanted to represent all of the digits from 0 to 7 inclusive in some
form of gray code encoding. Would that be possible with some number of bits? If
yes, please give the smallest number of bits that would be needed AND give some
valid gray code encoding for all the digits. If not, please briefly justify why.
d. How about encoding all of the digits from 0 to 8 inclusive? Is this possible using
some number of bits? If yes, please give the smallest number of bits that would be
needed AND give some valid gray code encoding for all the digits. If not, please
briefly justify why.
e. Suppose that instead of having a code where the encodings of all adjacent digits are
exactly one bit apart from each other (as in gray code), they would be exactly 2 bits
apart. Given this condition, would it be possible to come up with some hamming
distance 2 code scheme for the values 0 to 3 inclusive with 3 digits? If yes, please

Page 2 of 3
2019/2020 A. Y
give such an encoding map (i.e. an encoding for each value 0 to 3); if not, briefly
explain the problems that arise.
f. Finally, with the same constraints (3 digits and a hamming distance of 2), can you
find a way to represent all of the digits from 0 to 5 inclusive? If yes, please give
such an encoding map (i.e. an encoding for each value 0 to 5); if not, briefly explain
the problems that arise.

Page 3 of 3
2019/2020 A. Y

You might also like