A Level OCR Computer Science 33 mins 9 questions

Exam Questions

4.3 Boolean Algebra

Scan here to return to the course

Total Marks /33

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 1
1 A computer scientist has created the following logic circuit shown in Fig. 6.

Fig 6

Give the Boolean expression that represents the logic circuit shown in Fig. 6.

Do not attempt to simplify the expression.

(2 marks)

2 State the purpose of a D-type flip-flop circuit.

(2 marks)

3 A computer scientist has created the following logic circuit shown in Fig. 6.

Fig 6

Complete the truth table for the logic circuit shown in Fig. 6

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 2
A B C P

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

(3 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 3
4 All users of a computer system have a unique username and password. The computer
system has implemented two-factor authentication so that users must respond to either
an email or text message containing a secret code to be able to access the system

Let:

A be a Boolean value for if a user enters a valid username

B be a Boolean value for if a user enters a password that matches their username

C be a Boolean value for if a user is able to respond to an email containing a secret code

D be a Boolean value for if a user is able to respond to a text message containing a

Q be a Boolean value for if entry to the computer system is allowed

Complete the Boolean expression below:

Q ≡ .................................................................................

(3 marks)

5 A Boolean expression for a logic system is shown below:

Q ≡ ¬ (¬ A ∧ ¬ B)

Simplify this Boolean expression so that it does not include any negation.

You must explain which Boolean algebra rule(s) you are using at each step.

(3 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 4
6 (a)

The logic circuit above has two inputs (A, B) and two outputs (S, C).

Give the Boolean expressions for the outputs S and C.

(2 marks)

(b) Complete the truth table for this logic circuit

A B S C

0 0

0 1

1 0

1 1

(2 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 5
(c) Describe how this logic circuit can be adapted to add together two 4-bit binary numbers.

(4 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 6
7 (a) Complete the Karnaugh map below for the Boolean expression (¬ A ∧ ¬ B) ∨ ( A ∧ ¬ B)

(3 marks)

(b) Use the Karnaugh map to find a simplified Boolean expression that is equivalent to (¬ A ∧
¬ B) ∨ ( A ∧ ¬ B)

You should highlight the map as appropriate and write the expression.

(2 marks)

8 Describe the inputs and outputs used by a D-type flip-flop circuit, explaining how the
inputs are used to control the outputs.

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 7
 (3 marks)

9 The following Karnaugh map represents another logic circuit.

Use this Karnaugh map to find the simplified expression for this circuit

You should highlight the map as appropriate and write the expression.

(4 marks)

© 2025 Save My Exams, Ltd. Get more and ace your exams at savemyexams.com 8