Name:
Boolean Worksheet 1
Criterion 4 - Demonstrate knowledge and understanding of computer architecture.
1. Convert the following expressions to circuit diagrams:
a. A ᴧ ~B
b. (A ᴧ B) ᴠ C
c. ~(A ᴠ C ᴠ B) ᴧ (B ᴧ ~C)
2. For each expression in Question 1, construct a truth table. (the first has been started for you)
a. A ᴧ ~B
A
B
0
0
0
1
1
0
1
1
~B
A ᴧ ~B
Rosny College 2012, adapted by Claremont College 2014
Page 1 of 4
b. (A ᴧ B) ᴠ C
c. ~(A ᴠ C ᴠ B) ᴧ (B ᴧ ~C)
3. Convert the following circuit diagrams to Boolean expressions:
a.
A
D
B
C
b.
A
D
B
C
Rosny College 2012, adapted by Claremont College 2014
Page 2 of 4
4. For each expression in Question 1, construct a truth table.
a.
b.
5. For each of the following statements, draw up a truth tables to represent the statement *and*
specify which logic operator is represented. (the first has been started for you)
a. The proposition is true only when both variables are true, otherwise it is false.
A
B
0
0
0
1
1
0
1
1
R
b. The proposition is false only when both variables are false, otherwise it is true.
Rosny College 2012, adapted by Claremont College 2014
Page 3 of 4
c. The proposition is false when the variable is true, otherwise it is true.
d. The proposition is false if both propositional variables have the same value, otherwise
it is true.
Rosny College 2012, adapted by Claremont College 2014
Page 4 of 4