CSC340 Homework Assignment 1

Weeks 1 & 2
February/March 2014
Instructor: Haifei Tanner

NOTE: Detailed steps for each problem must be included in your homework to be given
credit for that problem. An answer with no detailed steps in the solution will be given 0
point.

CSC340 Homework Assignment 1 Grading Table:

CSC340 Homework Assignment 1 Assigned
Grading Table Points
Homework 1 turned in via eCollege 1.0
Homework 1 is in PDF format 1.0
Problem 1 1.0
Problem 2 2.0
Problem 3 2.0
Problem 4 2.0
Problem 5 2.0
Problem 6 2.0
Problem 7 2.0
Problem 8 6.0
Problem 9 3.0
Problem 10 3.0
Problem 11.a 4.0
Problem 11.b 4.0
Problem 12.a 4.0
Problem 12.b 4.0
Problem 13 5.0
Problem 14 5.0

Total 53.0

Converted Homework Assignment 1

Grade = (your total points) * 10/ 53 10.0

1. What is the exact number of bits in a memory that contains 640M bits?

2. How many bits are in 1 Tb? You are asked to figure out the exact result. Hint: Depending
on the tool used to calculate this, you may need to use a trick to get the exact result. Note
that220 1,000,00010 d , where d is the different between 220 and 1,000,00010, and that
1T(1,000,00010 d)2.

3. Convert the binary number 10101110.1001 to decimal.

4. Convert the decimal number 1938.257 to hexadecimal.

5. Perform the binary multiplication 100111011011.

6. Perform the binary division 1010110101to obtain a quotient and remainder.

7. Find the binary representations for the BCD number 0011 0111 1000.0111 0101

8. Prove the identity of each of the following Boolean equations, using algebraic
manipulation:
a). ABBCABBC1 b). XY YZ  XZ  XY YZ  XY  XZ YZ

9. Simplify the Boolean expression to an expression containing a minimum number of

literals: ABDACDBD

10. Find the complement of the following expression: (ABC)(ABC)(ABC)

11. Optimize the following Boolean functions by means of a three-variable map:

a).F(A,B,C) m(0,2,3,4,5,7)
b). F(A,B,C) ABAC BCABC

12. Optimize the following Boolean functions by means of a four-variable map:

a).F(A,B,C,D) m(0,2,3,7,8,10,12,13)
b). F(A,B,C,D) BDABDABC

13. Optimize the Boolean function by finding all prime implicants and essential prime
implicants and applying the selection rule: F(W, X,Y,Z) m(0,2,4,6,7,8,9,12,13,15)

14. Optimize the following Boolean function F together with the don’t-care conditions d.
F(W, X,Y,Z) m(2,4,9,12,15), d(W, X,Y,Z) m(3,5,6,13)