欢迎使用CSDN-markdown编辑器

1.Give the three representations of an AND gate and say in your words what AND means.

2.Give the three representations of an XOR gate and say in your words what OR means.

3.Draw a circuit diagram corresponding to the following Boolean expression: (A + B)(B + C)

4.Show the behavior of the following circuit with a truth table:

A	B	X
0	0	1
0	1	1
1	0	0
1	1	1

5.What is circuit equivalence? Use truth table to prove the following formula.

A	B	(AB)’	A’+B’
0	0	1	1
0	1	1	1
1	0	1	1
1	1	0	0

6.There are eight 1bit full adder integrated circuits. Combine them to 8bit adder circuit using the following box diagram.

7.Logical binary operations can be used to modify bit pattern. Such as

(X8X7X6X5X4X3X2X1)2 and (00001111)2=(0000X4X3X2X1)
(X8X7X6X5X4X3X2X1)2 and (00001111)2=(0000X4X3X2X1)
We called that (00001111)2(00001111)2 is a mask which only makes low 4 bits to work. Fill the follow expression:
（X8X7X6X51111）2
(X8X7X6X5X4’X3’X2’X1’)2

(X8X7X6X5X4’X3’X2’X1’)