Question

Please help with computer science

Consider the following truth table, where X, Y, and Z are Boolean variable inputs and W is a Boolean-valued result:

X	Y	Z	W
0	0	0	1
0	0	1	0
0	1	0	1
0	1	1	1
1	0	0	1
1	0	1	0
1	1	0	0
1	1	1	0

Write an expression for the above table using ~&|.

Consider the following truth table, where X, Y, and Z are Boolean variable inputs and W is a Boolean-valued result:

X	Y	Z	W
0	0	0	0
0	0	1	0
0	1	0	1
0	1	1	0
1	0	0	1
1	0	1	1
1	1	0	1
1	1	1	0

Write an expression for the above table using ~&|.

3) For Booleans A and B, "A NOR B" is defined to be "NOT (A OR B)". Help prove that NOR is universal (like NAND) by entering an expression using just parentheses, NOR operators and A that will be the same as NOT A. For purposes of this question, - will be used as the NOR operator, so A-B means A NOR B. You can only use the characters ()-A to answer this question.

4) For Booleans A and B, "A NOR B" is defined to be "NOT (A OR B)". Help prove that NOR is universal (like NAND) by entering an expression using just NOR operators, parentheses, and Boolean variables A, B that will be equivalent to A|B. (I.e., A OR B). For purposes of this question, - will be used as the NOR operator, so "A - B" means "A NOR B".

5) For Booleans A and B, "A NOR B" is defined to be "NOT (A OR B)".Help prove that NOR is universal (like NAND) by entering an expression using just NOR operators, parentheses, and Boolean variables A, B that will be equivalent to A&B. (I.e., A AND B). For purposes of this question, - will be used as the NOR operator, so "A - B" means "A NOR B".

Answer 1