14 markseasy
Four logic gates and five standard symbols for logic gates are shown
Draw one line to link each logic gate to its standard symbol. Not all standard symbols will be used.
Computer Science
Boolean Logic (Cambridge International IGCSE Computer Science): Exam Questions
Exam code:047810 questions · 70 marks · ≈ 70 min
26 markseasy
2 marks
Complete the truth table in Fig. 1 for the Boolean statement P = NOT(A AND B).
| A | B | P |
|---|---|---|
| 0 | 0 | 1 |
| 0 | 1 | |
| 1 | 0 | |
| 1 | 1 | 0 |
Fig. 1
4 marks
Complete the truth table for the following logic gate.
| A | B | Q |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 0 | ||
| 1 |
38 marksmedium
4 marks
(a)
Consider this logic expression.
X = ( A AND B ) OR ( B AND NOT C )
Draw a logic circuit for this logic expression.
Each logic gate must have a maximum of two inputs.
Do not simplify this logic expression.
4 marks
(b)
Extract:
X = (A AND B) OR (B AND NOT C)
Complete the truth table from the given logic expression.
| A | B | C | Working space | X |
|---|---|---|---|---|
| 0 | 0 | 0 | ||
| 0 | 0 | 1 | ||
| 0 | 1 | 0 | ||
| 0 | 1 | 1 | ||
| 1 | 0 | 0 | ||
| 1 | 0 | 1 | ||
| 1 | 1 | 0 | ||
| 1 | 1 | 1 |
43 marksmedium
Extract:
- Accept a correct expression without the "P =" label (e.g. "(A AND B) OR NOT C") for full marks.
- Accept symbol notation (^ for AND, V for OR, \u00acC or NOT C) interchangeably.
Write the Boolean expression represented by the logic diagram below:
59 marksmedium
5 marks
(a)
Consider the logic expression:
Z = (R OR NOT T) XOR (NOT S AND T)
Draw a logic circuit for this logic expression.
Each logic gate must have a maximum of two inputs.
Do not simplify this logic expression.
4 marks
(b)
Extract:
Z = (R OR NOT T) XOR (NOT S AND T)
Complete the truth table from the given logic expression.
R | S | T | Working space | Z |
|---|---|---|---|---|
0 | 0 | 0 | ||
0 | 0 | 1 | ||
0 | 1 | 0 | ||
0 | 1 | 1 | ||
1 | 0 | 0 | ||
1 | 0 | 1 | ||
1 | 1 | 0 | ||
1 | 1 | 1 |
69 markshard
6 marks
(a)
Consider the truth table:
| A | B | C | X |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
Draw a logic circuit to represent the given truth table.
Each logic gate should have maximum of two inputs.
Do not simplify the logic circuit.
3 marks
(b)
Extract:
| A | B | C | X |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
Write a logic expression for the given truth table.
Do not simplify the logic expression.
78 markshard
4 marks
(a)
Consider this logic expression.
Z = (NOT A OR B) AND (B XOR C)
Draw a logic circuit for this logic expression.
Each logic gate must have a maximum of two inputs.
Do not simplify this logic expression.
4 marks
(b)
Extract:
Z = (NOT A OR B) AND (B XOR C)
Complete the truth table from the given logic expression.
| A | B | C | Working space | X |
|---|---|---|---|---|
| 0 | 0 | 0 | ||
| 0 | 0 | 1 | ||
| 0 | 1 | 0 | ||
| 0 | 1 | 1 | ||
| 1 | 0 | 0 | ||
| 1 | 0 | 1 | ||
| 1 | 1 | 0 | ||
| 1 | 1 | 1 |
84 markshard
Consider this logic expression.
X = (A OR B) AND (NOT B AND C)
Complete the truth table for this logic expression.
| A | B | C | Working space | X |
|---|---|---|---|---|
| 0 | 0 | 0 | ||
| 0 | 0 | 1 | ||
| 0 | 1 | 0 | ||
| 0 | 1 | 1 | ||
| 1 | 0 | 0 | ||
| 1 | 0 | 1 | ||
| 1 | 1 | 0 | ||
| 1 | 1 | 1 |
99 markshard
5 marks
(a)
Consider the following logic statement:
X = ((A OR B) AND (NOT (B XOR C)) AND C)
Draw a logic circuit to represent the given logic statement.
Do not attempt to simplify the logic statement. All logic gates must have a maximum of two inputs.
4 marks
(b)
Extract:
X = ((A OR B) AND (NOT (B XOR C)) AND C)
Complete the truth table for the given logic statement.
| A | B | C | Working space | X |
|---|---|---|---|---|
| 0 | 0 | 0 | ||
| 0 | 0 | 1 | ||
| 0 | 1 | 0 | ||
| 0 | 1 | 1 | ||
| 1 | 0 | 0 | ||
| 1 | 0 | 1 | ||
| 1 | 1 | 0 | ||
| 1 | 1 | 1 |
1010 markshard
6 marks
(a)
Consider the following logic statement:
X = (((A AND NOT B) OR (NOT (B NOR C))) AND C)
Draw a logic circuit to represent the given logic statement.
Do not attempt to simplify the logic statement. All logic gates must have a maximum of two inputs.
4 marks
(b)
Extract:
X = (((A AND NOT B) OR (NOT (B NOR C))) AND C)
Complete the truth table for the given logic statement.
| A | B | C | Working space | X |
|---|---|---|---|---|
| 0 | 0 | 0 | ||
| 0 | 0 | 1 | ||
| 0 | 1 | 0 | ||
| 0 | 1 | 1 | ||
| 1 | 0 | 0 | ||
| 1 | 0 | 1 | ||
| 1 | 1 | 0 | ||
| 1 | 1 | 1 |