Specification point 1.4.3

Boolean Algebra

Exam questions: 8 questions, 63 marks

Question 1

8 marks

1(a) 4 marks

Ben installs burglar alarms. The alarm is made up of a door sensor and a motion sensor. When the alarm is set, the siren will sound if either the door sensor or the motion sensor detect movement.

The alarm also has a test mode setting. When the test mode setting is enabled, an engineer can check the sensors are working without the siren going off.

The inputs to the alarm are as follows.

InputSystem
ADoor sensor
BMotion sensor
CAlarm has been set
DTest mode enabled

Draw a logic circuit to show the logic that is used in the burglar alarm to determine if the siren goes off.

Mark scheme 1(a)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

1 mark for each correct area including labelled inputs

[Image redrawn from the original mark scheme by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
    A["A"] --> OR1["OR"]
    B["B"] --> OR1
    OR1 --> AND1["AND"]
    C["C"] --> AND1
    AND1 --> AND2["AND"]
    D["D"] --> NOT1["NOT"]
    NOT1 --> AND2
    AND2 --> Out["Output"]

Alternatives (1 mark per area):

[Image redrawn from the original mark scheme by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
    A["A"] --> OR1["OR"]
    B["B"] --> OR1
    C["C"] --> AND1["AND"]
    D["D"] --> NOT1["NOT"]
    NOT1 --> AND1
    OR1 --> AND2["AND"]
    AND1 --> AND2
    AND2 --> O1["Output"]

    A2["A"] --> OR2["OR"]
    B2["B"] --> OR2
    D2["D"] --> NOT2["NOT"]
    OR2 --> AND3["AND"]
    NOT2 --> AND3
    AND3 --> AND4["AND"]
    C2["C"] --> AND4
    AND4 --> O2["Output"]

Guidance

Max 3 if any additional gates.

NOT gate must have only one input, AND/OR gates must have two inputs NOT gate must have circle

Ignore any names on gates

Examiner’s Comments

There were a range of marks on this question. More successful candidates gave all four gates accurately, but most candidates were able to gain at least one or two marks. Some candidates were unaware of what a logic circuit was and instead produced a range of different diagrams including flow charts.

out of 4

1(b)(i) 1 mark

Simplify the Boolean expression ¬A v ¬B using De Morgan's First Law.

Mark scheme 1(b)(i)

¬ (A ∧ B)

Guidance

Accept NOT (A AND B) / other correct notations e.g.

¬ must be the correct way round

Examiner’s Comments

Many candidates gained full marks with the most common error being ¬(A v B)

1(b)(ii) 1 mark

Simplify the Boolean expression ¬(¬B) using double negation.

Mark scheme 1(b)(ii)

B

Guidance

Examiner’s Comments

Almost all candidates were able to gain a mark on this question.

1(b)(iii) 2 marks

Simplify the Boolean expression (A v B) ∧ (A v C) using distribution.

Mark scheme 1(b)(iii)
  • 1 mark for A

  • 1 mark for v (B ∧ C)

A v (B ∧ C)

Guidance

Doesn’t need brackets

Allow other correct notation e.g. A+B.C

Allow either order e.g. (B∧C) v A

Allow Av(BC) / AvBC

Examiner’s Comments

The majority of candidates recognised that distribution meant that there was only one A following simplification but the most common error for the second mark was again to use OR instead of AND for B AND C

Question 2

6 marks

2(a)

A logic gate diagram is shown below.

[Diagram redrawn from the original paper by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
    A["A"]
    B["B"]
    NOT1["NOT"]
    NOT2["NOT"]
    AND1["AND"]
    AND2["AND"]
    OR1["OR"]
    Q["Q"]

    A --> AND1
    B --> NOT1
    NOT1 --> AND1
    A --> NOT2
    NOT2 --> AND2
    B --> AND2
    AND1 --> OR1
    AND2 --> OR1
    OR1 --> Q

2(a)(i) 2 marks

Complete the truth table for this logic gate diagram.

ABQ
00
01
10
11
Mark scheme 2(a)(i)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

ABQ
000
011
101
110
  • 1 Mark for the first 2 rows

  • 1 mark for the last 2 rows

Guidance

Examiner’s Comments

The majority of candidates were able to correctly complete the truth table for both marks.

out of 2

2(a)(ii) 1 mark

What single gate is this logic gate diagram equivalent to?

Mark scheme 2(a)(ii)

XOR

Guidance

Accept “Exclusive OR”

Examiner’s Comments

Most candidates correctly stated the correct single logic gate (XOR).

2(b) 3 marks

Draw the logic gate diagram for this expression:
Q = (A v ¬B) ∧ C

Mark scheme 2(b)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

[Image redrawn from the original mark scheme by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
B --> NOT1["NOT"]
A --> OR1["OR"]
NOT1 --> OR1
OR1 --> AND1["AND"]
C --> AND1
AND1 --> Q
  • A going into an OR game

  • B going into a NOT gate with the output going into the OR gate

  • Output of the OR gate going into an AND gate with C

Guidance

Examiner’s Comments

Most candidates were able to draw the three logic gates correctly, although some did not make it clear the difference between an ‘and’ gate and an ‘or’ gate in their diagram.

out of 3

Question 3

9 marks

3(a)

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

[Diagram redrawn from the original paper by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
A["A"] --> OR1["OR"]
B["B"] --> OR1["OR"]
OR1["OR"] --> NOT1["NOT"]
NOT1["NOT"] --> XOR1["XOR"]
C["C"] --> XOR1["XOR"]
XOR1["XOR"] --> P["P"]

Fig. 6

3(a)(i) 2 marks

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

Mark scheme 3(a)(i)
  • ¬ (A ∨ B) / NOT (A OR B)

  • ∨ C / XOR C

Guidance

First MP requires brackets, NOT A or B is incorrect.

Can be written in different order (e.g. C XOR NOT (B OR A) as long as logically correct.

Accept

Examiner’s Comments

This question was generally well answered, although some candidates confused AND and OR

3(a)(ii) 3 marks

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

ABCP
000
001
010
011
100
101
110
111
out of 3

3(b) 4 marks

The following Karnaugh map represents another logic circuit.

[Diagram redrawn from the original paper by an AI model (Gemma 4 12B). It may contain mistakes.]

CD \ AB00011110
001111
011100
110000
100011

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

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

Mark scheme 3(b)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

  • Correct highlighting on K map as shown

  • / NOT A AND NOT C…

  • D / A AND NOT D…

  • …∨ / + / OR joining the 2 correct expressions together

Guidance

[Image redrawn from the original mark scheme by an AI model (Gemma 4 12B). It may contain mistakes.]

CD \ AB00011110
001111
011100
110000
100011

Do not penalise candidates who attempt to simplify even further (e.g. NOT A AND NOT C = NOT (A OR C)

using De Morgan's).

MP1 - correct answer only

MP4 is dependent on MP2 & 3

Examiner’s Comments

There were many candidates who were able to gain full marks on this question. Those who did not showed a lack of understanding of grouping on a Karnaugh map, either grouping to include zeros or missing the wrapping group and adding another group in for the top row.

out of 4

Question 4

7 marks

4(a) 4 marks

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.

[Diagram redrawn from the original paper by an AI model (Gemma 4 12B). It may contain mistakes.]

CD \ AB00011110
00
01
11
10

Simplified expression:

Mark scheme 4(a)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

Solution:

[Image redrawn from the original mark scheme by an AI model (Gemma 4 12B). It may contain mistakes.]

ABABABAB
00011110
CD00001
CD01001
CD11111
CD10001

1 mark per bullet up to a maximum of 4 marks:

  • 1 mark for filling in the table correctly

  • 1 mark for the group shown in red

  • 1 mark for the group shown in green

  • 1 mark for the simplified expression A ∨ (C ∧ D)

Guidance

Brackets are not required for the simplified expression

Examiner’s Comments
This question was answered well with many candidates achieving all 4 marks. Some completed the table correctly but were not able to simplify the expression appropriately.

out of 4

4(b) 3 marks

Draw a Logic diagram for the following expression:

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

[Diagram redrawn from the original paper by an AI model (Gemma 4 12B). It may contain mistakes.]

The image shows a large rectangle with four points labeled A, B, C, and D vertically aligned on the left edge and one point labeled Q on the right edge.

Mark scheme 4(b)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

[Image redrawn from the original mark scheme by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
    A["A"]
    B["B"]
    C["C"]
    D["D"]
    AND1["AND"]
    NOT1["NOT"]
    AND2["AND"]
    NOT2["NOT"]
    OR1["OR"]
    Q["Q"]

    A --> AND1
    B --> AND1
    AND1 --> NOT1
    C --> AND2
    D --> NOT2
    NOT2 --> AND2
    NOT1 --> OR1
    AND2 --> OR1
    OR1 --> Q

1 mark per bullet up to a maximum of 3 marks:

  • An AND gate taking A and B as inputs with the output connecting to a NOT gate

  • An AND gate taking C and the NOT of D as the inputs

  • An OR gate taking the outputs of the NOT and AND gates

Guidance

Allow NAND gate as alternative for BP1

Examiner’s Comments
As with the first part of this question, this was answered well. Most candidates used the same gates that are shown in the mark scheme, although equivalent gates were accepted. Some candidates lost marks for not being clear on the type of gate they had decided on.

Exemplar 2

[Image redrawn from the original mark scheme by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
A["A"] --> AND1["AND"]
B["B"] --> AND1
AND1 --> NOT1["NOT"]
NOT1 --> OR1["OR"]
C["C"] --> AND2["AND"]
D["D"] --> NOT2["NOT"]
NOT2 --> AND2
AND2 --> OR1
OR1 --> Q["Q"]

Exemplar 2 was given full marks. This candidate has gained all 3 marks as the gates are correct and are clearly drawn to avoid confusion. Each gate also has the correct number of inputs and outputs in all three instances.

Logic gate guidance
To make sure full credit is given for the answers provided, it is essential that the drawings are clear enough to distinguish one gate from another. Some gates look similar, so the lines and symbols need to be clear enough to establish which gate has been used.

out of 3

Question 5

13 marks

5(a)

[Diagram redrawn from the original paper by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
    A["A"]
    B["B"]
    XOR1["XOR"]
    AND1["AND"]
    S["S"]
    C["C"]
    A --> XOR1
    B --> XOR1
    A --> AND1
    B --> AND1
    XOR1 --> S
    AND1 --> C

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

5(a)(i) 2 marks

Give the Boolean expressions for the outputs S and C.

S ≡

C ≡

Mark scheme 5(a)(i)

S = A ⊻ B
C = A ∧ B

Guidance

Accept alternative symbols for AND /XOR

5(a)(ii) 2 marks

Complete the truth table for this logic circuit.

ABSC
00
01
10
11
Mark scheme 5(a)(ii)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

  • 1 mark for S column

  • 1 mark for C column

Guidance

ABSC
0000
0110
1010
1101
out of 2

5(a)(iii) 4 marks

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

Mark scheme 5(a)(iii)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

  • Logic circuit adds together 2 binary 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

out of 4

5(b) 3 marks

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 ≡

Mark scheme 5(b)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

Q ≡ A ∧ B
∧
(C ∨ D)

Guidance

Q ≡ A ∧ B ∧ (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

out of 3

5(c) 2 marks

Another Boolean expression for a logic system is shown below:

Q ≡ ¬ (¬ A ∧ ¬ B)

Mark scheme 5(c)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

  • Identification of De Morgan’s and/or double negation rule

  • Correct final answer to give A v B

out of 2

5(c)(i) 2 marks

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.

out of 2

Question 6

11 marks

6(a)(i) 3 marks

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

[Diagram redrawn from the original paper by an AI model (Gemma 4 12B). It may contain mistakes.]

CD \ AB00011110
00
01
11
10
Mark scheme 6(a)(i)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

  • left column filled with 1s (¬ A ∧ ¬ B) …

  • right column filled with 1s ( A ∧ ¬ B)…

  • …Middle 2 columns filled with zero or blank

Guidance

[Image redrawn from the original mark scheme by an AI model (Gemma 4 12B). It may contain mistakes.]

CD \ AB00011110
001001
011001
111001
101001
out of 3

6(a)(ii) 2 marks

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

Mark scheme 6(a)(ii)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

  • ¬ B / NOT B

  • Karnaugh map used to show 1s highlighted with overlap

Guidance

[Image redrawn from the original mark scheme by an AI model (Gemma 4 12B). It may contain mistakes.]

CD \ AB00011110
001001
011001
111001
101001
out of 2

6(b)(i) 2 marks

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

Mark scheme 6(b)(i)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

  • Delay / store a value…

  • …of 1 bit

  • When a signal is given

out of 2

6(b)(ii) 4 marks

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

Mark scheme 6(b)(ii)

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

  • Data input

  • Clock input

  • Q output

  • When clock input goes high…

  • …Q changes to D

  • NOT Q is reverse of Q

out of 4

Question 7

4 marks

7 4 marks

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

[Diagram redrawn from the original paper by an AI model (Claude Sonnet). It may contain mistakes.]

flowchart LR
    A["A"] --> AND1["AND"]
    B["B"] --> AND1["AND"]
    AND1 --> XOR1["XOR"]
    C["C"] --> XOR1["XOR"]
    XOR1 --> X["X"]

Fig. 4

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

ABCDX
000
001
010
011
100
101
110
111
Mark scheme 7

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

Guidance

Award 1 mark for each group of 4 1’s / 0’s.

out of 4

Question 8

5 marks

8 5 marks

Albert runs a competition each week in his local village hall. So that Albert can contact the winner he would like a program for the winner to enter their telephone number which is then checked and written into a text file.

The rules for Albert’s program are as follows:

  1. The telephone number is entered. This is checked to ensure that the first digit is a 0\
  2. If the first digit is not a 0 then a message saying “Needs To Start With 0” is printed
    If the first digit is a 0 then the telephone number is passed into a pre-existing function called 3. checkLength as a parameter. This will return true if the length of the telephone number is long enough\
  3. If the telephone number is long enough then it is written into a text file called "winner.txt" 5. If the telephone number is not long enough then a message saying “Not Long Enough” is printed.

Complete the procedure competitionWinner so that it meets the rules of Albert’s program.

You should write your procedure using pseudocode or program code.

procedure competitionWinner()
endprocedure

END OF QUESTION PAPER

Mark scheme 8

Tick each point your answer makes. Your mark is worked out from your ticks, and you can change it.

1 mark per bullet up to a maximum of 5 marks, e.g.:

  • Suitable logic for inputting the telephone number

  • Suitable logic for ensuring the telephone number starts with a 0

  • Suitable logic for passing the telephone number into the function checkLength

  • If true, suitable logic for opening and closing

winner.txt
  • …suitable logic for writing the telephone number to

winner.txt
  • Suitable logic for printing “Needs To Start With 0” and "Not Long Enough"

Guidance

Example Solution:

procedure competitionWinner()
telNum = input("Enter Telephone Number")
if telNum[0] == "0" then
length = checkLength(telNum)
   if length == true then
myfile = openWrite("winner.txt")
myfile.writeLine(telNum)
myfile.close()
   else
    print ("Not Long Enough")
   endif
   else
     print (“Needs To Start With
0”)
   endif
endprocedure()
out of 5