In: Computer Science
1.) Simplify the following expression to a minimum number of literals. This problem must be solved through Algebraic Manipulation. All work must be shown on the submitted work. Things to remember. If you can't see anything to work with from the beginning, expand. Formula Sheet has been provided.
a.) Simplify (you MUST submit your work to get credit for this
problem)
F(a, b, c) = bc + a’b + ab’ + ac’
2.) Express the given function in terms of its minterms and Maxterms. You may use a truth table or algebraic manipulation to determine your solution. F(a, b, c) = abc’ + a’c’ + ab’ + b’c
a.)F(a, b, c) = ∑m( #, #, ... , #)
b.) Write out the full expression for the Product of Maxterms. DO NOT use the Pi notation, ∏M (#, #, ... #).
(i.e. (...) (...) .... (...) )
ANSWERS:
1. a.) bc + a’b + ab’ + ac’ = a + b
2. a.) abc' + a'c' + ab' + b'c =
(0, 1, 2,
4, 5, 6)
It is the minterm representation
b.) The maxterm representation of
abc' + a'c' + ab' + b'c is
(a + b' +
c')(a' + b' + c')
EXPLANATION: