Question

1. What logic gates are known as universal gates? (1 point) a) nand, nor b) and, or, not c) nand, nor, xor, xnor d) None of the above 2. Write the half adder truth table. (4 points) 3. Fill in the blank. (1 point) A2 to 1 mux has input lines. 4. True or False? (1 point) A Boolean algebraic sum of products expression is the complement of the product of sums expression. 5. What is the minimum POS expression for F(x,y,z) = 110, 3, 7)? (3 points) Solve this with a Kmap or Boolean algebra. You may perform your work on scratch paper and do not have to show your work here, just the expression. 6. Write a Verilog module for a 1 bit equality comparator. Use bitwise operators. (8 points)

Answer 1

answer 1.) universal gates ar those gates which can be used to make all other gates.

hence answer is Nand,Nor

answer 2:

A 0 0 1 1 B 0 1 0 1 Sum 0 1 1 0 Carry 0 0 0 1

answer 3:

since we have to select from two inputs only we need 2n=2

where n is select lines hence n=1

we need one select line.

answer 4:

yes SOP form is the complement of POS form nd visa vera.

answer 5:

Output: F Format: Product of sums Y, Z 00 01 11 10 0 0 1 0 1 * 1 1 1 0 1 (X+Y+z) (+7)

answer 6:

module equality_comp(a,b,eq);
input a,b;
output eq;
assign eq=a&b|(~a) & (~b);
endmodule