Computer Science
Computer Science
A 0, B 0,x 0A 1, B 0,X 0A
0,B 1,X 0A 1,B 1,X 1
= =
= = = =
= = = =
= =
Example
->
I)-lORGate); A 0, B 0, x
=
=
0
=
A 1, B 0,X 1
=
=
=
A 0, B 1,
=
=
X = A 1, B 1,X 1 =
= =
B
-0-(NOTGate); A 0, =
x 1 =
A b,x=
0
=
Truth Table
I Expressed with a
"-
"where A ( =
->
2 2x2x2 =
8
->
ID--(MANDGate); A 0, B 0, x 1
=
=
=
A 1, B 0,X 1 A 0,B 1,X 1 A 1,B 1,X
=
=
= = = =
=
=
0
=
O 00 0 O O
A 1, B 0,X 0A 0,B 1,X 0A 1, B 1,X 0
IDo-(NORGate);A 0, B 0,
=
=
x 1
=
=
= =
= = =
-> = =
=
00 00 O
-
(
01 0 1 0 O
0
-> 0, B 0, x 0
= =
= = =
= = =
= = =
I I I
=
0 I I
"*"where AGB)
(Expressed with a
100 I 0 O
10 I I I I
Boolean Expression 10 I 0 0
the 2. I I I I
1. Identify gates Write down the I I
.)"* Expression
OR Gate 42 I
->
->
NAND Gate -> A B +
Count up using binary
to fill the combinations
1. A
-> ORgate, lable as
it
c. Jo B
(Intemidiate Outputs (
-> 2. NAND gate, lable it as B
(((A B(*(5e() c)
+ + x
=
4. OR gate, lable
->
ita s D
-
to show
Use brackets
->
4. Create
your expression
-> A* B 13.) -> As seen A is to A B
expanded
+
(
-> C + Input
This
Try
->