Zadanie 3.1. (0–1) z .EINP-R1-100-2106 (PodstawyInformatyki)
Mamy dane operacje logiczne na bitach: not, and i or opisane poniżej:
oraz wyrażenie W(a,b):
((not a) and b) or (a and (not b))
| a | not a |
| 1 | 0 |
| 0 | 1 |
| a | b | a and b |
| 1 |
1 |
1 |
| 0 |
1 |
0 |
| 1 |
0 |
0 |
| 0 |
0 |
0 |
| a | b | a or b |
| 1 |
1 |
1 |
| 0 |
1 |
1 |
| 1 |
0 |
1 |
| 0 |
0 |
0 |
((not a) and b) or (a and (not b))
| 1. | W(0,0)=0 | P | F |
|---|---|---|---|
| 2. | W(1,0)=1 | P | F |
| 3. | W(0,1)=0 | P | F |
| 4. | W(1,1)=0 | P | F |
Subskrybuj:
Posty (Atom)