Discussion
The NAND gate is functionally complete, so any Boolean function can be built using NAND gates alone.
Answer: B
Correct answer: True
NAND is functionally complete: a NOT is a NAND with its inputs tied together, an AND is a NAND followed by that inverter, and an OR follows from De Morgan’s theorem. NOR is the other functionally complete gate.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development