Boolean Logic (Cambridge (CIE) O Level Computer Science)

Exam Questions

1 hour9 questions
14 marks

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.

Diagram displaying logic gates ('AND', 'OR', 'NAND', 'NOT') alongside their respective standard symbols used in digital circuits.

Did this page help you?

2a2 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

2b4 marks

Complete the truth table for the following logic gate.

logic gate

A

B

Q

0

0

0

0

1

1

0

1

Did this page help you?

1a4 marks

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.

Rectangular diagram labeled A, B, and C on the left side and X on the right side. The labels point towards the rectangle's edges.
1b4 marks

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

1

Did this page help you?

23 marks

Write the Boolean expression represented by the logic diagram below:

Logic circuit diagram featuring an AND gate with inputs A and B, an OR gate outputting P, and a NOT gate with input C. Lines connect gates to the OR gate.

Did this page help you?

1a6 marks

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.

Diagram of a rectangle labeled A, B, and C on the left side and X on the right side, each label pointing towards the center.
1b3 marks

Write a logic expression for the given truth table.

Do not simplify the logic expression.

Did this page help you?

2a4 marks

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.

Diagram showing a rectangle labeled on the left side with A at the top, B in the middle, and C at the bottom. The right side is labeled X.
2b4 marks

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

Did this page help you?

34 marks

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

Did this page help you?

4a5 marks

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.

Diagram showing a rectangle labeled on the left side with A at the top, B in the middle, and C at the bottom. The right side is labeled X.
4b4 marks

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

Did this page help you?

5a6 marks

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.

Diagram showing a rectangle labeled on the left side with A at the top, B in the middle, and C at the bottom. The right side is labeled X.
5b4 marks

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

Did this page help you?