Hi,
I'm taking my first course in CS. I am confused as to how to make the truth table. I know that FF = F or TF = F for an AND operator. How would I make a table for the following with 0s and 1s:
Q. What are the truth tables for the following Boolean expresssions:
1.
NOT ((a OR b) AND (NOT b)
2.
(a AND b) OR (NOT a AND NOT b)
I really appreciate your help! :confused: