Expressing my apology for not posting the notes in time, but it is very difficult to prepare the note in HTML format with so many diagrams. We already discussed about logic gates in previous blog and given you the idea of drawing as well as Boolean laws and theorems. Today we will look at the universal gates NAND and NOR. Any logic circuit can be built using only NAND gates, or only NOR gates. They are the only logic gate needed to build a circuit. Before that I am giving one small example of drawing logic gate | |||||||
| Draw a Logic diagram for following Boolean expression (x.y’)+(y’.z) |
Truth Table
|  | |||||
| x | y | z | xy' | y'z | (x.y’)+(y’.z) | ||
| 0 | 0 | 0 | 0 | 0 | 0 | ||
| 0 | 0 | 1 | 0 | 1 | 1 | ||
| 0 | 1 | 0 | 0 | 0 | 0 | ||
| 0 | 1 | 1 | 0 | 0 | 0 | ||
| 1 | 0 | 0 | 1 | 0 | 1 | ||
| 1 | 0 | 1 | 1 | 1 | 1 | ||
| 1 | 1 | 0 | 0 | 0 | 0 | ||
| 1 | 1 | 1 | 0 | 0 | 0 | ||
| Different Logic Gates using NAND and NOR Gates. | |
| NOT using NAND : |  |
| OR using NAND |  |
| AND using NAND |  |
| NOR using NAND |  |
| NOT using NOR |  |
| OR using NOR |  |
| AND using NOR |  |
| NAND using NOR |  |
| Drawing these diagrams are very painful experience, if you find any error please inform me. My Next blog will be also about Boolean laws and algebra. |
| !!!Wish you all A Very Very Happy and prosperous Diwali!!! |
