1 An electronics engineer needs a circuit with the following logic.

(A∧B) ∨ (¬A∧B) ∨ (¬C∧¬D)

Complete and use the Karnaugh map below to simplify the expression above.

Simplified expression:

[4]

2(a) An XOR gate is shown below. Complete the truth table for XOR.

A B Q
1 1
1 0
0 1
0 0

[2]

© OCR 2024. You may photocopy this page. 1 of 25 Created in ExamBuilder

 (b) A set of logic gates are connected as below.

(i) Complete the Truth Table below:

A B Cin S Cout
1 1 1
1 1 0
1 0 1
1 0 0
0 1 1
0 1 0
0 0 1
0 0 0

[4]

(ii) Explain what the circuit does. You should refer to A, B, Cin, S and Cout in your answer.

© OCR 2024. You may photocopy this page. 2 of 25 Created in ExamBuilder

 [4]

(c)

(i) Write a Boolean expression equivalent to S.

[1]

(ii) Write a Boolean expression equivalent to Cout.

[2]

© OCR 2024. You may photocopy this page. 3 of 25 Created in ExamBuilder

 3(a) The truth table below has two inputs, A and B, and two outputs, S and C.

(i) Write a logic expression for S in terms of A and B.

[1]

(ii) Write a logic expression for C in terms of A and B.

[1]

(iii) Use the expressions for S and C to draw a single logic circuit for the truth table.

[2]

© OCR 2024. You may photocopy this page. 4 of 25 Created in ExamBuilder

 (b) Using the rules for manipulating Boolean expressions simplify the following:
A ∧B ∨ A∧(B∨C) ∨ B∧(B∨C)

[4]

4 Burger House is a fast food restaurant which wants to encourage healthy eating amongst its younger
diners.

(a)
(i) Shown below in Fig.2 is the Burger House children’s menu.

Children receive a free toy when they select a meal (i.e. one burger, one side dish and one

© OCR 2024. You may photocopy this page. 5 of 25 Created in ExamBuilder

 dessert) made up of only healthy options.

Let g be a Boolean value for if a child has chosen a grilled chicken burger.
Let s be a Boolean value for if a child has chosen salad.
Let c be a Boolean value for if a child has chosen carrot sticks.
Let f be a Boolean value for if a child has chosen fruit salad.
Let t be a Boolean value for whether a child receives a toy.

Write an expression using Boolean algebra to determine whether a child receives a toy when
they select a meal.

t=

[3]

(b)
(ii) Burger House wants to add this logic into its till system.
Complete the code below assuming that g,s,c,f and t are Boolean variables with the same
meaning as part (i).

[2]

© OCR 2024. You may photocopy this page. 6 of 25 Created in ExamBuilder

 5(a)

State the Boolean expression represented by the Karnaugh map in Fig. 9.1, in its smallest form.

[4]

© OCR 2024. You may photocopy this page. 7 of 25 Created in ExamBuilder

 (b) State the simplified versions of the following Boolean expressions:

(i) ¬ ¬A

[1]

(ii) (¬A Λ ¬B)

[1]

(iii) ¬(¬A Λ ¬B)

[1]

6(a) A cinema offers discounted tickets, but only under one of the following conditions:
• Customer is under 18 and has a student card.
• Customer is over 60 and has ID which proves this.

Let:

A be Customer is under 18

B be Customer has a student card

C be Customer is over 60

D be Customer has ID

Q be Discount ticket issued

The cinema has a voucher which promises free popcorn when the voucher is produced whilst buying a
soft drink or bottle of water.

Let:

E be Voucher is shown

F be Soft drink is bought

© OCR 2024. You may photocopy this page. 8 of 25 Created in ExamBuilder

 G be Bottle of water is bought

R be Free popcorn given.

This could be written as:

R ≡ (E⋀F) ⋁ (E⋀G)

(i) Complete the truth table below.

E F G (E⋀F) (E⋀G) (E⋀F)⋁(E⋀G)

1 1 1
1 1 0
1 0 1
1 0 0
0 1 1
0 1 0
0 0 1
0 0 0

[4]

(ii) Simplify the expression

(E⋀F) ⋁ (E⋀G)

[2]

Most films are now distributed to cinemas digitally. A studio allows cinemas to download its latest film
5 days before the release date via a private download. It wants to ensure that no cinema shows it
before the release date.

© OCR 2024. You may photocopy this page. 9 of 25 Created in ExamBuilder

 (b) Complete the Boolean expression below:

Q≡ [3]

7(a) A half adder has the truth table shown below:

A B Sum Carry
1 1 0 1
1 0 1 0
0 1 1 0
0 0 0 0

Draw a half adder using logic gates.

[3]

© OCR 2024. You may photocopy this page. 10 of 25 Created in ExamBuilder

 (b) Draw the logic gates represented by the Karnaugh Map below. Show your working.

[4]

© OCR 2024. You may photocopy this page. 11 of 25 Created in ExamBuilder

 8(a)
Draw a logic gate diagram to represent the Boolean expression

Q≡¬A⋁B

[2]
(b) Find the Boolean expression represented in the Karnaugh Map below. Show your working.

[5]

© OCR 2024. You may photocopy this page. 12 of 25 Created in ExamBuilder

 9 Complete the truth table to represent the following Boolean expression.

Q ≡ ¬ (A Λ B) V C

A B C Q
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

[2]

© OCR 2024. You may photocopy this page. 13 of 25 Created in ExamBuilder

 10 A company releases an in-home virtual assistant called ‘Bertie Butler’.

The device, when placed in a room, listens out for the phrase “Hey Bertie”. When someone says that
phrase it then listens to the question that follows and tries to give a relevant answer.

Bertie Butler has a number of built-in input and output devices.

Bertie Butler’s circuitry is designed to only listen out for “Hey Bertie” under certain circumstances,
which are:

The privacy button (P) must be off and the microphone must generate a signal (S) to say a sound has
been heard.

(i) Complete the truth table for whether the device is listening (L).

P S L
False False
False True
True False
True True
[2]

(ii) Draw logic gates to represent the circuitry needed.

[3]

© OCR 2024. You may photocopy this page. 14 of 25 Created in ExamBuilder

 11 Daniel is an engineer. He has created the following logic circuit shown in Fig. 4.

Fig. 4

Complete the truth table below for the logic circuit shown in Fig. 4.

A B C D 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
[4]

© OCR 2024. You may photocopy this page. 15 of 25 Created in ExamBuilder

 12(a
)
(i) Complete the Karnaugh map below for the Boolean expression (¬ A ∧ ¬ B) ∨ ( A ∧ ¬ B)

[3]

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

[2]

© OCR 2024. You may photocopy this page. 16 of 25 Created in ExamBuilder

 (b)

(i) State the purpose of a D-type flip-flop circuit.

[2]

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

[4]

© OCR 2024. You may photocopy this page. 17 of 25 Created in ExamBuilder

 13(a 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 secret code

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

Complete the Boolean expression below:

Q≡

(b) Another Boolean expression for a logic system is shown below:

Q ≡ ¬ (¬ A ∧ ¬ B)

(i) 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.

[2]

(c)

© OCR 2024. You may photocopy this page. 18 of 25 Created in ExamBuilder

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

(i) Give the Boolean expressions for the outputs S and C.

S≡

C≡

[2]

(ii) Complete the truth table for this logic circuit.

A B S C
0 0
0 1
1 0
1 1

(iii) Describe how this logic circuit can be adapted to add together two 4-bit binary numbers.

[4]

© OCR 2024. You may photocopy this page. 19 of 25 Created in ExamBuilder

 14(a Draw an XOR gate.
)

[1]
(b) Explain the difference in the function of OR and XOR gates.

[2]

(c) A circuit contains the logic gates shown below.

(i) Complete the logic table below.

A B C D Output
1 1 1 1
1 1 1 0
1 1 0 1
1 1 0 0
1 0 1 1
1 0 1 0
1 0 0 1
1 0 0 0
0 1 1 1

© OCR 2024. You may photocopy this page. 20 of 25 Created in ExamBuilder

 0 1 1 0
0 1 0 1
0 1 0 0
0 0 1 1
0 0 1 0
0 0 0 1
0 0 0 0
[4]

(ii) Complete the Boolean expression below to represent the circuit.

≡ Output

[2]

© OCR 2024. You may photocopy this page. 21 of 25 Created in ExamBuilder

 15(a Elliott has designed a logic circuit. The expression he has created for the logic circuit is:
)
Q = (A ∧ ¬B) ∨ (¬A ∧ C ∧ D) ∨ (A ∧ B)

Complete the Karnaugh Map below to simplify this expression. Show your working.

Simplified expression:

[4]

© OCR 2024. You may photocopy this page. 22 of 25 Created in ExamBuilder

 (b) Draw a Logic diagram for the following expression:

Q = ¬(A ∧ B) ∨ (C ∧¬ D)

[3]

© OCR 2024. You may photocopy this page. 23 of 25 Created in ExamBuilder

 16(a
) A computer scientist has created the following logic circuit shown in Fig. 6.

Fig. 6

(i) Give the Boolean expression that represents the logic circuit shown in Fig. 6. Do not attempt to
simplify the expression.

[2]

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

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]

© OCR 2024. You may photocopy this page. 24 of 25 Created in ExamBuilder

 (b) 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 here.

[4]

END OF QUESTION PAPER

© OCR 2024. You may photocopy this page. 25 of 25 Created in ExamBuilder

Powered by TCPDF (www.tcpdf.org)