Gyakorlás - logikai műveletek
0 AND (1 XOR 0)= 0 AND 1= 0
1 OR (NOT 0)= 1 OR 1= 1
1 XOR (1 AND 1)= 1 XOR 1= 0
0 OR (1 AND 0) = 0 OR 0= 0
(1 XOR 0) AND (NOT 0)= 1 AND 1= 1
(0 OR 1) XOR (1 AND 0)= 1 XOR 0= 1
(1 AND 1) OR (0 XOR 0)= 1 OR 0= 1
NOT (0 AND 1)= NOT 0= 1
NOT (1 OR 1)= NOT 1= 0
NOT (1 XOR 0)= NOT 1= 0
NOT (NOT 1)= NOT 0= 1
NOT (NOT 0)= NOT 1= 0
0 AND (1 AND 1)= 0 AND 1= 0
1 AND (1 AND 1)= 1 AND 1= 1
1 OR (0 OR 1)= 1 OR 1= 1
0 XOR (1 XOR 1)= 0 XOR 0= 0
(1>2) AND (3>1)= 0 AND 1= 0
(1<3) OR (4<1)= 1 OR 0= 1
(5>4) XOR (6<9)= 1 XOR 1= 0
(3=3) OR (2>0)= 1 OR 1= 1
(7<2) XOR (5<6)= 0 XOR 1= 1
(4>8) AND (4>3)= 0 AND 1= 0
(2<3) AND (4<=5) OR (6>=7)= 1 AND 1 OR 0= 1 OR 0= 1
(8<3) OR (4<=1) XOR (2>=7)= 0 OR 0 XOR 0= 0 XOR 0= 0
(6>9) XOR (5<7) AND (4>5)= 0 XOR 1 AND 0= 1 AND 0= 0
NOT (7>11) AND (9<3)= NOT 0 AND 0= 1 AND 0= 0
NOT (6<8) XOR (1<2)= NOT 1 XOR 1= 0 XOR 1= 1
NOT (3<10) AND (NOT(5>6))= NOT 1 AND (NOT 0)= 0 AND 1= 0
NOT (9>7) OR (5>2)= NOT 1 OR 1= 0 OR 1= 1
1 XOR 0 AND 1= 1 AND 1= 1
0 XOR 1 OR 0= 1 OR 0= 1
1 AND 0 OR 0= 0 OR 0= 0
0 AND 0 XOR 1= 0 XOR 1= 1
0 OR 1 AND 0= 1 AND 0= 0
1 OR 1 XOR 0= 1 XOR 0= 1
1 AND 1 XOR 1= 1 XOR 1= 0
A |
0110 |
1010 |
1100 |
1011 |
0001 |
1001 |
1111 |
B |
1111 |
1011 |
1000 |
0101 |
1000 |
0011 |
1100 |
NOT B |
0000 |
0100 |
0111 |
1010 |
0111 |
1100 |
0011 |
A AND B |
0110 |
1010 |
1000 |
0001 |
0000 |
0001 |
1100 |
A OR B |
1111 |
1011 |
1100 |
1111 |
1001 |
1011 |
1111 |
A XOR B |
1001 |
0001 |
0100 |
1110 |
1001 |
1010 |
0011 |
A |
0001 |
1101 |
1001 |
1011 |
1000 |
1111 |
1100 |
B |
0101 |
1100 |
1001 |
1101 |
0101 |
0000 |
0011 |
NOT B |
1010 |
0011 |
0110 |
0010 |
1010 |
1111 |
1100 |
A AND B |
0001 |
1100 |
1001 |
1001 |
0000 |
0000 |
0000 |
A OR B |
0101 |
1101 |
1001 |
1111 |
1101 |
1111 |
1111 |
A XOR B |
0100 |
0001 |
0000 |
0110 |
1101 |
1111 |
1111 |