Boolean Simplification

Simplify Each of the following functions to a minimum number of literals:

a

$F= wxyz(wxyz'+wx'yz+w'xyz+wxy'z)$

b

$F = AB + ABC'D + ABDE' + ABC'E + C'DE$

c

$F = MNO + Q'P'M + PRM + Q'OMP' + MR$ I can't get that one below 6 literals!

Simplify Each of the following functions to minimum sum-of-products form:

a

$x'z + xy'z + xyz$

b

$x'y'z' + x'yz + xyz$

c

$x'y'z' + x'yz' + xy'z + xyz'$

d

$a'b'c' + a'b'c + abc + ab'c$

e

$x'y'z' + x'yz' + x'yz + xyz$

f

This one has two solutions, each with 3 AND terms, a total of 6 literals

$x'y'z' + x'y'z + x'yz + xyz + xyz'$

Functional Equivalence

Via truth table or algebra, determine if the two functions are the same:

a

$f= a'c' + a'c + bc'$

$g= (a+c)(a'+b+c')$

b

$f = ab + ac + a'bd$

$g = bd + ab'c + abd'$

Canonical Form

For the following function, show the truth table, a minimum sum of products form, a canonical product-of-sums form, and an algebraic expression for the minterms of the complement of the function (f').

$F = \Sigma(0,1,3,5,7)$

About this document ...

ECE 201; Chapter 2 Supplemental Problems

This document was generated using the LaTeX2HTML translator Version 2002 (1.62)

Copyright © 1993, 1994, 1995, 1996, Nikos Drakos, Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999, Ross Moore, Mathematics Department, Macquarie University, Sydney.

The command line arguments were:
latex2html -split 0 Chapter2_supplemental.tex

The translation was initiated by Dan Stanzione on 2003-01-29