Consider this truth table for the partially specified function F(A,B,C). ABC F(A,B,C) 000 0 00 1...

   

Transcribed Image Text:

Consider this truth table for the partially specified function F(A,B,C). ABC F(A,B,C) 000 0 00 1 01 0 1 0 1 0 0 1 1 0 1 11 0 11 1 1 1 X 0 1 X 1 a. Show the K-map for F(A,B,C). b. Think about how you want to choose the values of the two Don't Care computed results, then show an image of the K-map with circles around the optimal groupings of K-map minterms to most simplify an SOP implementation of F(A,B,C). Write out this simplest SOP expression for E(A,B,C). c. On a new image of the K-map, and re-considering the choice of values for the Don't Cares, circle the optimal groupings of maxterms to most simplify a POS implementation of E(A,B,C). Write out this simplest POS expression for E(A,B,C). Consider this truth table for the partially specified function F(A,B,C). ABC F(A,B,C) 000 0 00 1 01 0 1 0 1 0 0 1 1 0 1 11 0 11 1 1 1 X 0 1 X 1 a. Show the K-map for F(A,B,C). b. Think about how you want to choose the values of the two Don't Care computed results, then show an image of the K-map with circles around the optimal groupings of K-map minterms to most simplify an SOP implementation of F(A,B,C). Write out this simplest SOP expression for E(A,B,C). c. On a new image of the K-map, and re-considering the choice of values for the Don't Cares, circle the optimal groupings of maxterms to most simplify a POS implementation of E(A,B,C). Write out this simplest POS expression for E(A,B,C).