Draw two circuits that implement two-input XOR: a. Using only 2-input NAND gates. b. Using only 2-input NOR gates. In both circuits, use the smallest number of gates you can.

Implement the circuit defined by equation F(a,b,c,d) = E (0,5,6,7,11) using: 4-to-1 multiplexers and logic gates. 2-to-4 decoders with non-inverted outputs and logic gates. i. ii.

3. →Design and test·a·simplified-logic-circuit-that-emulates a multiplexer with two (2)-input-lines,.one. (1)-selector-line, and one (1) output. Do not use a multiplexer itself-just-design the equivalent. using other Boolean gates. If you are confused ·how·a·multiplexer-works, remember that. Multimedia-logic·simulates·a·multiplexer.chip. "

Design a code converter that converts an unsigned number a into its negative 2's complement representation -a. Specifically, the circuit has two inputs: a1 and ao, and three outputs: b1 and bo (the equivalent to -a) and valid, which is 1 when -a can be represented in 2's complement and O otherwise. 1. Write the truth table for the code converter. 2. Give the simplest SOP expressions for the functions b1, bo, and valid.

What is the primary motivation for using Boolean algebra to simplify logic expressions? It may reduce the number of gates. It may reduce the number of inputs required. It may make it easier to understand the circuit. All of the above are correct.

Apply Boolean algebra simplification rules to Simplify the Boolean expression F = A'B + BC' + A'BC. Draw the circuit diagram of the simplified term using minimum number of gates.

Implement the following circuits only using NAND gates. Use the method of your choice (pushing bubbles, De Morgan's, etc.) a. f(A,B)=(A′+B′)

Given Boolean function is :F= x y + x′ y′ + y′ za. Implement it with only OR & NOT gatesb. Implement it with only AND & NOT gates

One way to think of logic gate types is to consider what input states guarantee a certain output state. For example, we could describe the function of an AND gate as "Any low input guarantees a low output." Identify what type of gate is represented by the following phrase: "Any low input guarantees a high output."