Boolean Algebra & Logic Circuits (Cambridge (CIE) A Level Computer Science): Exam Questions

The truth table for a logic circuit is shown.

Write the Boolean logic expression that corresponds to the given truth table as the sum‑of‑products.

Complete the Karnaugh map (K‑map) for the given truth table.

Draw loop(s) around appropriate group(s) in the K‑map to produce an optimal sum‑of‑products.

Write the Boolean logic expression from your answer to part (c) as the simplified sum‑of‑products.

The diagram shows a logic circuit.

Write the Boolean expression that corresponds to the logic circuit as a sum-of-products.

Complete the Karnaugh map (K-map) for the Boolean expression:

(2)

(ii) Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

(2)

(iii) Write the Boolean expression from your answer to part (c)(ii) as a simplified sum-of-products.

(1)

The diagram shows a logic circuit.

Write the Boolean expression that corresponds to the logic circuit as a sum-of-products.

(i) Complete the Karnaugh map (K-map) for this Boolean expression:

(2)

(ii) Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.

(2)

(iii) Write the Boolean expression from your answer to part c(ii) as a simplified sum-of-products.

(1)

This diagram represents a logic circuit.

Complete the truth table for the given logic circuit.

Simplify the given Boolean expression using Boolean algebra.
Show your working.

This logic circuit represents the Boolean expression: X =

Complete this truth table for the given logic circuit.

Apply De Morgan’s laws to the expression: X =

X = ...................................................................................

Simplify the following expression using Boolean algebra.

Show all the stages in your simplification.

T = X.Y.Z + X.Z +

This diagram represents a logic circuit.

Simplify the given Boolean expression using Boolean algebra.
Show your working.

Y =