Discussion
The functionally complete set is
Answer: D
Correct answer: Both (b) and (c)
A set is functionally complete if every truth function can be expressed with it. NOR alone will do, since \( \lnot p \) is \( p \downarrow p \) and the rest follows, so the second set is complete; and NAND alone is complete for the same reason, which is why a whole processor can be built from NAND gates. The set with only conjunction and disjunction cannot express negation and so is not complete.
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