Computer Organization and Architecture
Class Activity
C’D’
A’B’
A’B
AB
AB’
F= B’D + AD
C’D
1
CD
1
1
1
1
1
CD’
A’B’
A’B
AB
AB’
C’D’
1
1
C’D
1
1
CD
CD’
1
1
C’D’
1
C’D
CD
1
1
CD’
1
1
C’D’
1
C’D
1
CD
CD’
1
1
1
C’D’
1
1
C’D
F=
A’B’
A’B
AB
AB’
A’B’
A’B
AB
AB’
A’B’
A’B
AB
AB’
C’D’
1
C’D
1
1
1
1
1
C’D’
1
1
1
1
C’D
C’D’
1
C’D
A’B’
A’B
AB
AB’
CD’
A’B’
A’B
AB
AB’
CD
CD
CD’
1
1
1
1
CD’
1
1
C’D
1
1
C’D’
1
1
1
CD
1
1
C’D
CD
A’B’
A’B
AB
AB’
1
A’B’
A’B
AB
AB’
CD’
1
1
1
1
A’B’
A’B
AB
AB’
1
1
C’D’
A’B’
A’B
AB
AB’
CD
CD’
1
1
1
A’B’
A’B
AB
AB’
1
1
CD
1
CD’
1
1
1
C’D’
1
1
1
1
C’D
C’D’
1
1
CD
CD’
C’D
CD
CD’
1
1
1
1
1
1
1
Fold up the corners of the map below like it is a napkin to make the four cells
physically adjacent.
Question
1.
X = 1 , if NOT A AND NOT B OR B AND C
Boolean algebra:
Logic circuit diagram:
Truth table: