Unit 3 BXE

Question 1

Basic rules of Boolean Algebra

Answer 1

1. A + 0 = A 7. A . A = A
2. A + 1 = 1 8. A .~A = 0
3. A. 0 = 0 9. ~~A = A
4. A .1 = A 10. A + AB = A
5. A + A = A 11. A + (~A)B = A + B
6. A + ~A = 1 12. (A + B)(A + C) = A + BC

Question 2

Application of Boolean Algebra:

Answer 2

Simplification means fewer gates for

the same function.

Question 3

In karnaugh map, rules for groups:

Answer 3

Groups of 1 only.

1. they must be horizontal or vertical react, or squares. not L or anything, not diagonal.
2. groups can only contain 2^n members. 2,4,8…
3. groups should be as large as possible, remember they can overlap.
4. u will have to roll the table to see the group, even if members are at the end of the table its fine as long as they the adjacent cells.

Question 4

Adjacent cells:

Answer 4

Cells who differ by only one bit in karnaugh map. like 000 and 001 are adjacent.

Question 5

Universal gates

Answer 5

nand , nor. Any circuit can be implemented by nand or nor alone.

Question 6

XOR gate as and, or?

Answer 6

Y = A(~B) + (~A)B