1(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]

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

 (c)

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.

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

 [4]

2 State the simplified versions of the following Boolean expressions:

(i) ¬ ¬A

[1]

(ii) (¬A Λ ¬B)

[1]

(iii) ¬(¬A Λ ¬B)

[1]

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

 3 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

Complete the Boolean expression below:

Q≡ [3]

4
Draw a logic gate diagram to represent the Boolean expression

Q≡¬A⋁B

[2]

END OF QUESTION PAPER

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

 Mark Scheme

Question Answer/Indicative content Marks Guidance

1 a Q≡A∧B 3 AO1.2 Q ≡ A ∧ B ∧ (C ∨ D)
∧
(C ∨ D) Accept alternative symbols for AND / OR
e.g. Q = A AND B AND (C OR D)
Brackets must be included for 3rd point
Allow XOR for bullet point 3
Any additional symbols max 2 marks

b Identification of De Morgan’s and/or 2 AO2.2

double negation rule
Correct final answer to give A v B

c i S=A⊻B 2 AO2.1 Accept alternative symbols for AND /XOR

C=A∧B

ii 1 mark for S column 2 AO2.1 A B S C

1 mark for C column
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

iii Logic circuit adds together 2 binary 4 AO1.2

digits / half adder
S gives sum, C gives carry
Two half adders can be joined
together…
…with an OR gate
to form full adder
4 full adders can be used to add two
four bit numbers
Carry out on one joined to carry in on
next

Total 13

2 i A 1

ii ¬(A∨ B) 1

iii A∨B 1

Total 3

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

 Mark Scheme

Question Answer/Indicative content Marks Guidance

3 Q = (A∧B) ∨ (C∧D) 3 Accept (C∧D) ∨ (A∧B)

(AO1.2) Accept (B∧A) instead of (A∧B)

1 mark for (A∧B) Accept (D∧C) instead of (C∧D)

1 mark for (C∧D) Accept alternative notations (e.g. +/. OR /

AND)

1 mark for the ∨ joining the two parts. Accept AB as (A.B) and CD as (C.D)

Accept answers without brackets

Examiner’s Comments
In general, most candidates achieved all of
the available marks in these questions.

Total 3

4 2 (AO1.2)

Examiner’s Comments

Most candidates achieved both the

- A going into NOT gate. available marks on this question.
- B and NOT A going into OR gate (and
Q coming out of it)
(1 Mark per -, Max 2)

Total 2

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

Powered by TCPDF (www.tcpdf.org)