Question

(2) (5 pomis) TL A-011000103, B = 011011012. Clearly 3. Conversion between truth table, circuit diagram and Boolean function. (1) (6 points) For the circuit below, write the Boolean expression F(A, B, C). Then write down the truth table for F. (2) (4 points) Draw a circuit schematic diagram which implements the following Boolean function. (Don't simplify the expression.) F(X2, X1, Xo) = x;'(x2+xo)' + xo'X1X2 (3) (10 points) The output of a logic function F(A,B,C) is one only if two of the in- puts equal one. Write down the truth table for the function F(A,B,C) and deter mine the standard SOP form for F(A,B,C) and then clearly draw the circuit.

Answer 1

To draw the circuits schematics, the answer is given on sheet of paper. Ask for queries if any.

3 (1) Given circuit, A Do NOT B DO DI OR C. NOT D OR AND Truth Table F = BC F = Ā+ Fi = Ã+ BC А в c | F ooo! 0 0 1 0 1 0 O Tool TO 11 lol 110 00.- O ---- 7 (2) F(X2, X, Xo) = x (x 2 + x) + 70 x, 2₂ to Do T **, 22 I NOT H 'f'(output) 3-input AND' (X0+2), NOT 'OR AND Fig Circuit schematic

(3) Logic: Output of a logic function F(A, B, C) is one only if two of the inputs equal one. Touth table A B C F 0 0 0 0 0010 o lo lo 0111 oooo - - O - OOO 1 1 0 III o In standard sop (sum of Products) F(A, B, C) = Sum of terms (3,5,6) o ĀBC+ A B C + ABC ĀBC AB Dar "NOT Figs Cirauit schematic