Discussion
How many entries will be there in the truth table of a 3 input NAND gate ?
Answer: D
The truth table has 8 entries.
Each input can be 0 or 1, so n inputs give 2n combinations. For three inputs, 23 = 8 rows, from 000 to 111. For a NAND gate the output is 0 only in the row 111 and 1 in the other seven.
3 counts the inputs rather than the combinations, 6 is 2 × 3, and 9 is 32, none of which is the number of binary input combinations.
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