Exercise ( K-maps)

Exercise

Below are some exercise for you to try it out !! Enjoy !

Write a simplified expression for the Boolean function defined by each of the following K-maps:

Karnaugh Map

Karnaugh Map

Universal Gate

Universal gate

Definition :

-A gate that can use to execute any gates like AND, OR and NOT or any combination of this 3 gates.

-There are two gates that can consider universal gate:

          1) NAND gate

2) NOR gate

1) NAND gate

- Negated AND or NOT AND gate.

- A logic gate will produce false only if all the input is true.

A	B	A NAND B
0	0	1
0	1	1
1	0	1
1	1	0

Table below represents why NAND gate is a universal gate

Gates	Equivalent NAND gates
NOT A NOT A 0 1 1 0
AND A B A AND B 0 0 0 0 1 0 1 0 0 1 1 1
OR A B A OR B 0 0 0 0 1 1 1 0 1 1 1 1
NOR A B A NOR B 0 0 1 0 1 0 1 0 0 1 1 0

2) NOR gate

- Nagated OR or NOT OR gate.

- A logic gate will produce true only if all the input is false.

A	B	A NOR B
0	0	1
0	1	0
1	0	0
1	1	0

Table below represents why NOR gate is a universal gate

Gates	Equivalent NOR gates
NOT A NOT A 0 1 1 0
AND A B A AND B 0 0 0 0 1 0 1 0 0 1 1 1
OR A B A OR B 0 0 0 0 1 1 1 0 1 1 1 1
NAND A B A NAND B 0 0 1 0 1 1 1 0 1 1 1 0

You may try the below link to try using the logic simulator to do your logic circuit…… 

Logical Gate Simulator =

Online Testing……

http://www.cs.kent.edu/~volkert/F10-10051/notes/logsim.html

or can download at here……

http://jaist.dl.sourceforge.net/project/gatesim/1.4/GateSimSetup-1.4.msi