ab'd' + abc + a'bd + a'b'c' + b'c'd' + a'c'd + bcd + acd' Of the 8 terms in the expression above, how many of them are redundant? (Enter a single numerical digit.)

To further enhance discussion and better understanding of Boolean rules and K- map, how would you simplify below standard SOPs using K-map. F(A,B,C,D) = A'B'C'D' + A'B'C'D + A'B'CD+A'B'CD'+A'BCD Hint: construct K-map, then write simplified Boolean SOP expression for each group, but make sure eliminate variables which have different values in the group.

Design a code converter that converts a decimal digit from BCD to excess-3 code, the input variables are organized as (A B C D) respectively with A is the MSB, the output variables are organized as (W XY Z) respectively with W is the MSB, put the invalid decimal numbers as don't care. W=A+BD+BC' W=A+BD+BC, W=A'+BD+BC W= BC'D'+B'D+B'C

Design and implement a 2-bit integer division circuit. The circuit has four inputs A1,A0,B1,B0 and five outputs Q1,Q0,R1,R0,E. The values on A1,A0,B1,and B0 are treated as unsigned binary integer number A and B respectively. The circuit should generate the quotient Q and remainder R of the division A/B on lines Q1,Q0,R1,R0 respectively. If division by zero is attempted, line E is set '1' otherwise E is '0' and the values on lines Q1,Q0,R1,R0 are considered invalid (If division by zero is attempted).  Document the following: 1.specify the truth table for the circuit 2.derive necessary boolean equations (kmaps) 3.draw gate-level logic diagram (logic gate symbols)