Ask your own question, for FREE!
Computer Science 10 Online
Macho14:

Find the number of unordered triplets of boolean operations (AND, OR, XOR, XNOR, NOR, NAND, IMP, and IMPBY) that are sufficient to uniquely determine the values of two ordered bits.

Macho14:

28 I am pretty sure after working on this. anyone good at computer science please check. @Ultrilliam

Macho14:

If I am wrong I will come back with my improved answer

Macho14:

NAND, NOR, XNOR, and IMPBY I know give the same info as AND, OR, XOR, and IMP. So I used that to help in getting the answer

Macho14:

I got if verified, I was correct. Thanks though.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!