Scribd
Upload
253 views4 pages

Assignment # 3 Solution: Your Work To Receive Full Credit

This document contains the solutions to various Boolean algebra and logic circuit problems. It includes: 1) Expressing Boolean functions in Sum of Products and Product of Sum forms and minimizing them. 2) Deriving logic circuit outputs from logic diagrams and truth tables. 3) Performing algebraic manipulations such as expanding functions and proving circuit equivalences. 4) Computing logic operations such as AND, OR, and addition on binary numbers represented in 2's complement form.

Uploaded by

Tayyab Abbas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
253 views4 pages

Assignment # 3 Solution: Your Work To Receive Full Credit

This document contains the solutions to various Boolean algebra and logic circuit problems. It includes: 1) Expressing Boolean functions in Sum of Products and Product of Sum forms and minimizing them. 2) Deriving logic circuit outputs from logic diagrams and truth tables. 3) Performing algebraic manipulations such as expanding functions and proving circuit equivalences. 4) Computing logic operations such as AND, OR, and addition on binary numbers represented in 2's complement form.

Uploaded by

Tayyab Abbas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment # 3

Solution

Q1 (a) Express the following Boolean function in minimized Product of Sum form. You must show all
your work to receive full credit.
F(X ,Y,V,W) = XYW + XYW + XYV + XVW
Ans.
( X  Y  W  V )( X  Y  W  V )( X  Y  W  V )( X  Y  W  V )
POS =
( X  Y  W  V )( X  Y  W  V )( X  Y  W  V )( X  Y  W  V )( X  Y  W  V )
Minimized POS = ( X  V )(Y  W )( X  Y  W )

(b) Express the following Boolean function in a minimized Sum of Product form. You must show all
your work to receive full credit.
F(A, B, C, D) = Σ(1, 3, 6, 13, 14, 15)
Ans.
SOP = ABCD  ABCD  ABC D  ABCD  ABC D  ABCD
Minimized SOP = ABD  ABD  BC D

Q2(a) Give the simplified Sum-of-Product expression (not in the form of NAND/NOR gates) for the
following logic diagram.
Hint: Think about using logic identities to simplify the problem.

c T1
b z

a T2
T4
b

a T3
b

Ans.
T1  C  B
T2  A B
T3  A B
T4  A B
Z  (C  B ) ( A  B )  C  B  A  B  A  B
(b) Find the Product-of-Sum representation for the following logic circuit.

Ans.
F = (A  B)(B + (CD))
= ( AB  AB )( B  C  D )
= (A+B)(A+B)(B + C + D)

Q3. Perform algebraic manipulation for each of the following tasks:


(a) Expand the function f = a  b  c to its standard/canonical form.
Ans.

f  a (b  b)(c  c)  b(a  a )(c  c)  c(a  a )(b  b)


f  abc  abc  abc  abc  abc  abc  abc

(b) Prove algebraically that the following circuits are functionally equal or not:

Ans.
f  x y g  ( x  y )  xy
f  x y  xy g  x y  xy

Thus f and g are equal.


Q4. A function f is described by the following truth table.

F
ABC

000 1
001 0
010 1
011 0
100 1
101 0
110 1
111 1
(a) Indicate the values of F in the above table.
F F
ABC
000 1 0
001 0 1
010 1 0
011 0 1
100 1 0
101 0 1
110 1 0
111 1 0
(b) Give the minterm expression (standard sum-of-products) for F.
Ans.
F(A, B, C) = Σ(0, 2, 4, 6,7)
F (A, B, C) = ABC  ABC  ABC  ABC  ABC

(c) Give the maxterm expression (standard product-of-sums) for F.


Ans.
F(A, B, C) = Π(1, 3, 5)
F  ( A  B  C )( A  B  C ( A  B  C )

Q5. Assuming that A = 0, B = 1, C = 0 & D = 1, find the value of F, given the following equations for F.
(a) F = ABCD + AB + BD
Ans.
F=1
(b) F = (A + B + C)(B + D)(A + C) (A + B + C)(B + D)(A + C)
Ans.
F=0
Q6. Draw a truth table for the following Boolean function.
F = m(0,2,5,7,11,12,14)

Ans.
A B C D 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 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 1
1 1 0 0 1
1 1 0 1 0
1 1 1 0 1
1 1 0 1 0

Q7. Let A = 00100110 and B = 11010011 be 2s complement integers. Compute the following, giving
your answers in both 8-bit 2’s complement and decimal. Use a fixed width of 8 bits (i.e., your answers
must be 8 bits).
(a) A OR B
Ans. A = 00100110
OR B = 11010011
—————————–
11110111 (−9)
(b) A AND B
Ans.
A = 00100110
AND B = 11010011
—————————–
00000010 (2)

(c) A  B  1
Ans.
A = 00100110
B = 00101100
+ 00000001
—————————–
01010011 (83)

You might also like