ENEE244: Digital Logic Design, by Prof. Peter Petrov, Fall 2008
Homework Assignment #1
Due: September 22 (Monday), in class, or by 11:00am in Prof. Petrov's office (AVW 1421).
No late homework will be accepted for any reasons!
This homework assignment is an individual assignment. Copying of homework problems is considered
an academic dishonesty. However, discussing the problems and exchanging tips is permissible and also
encouraged.
1. Perform the following arithmetic operations in the binary system. Show all the steps in your
computations.
a) 11.011 + 10.111 b) 1011 โ 10.11
c) 101.1 x 11.01 d) 111101.111 : 101.1
2. Perform the following operations in the indicated number system.
a) 8C9EF7(16) + 47DB38(16) b) 700561(8) โ 527632(8)
3. Using the iterative method of number conversion, convert 10110010.1101 into decimal.
4. Determine an algorithm to convert numbers between base 3 and base 9, similar to the special
conversion procedure discussed in class and described in Section 2.6 of your text. Illustrate your
algorithm by converting 12021120.1102(3) into base 9.
5. Consider the signed 1's complement binary numbers A=0s1010110 and B=1s1101100. Perform the
following operations by using only binary addition and 1's complement operations when necessary.
a) A+B b) A-B c) B-A d) -A-B
6. Assume the 7-bit Hamming code group 1101100, consisting of 4 information bits and 3 parity bits, is
received and at most a single error has occurred. Determine the transmitted 7-bit Hamming code group.
7. Text 3.1d, 3.1e
8. Text 3.5c. Then write the corresponding minterm canonical formula.
9. Text 3.7b
10. Complement the following Boolean expression:
w๎
y๎x[๎w๎๎
y๎z๎๎๎z๎๎
y๎]
11. Express the following function in a minterm canonical form:
f๎x , y ,z ๎=๎x๎๎
y๎๎ y๎z๎๎๎
z
12. Text 3.29