Scribd
Upload
116 views

ECE-223, Solutions For Assignment #3

This document contains solutions to assignment problems from Chapter 3 of the textbook Digital Design by M. Mano. It provides simplified Boolean expressions and logic gate implementations for functions with up to 4 variables. These include minimizing Boolean expressions using Karnaugh maps, expressing functions in sum of products and product of sums form, incorporating don't care conditions, and implementing circuits using NAND gates and half adders.

Uploaded by

صدام حسین
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
116 views

ECE-223, Solutions For Assignment #3

This document contains solutions to assignment problems from Chapter 3 of the textbook Digital Design by M. Mano. It provides simplified Boolean expressions and logic gate implementations for functions with up to 4 variables. These include minimizing Boolean expressions using Karnaugh maps, expressing functions in sum of products and product of sums form, incorporating don't care conditions, and implementing circuits using NAND gates and half adders.

Uploaded by

صدام حسین
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

ECE-223, Solutions for Assignment #3

Chapter 3, Digital Design, M. Mano, 3rd Edition

3.3) Simplify the following Boolean functions, using three-variable maps:


a) xy + xyz + xyz
b) xy + yz + xyz
c) AB + BC + BC
a)

b)

xy+xz

x+yz

c)
C + AB

3.5) Simplify the following Boolean functions, using four-variable maps:


a) F(w, x, y, z) = (1, 4, 5, 6, 12, 14, 15)
b) F(A, B, C, D) = (0, 1, 2, 4, 5, 7, 11, 15)
c) F(w, x, y, z) = (2, 3, 10, 11, 12, 13, 14, 15)
d) F(A, B, C, D) = (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)

a)

b)

wyz + xz + wxy

1) ACD + AC + ABD + BCD


2) ACD + AC + ABD + ABD

Page:

c)

d)

wx + xy

BD + BD + AB

3.12) Simplify the following Boolean functions in products of sums:


a) F(w, x, y, z) = (0, 2, 5, 6, 7, 8, 10)
b) F(A, B, C, D) = (1, 3, 5, 7, 13, 15)

a)

b)

F = wx + xz + xyz
F = (w + x) (x + z)(x + y + z)

F = BD+ AD
F = (B+D)(A+D)

Page:

3.13) Simplify the following expressions in (1) sum of the products and (2) products of
sums:
a) xz + yz + yz + xy
b) AC + BD + ACD + ABCD
c) (A + B + D) (A + B + C) (A+ B + D)(B+ C + D)

a)

F = xy + z = (x+z)(y+z)

b)

F = AC + CD + BD =
(A+D)(C+D)(A+B+C)

c)

F = BD + AD + AC =
(A+D)(C+D)(A+B+C)

Page:

3.15) Simplify the following Boolean function F , together with the dont-care conditions
d, and then express the simplified function in sum of minterms:
a) F(x, y, z) = (0, 1, 2, 4, 5) , d(x, y, z) = (3, 6, 7)
b) F(A, B, C, D) = (0, 6, 8, 13, 14), d(A, B, C, D) = (2, 4, 10)
c) F(A, B, C, D) = (1,3,5,7,9,15), d(A, B, C, D) = (4,6,12,13)

a)

b)

F = 1 = (0, 1, 2, 3, 4, 5, 6, 7)

F = BD + CD + ABCD
= (0, 2, 6, 8, 10, 13, 14)

c)

F = AD + BD + CD
= (1, 3, 5, 7, 9,13, 15)

Page:

3.16) Simplify the following expressions, and implement them with two-level NAND
gate circuits:
a) AB + ABD + ABD + ACD + ABC
b) BD + BCD + ABCD
a)

b)

F = A + BC + CD

F = BD + BC + ABCD

3.28) Derive the circuits for a three-bit parity generator and four-bit parity checker using
odd parity bit.
Same as Parity generator described in pages 97-99, Digital Design, M. Mano, 3rd edition

x
y

x
y
C
z
P

Page:

3.29) Implement the following four Boolean expressions with three half adders
a) D = A B C
b) E = ABC + ABC
c) F = ABC + (A +B)C
d) G = ABC

Page:

You might also like