Analysis NAND, NOR, and XNOR Gates

1. Logic gates II
Ahmed salahuldin Elazhari
202624033
Chapter 5
Teacher: Mohammed Elmagawri

2. Overview
• Definition of NAND, NOR and XNOR gates.
• Analysis NAND gate and truth table for NAND
gate.
• Analysis NOR gate and truth table for NOR
gate.
• Analysis XNOR gate and truth table for XNOR
gate.

3. Introduction
Logic circuits are the basis for modern digital
computer systems. To appreciate how computer
systems operate you will need to understand
digital logic and Boolean algebra. This chapter
provides only a basic introduction to Boolean
algebra – describing it in its entirety would take
up an entire textbook. I chose to concentrate on
the basics of Boolean algebra, rather than on
optimizing concepts.

4. Universal gates
A universal gate is a gate, which can implement
any Boolean function without need to use any
other gate type.

5. NAND Gate

6. Example

7. Example

8. NOR Gate

9. Example

10. Example

11. XNOR Gate

12. Example

13. Conclusion
We achieved all the objectives and all the
output results we got were accurate to initial
calculated values as well as theory of Boolean
equation. Less connecting wires can reduce any
time delay etc. The aim of this experiment was
achieved.