Problem 1 Write an eight-row truth table for the Boolean function f(a, b, c) = (a + c)(a + b). Hint: First simplify the expression into sum of products form. 1

Construct a truth table for the Boolean equation: F  = A’B’ C + A’B C + A B’C’ + A B’C +A B C’ + A B C Draw the SOP of the function F Minimize the function F using K map Draw the minimized form of the circuits that represents the equation above.       A B C F 0 0 0 0                                                 1 1 1 1

Simplifying Boolean Equations: Simplify the following Boolean equations. Show your work and list which axiom or theorem you used in each step. Your final equation should be in minimized sum-of-products(SOP) form.  X = [(A’B+C)' + DE’]’ Please list each therom used line by line during the solving process.

. Consider the following truth table: Inputs Output Inputs Output ABC A B 00 1 100 0 10 1 1 1 1 110 1 1 11 1 a. Write the unsimplified Boolean maxterm expression. b. Generate a 3-variable KMap for the maxterm. c. Write a simplified Boolean expression based on the KMap. d. Draw a logic circuit to represent the simplified expression from (c). 2. Repeat #1 for the following table, but this time incorporate the minterm Sum of Products method for the 4-variable truth table. A BCDY 00000 00011 00 101 0 0 110 01001 01010 0 1101 01 1 1000 10011 10100 10110 1100 1 11011 11 00 11111 lo