COMP2601 Assignment 1 Due 25 Sept 2018 @ 3.

00pm

Question 1
Consider the truth table below and

a. Use a karnaugh map to determine the minimal SOP for F.

b. Draw a circuit diagram for the minimal form of F.

w x y z F
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 0
1 0 1 0 1
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0

Question 2
(a) The following circuit implements two three-input Boolean functions A and B:

(i) Construct truth tables for A and B.

(ii) Express A and B in sum of products form.
(iii) Use Karnaugh maps to find minimal SOP expressions for A and B.
(iv) Using NOR gates only, draw the circuit diagrams that implements the minimal
SOP expression for A and B.
(b) Design a 5-32 decoder using four 3-8 decoders (with enable inputs) and one 2-4 decoder.

Question 3
(a) Assume a 13-bit floating point format in which the most significant bit is the sign bit, the
next 5 bits represent the 5-bit biased exponent field, and the last 7 bits represent the
normalized significand with implied bit.
(i) Show how the computer would represent the numbers 110 and 0.125 using this
floating-point format.
(ii) Show how the computer would add the two floating-point numbers in part 3a(i).
What decimal value for the sum is the computer actually storing? Explain.
(iii) State the effect of changing the size of the exponent and significand fields in the
13-bit floating point format?
(b) Show each stage of Booth’s algorithm when used to multiply the 5-bit multiplicand,
10111 by the 5-bit multiplier, 11010.