Truth Tables (again)
Recall that a boolean equation can be represented by a Truth Table
A B C F 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 1
A truth table for a boolean function of N variables has 2N entries.
The ‘1’s represent F(A,B,C).
The ‘0’s represent F’(A,B,C)