Consider the combinational circuit shown 1. Derive the Boolean expressions for T1 through T4. Evaluate the outputs F1 and F2 as a function of the four inputs 2. List the truth table with 16 binary combinations of the four input variables. Then list the binary values for T1 through T4 and outputs F1 and F2 in the table.

For the following question, you need to create a truth table, write the Boolean expression for each output based on the truth table, use K-map to simplify the expression if possible, and draw the logic diagram using AND, OR, NOT gate only. 1. Design a 3-bit shifter. a. A0, A1, A2, and S as inputs b. If S=0, then shift one bit to the left and add 0 to the last bit c. If S=1, then shift one bit to the right and add 0 to the first bit d. Y0, Y1, and Y2 as outputs

Given the circuit diagram shown in figure 1, Write its truth table, then from the truth table derive the Boolean expression for the output S. A. B Figure 1

A 4-to-1 multiplexer is defined by the following symbol and truth table. f Si So S1 So 0 0 0 1 Wo Wo W1 W1 1 W2 W2 1 1 W3 W3 A logic circuit is implemented as below. The logic function f is the function of x1 and x0. Write the function f expression. Xo X1 So Wo f 1 W1 W2 W3 1

Put the attached boolean expression into a 4 variable k map and use the k map to find a simplified expression.