chapter4_computerscience_IGCSE
chapter4_computerscience_IGCSE
A X
1 0
0 1
The AND gate
Logic notation X = A AND B
Boolean notation X = A.B
A B X
0 0 0
0 1 0
1 0 0
1 1 1
The OR gate
Logic notation X = A OR B
Boolean notation X = A+B
A B X
0 0 0
0 1 1
1 0 1
1 1 1
A B X
0 0 1
0 1 1
1 0 1
1 1 0
The NOR gate
Logic notation X = NOT (A OR B)
Boolean notation X = 𝐴 + 𝐵
A B X
0 0 1
0 1 0
1 0 0
1 1 0
A B X
0 0 0
1 1 0
1 0 1
0 1 1
Logic circuits
AND gate, OR gate, XOR gate.
X = (A AND B) XOR (C OR D)
2! = 16 total output possible
A B C D E F X
0 0 0 0 0 0 0
1 0 0 0 0 0 0
0 1 0 0 0 0 0
1 1 0 0 1 0 1
0 0 1 0 0 1 1
1 0 1 0 0 1 1
0 1 1 0 0 1 1
1 1 1 0 1 1 0
0 0 0 1 0 1 1
1 0 0 1 0 1 1
0 1 0 1 0 1 1
1 1 0 1 1 1 0
0 0 1 1 0 1 1
1 0 1 1 0 1 1
0 1 1 1 0 1 1
1 1 1 1 1 1 0