Complete the practice problems here:

1-Practice Problems Determine how many transistors are required to build the N-bit compare-for-equality circuit of Figure 4.28. Assume .

2-Design a circuit that implements a 1-bit compare-for-greater-than (1-GT) operation. This circuit is given two 1-bit values, a and b. It outputs a 1 if a > b, and outputs a 0 otherwise.

3-Use the circuit construction algorithm just described to implement the NOR operation shown in Figure 4.20 (a). Remember that the truth table for the NOR operation is:

a b (a NOR b)

0 0 1

0 1 0

1 0 0

1 1 0

4-Use the circuit construction algorithm to implement the NXOR, the Not of the Exclusive OR operation, whose truth table is the following:

a b (a NXOR b)

0 0 1

0 1 0

1 0 0

1 1 1

1- CE CE Circuit bo 1- CE bi 1- CE 1-CE Output aN-2 1-CE N-2 aN-1 1-CE Inputs Outputs