Higher Nationals

Internal verification of assessment decisions – BTEC (RQF)

INTERNAL VERIFICATION – ASSESSMENT DECISIONS

Programme title BTEC Higher National Diploma in Computing

Assessor Internal Verifier

Unit 18: Discrete Maths
Unit(s)
Discrete Mathematics in Software Engineering concepts
Assignment title

Student’s name
List which assessment Pass Merit Distinction
criteria the Assessor
has awarded.
INTERNAL VERIFIER CHECKLIST
Do the assessment criteria
awarded match those shown in the
assignment brief? Y/
N

Is the Pass/Merit/Distinction grade

awarded justified by the assessor’s Y/N
comments on the student work?

Has the work been assessed

accurately? Y/
N
Is the feedback to the student:

1
Give details:

• Constructive? Y/
N
• Linked to relevant assessment Y/
criteria? N

• Identifying opportunities
for improved performance? Y/
N
• Agreeing actions? Y/
N
Does the assessment decision need
amending? Y/
N

Assessor signature Date

Internal Verifier signature Date

Programme Leader signature
(if required) Date

2
 Confirm action completed
Remedial action taken

Give details:

Internal
Verifier Date
signature
Programme Leader
signature (if Date
required)

Higher Nationals - Summative Assignment Feedback Form

Student Name/ID
Unit Title Unit 18 : Discrete Maths

Assignment Number 1 Assessor

Date Received
Submission Date 1st submission

Date Received 2nd

Re-submission Date submission

3
 Assessor Feedback:

LO1 Examine set theory and functions applicable to software engineering.

Pass, Merit & P1 P2 M1 D1

Distinction Descripts

LO2 Analyse mathematical structures of objects using graph theory.

Pass, Merit & P3 P4 M2 D2

Distinction Descripts

LO3 Investigate solutions to problem situations using the application of Boolean algebra.
Pass, Merit & P5 P6 M3 D3
Distinction Descripts

LO4 Explore applicable concepts within abstract algebra.

Pass, Merit & P7 P8 M4 D4
Distinction Descripts

Grade: Assessor Signature: Date:

Resubmission Feedback:

Grade: Assessor Signature: Date:

Internal Verifier’s Comments:

Signature & Date:

* Please note that grade decisions are provisional. They are only confirmed once internal and external
moderation has taken place and grades decisions have been agreed at the assessment board.

4
Pearson
Higher Nationals in
Computing

Unit 18: Discrete Mathematics

5
General Guidelines

1. A Cover page or title page – You should always attach a title page to your assignment. Use previous
page as your cover sheet and make sure all the details are accurately filled.
2. Attach this brief as the first section of your assignment.
3. All the assignments should be prepared using a word processing software.
4. All the assignments should be printed on A4 sized papers. Use single side printing.
5. Allow 1” for top, bottom, right margins and 1.25” for the left margin of each page.

Word Processing Rules

1. The font size should be 12 point, and should be in the style of Time New Roman.
2. Use 1.5-line spacing. Left justify all paragraphs.
3. Ensure that all the headings are consistent in terms of the font size and font style.
4. Use footer function in the word processor to insert Your Name, Subject, Assignment No, and
Page Number on each page. This is useful if individual sheets become detached for any reason.
5. Use word processing application spell check and grammar check function to help editing your
assignment.

Important Points:

1. It is strictly prohibited to use textboxes to add texts in the assignments, except for the compulsory
information. eg: Figures, tables of comparison etc. Adding text boxes in the body except for the
before mentioned compulsory information will result in rejection of your work.
2. Carefully check the hand in date and the instructions given in the assignment. Late submissions will
not be accepted.
3. Ensure that you give yourself enough time to complete the assignment by the due date.
4. Excuses of any nature will not be accepted for failure to hand in the work on time.
5. You must take responsibility for managing your own time effectively.

6
 6. If you are unable to hand in your assignment on time and have valid reasons such as illness, you may
apply (in writing) for an extension.
7. Failure to achieve at least PASS criteria will result in a REFERRAL grade.
8. Non-submission of work without valid reasons will lead to an automatic RE FERRAL. You will
then be asked to complete an alternative assignment.
9. If you use other people’s work or ideas in your assignment, reference them properly using
HARVARD referencing system to avoid plagiarism. You have to provide both in-text citation and a
reference list.
10. If you are proven to be guilty of plagiarism or any academic misconduct, your grade could be
reduced to A REFERRAL or at worst you could be expelled from the course

Student Declaration

I hereby, declare that I know what plagiarism entails, namely to use another’s work and to present it as my
own without attributing the sources in the correct way. I further understand what it means to copy another’s
work.

1. I know that plagiarism is a punishable offence because it constitutes theft.

2. I understand the plagiarism and copying policy of the Edexcel UK.
3. I know what the consequences will be if I plagiaries or copy another’s work in any of the
assignments for this program.
4. I declare therefore that all work presented by me for every aspect of my program, will be my own,
and where I have made use of another’s work, I will attribute the source in the correct way.
5. I acknowledge that the attachment of this document signed or not, constitutes a binding agreement
between myself and Pearson, UK.
6. I understand that my assignment will not be considered as submitted if this document is not attached
to the attached.

Student’s Signature:
(Provide E-mail ID)
Date:

7
(Provide Submission Date)

Feedback Form

Formative feedback: Assessor to Student

Action Plan

Summative feedback

Feedback: Student to Assessor

Assessor’s
Date
Signature

8
 Student’s
Date
Signature

Assignment Brief

Student Name /ID Number

Unit Number and Title Unit 18: Discrete Maths

Academic Year 2023/24

Unit Tutor

Assignment Title Discrete mathematics in Computing

Issue Date

Submission Date

IV Name & Date

Submission Format:
This assignment should be submitted at the end of your lesson, on the week stated at the front of this brief.
The assignment can either be word-processed or completed in legible handwriting.

If the tasks are completed over multiple pages, ensure that your name and student number are present on
each sheet of paper.

Unit Learning Outcomes:

9
LO1 Examine set theory and functions applicable to software engineering.
LO2 Analyse mathematical structures of objects using graph theory.
LO3 Investigate solutions to problem situations using the application of Boolean algebra.
LO4 Explore applicable concepts within abstract algebra.

Assignment Brief and Guidance:

Activity 01

Part 1

1. Perform algebraic set operations in the following formulated mathematical problems.

i. Let A and B be two non-empty finite sets. If cardinalities of the sets A, B, and A ∩B are 72, 28
and 13 respectively, find the cardinality of the set A ∪B .
ii. If n( A −B )=45, n( A ∪B )=110 and n( A ∩B )=15, then find n(B).
iii. If n(A)=33, n(B)=36 and n(C)=28, find n( A ∪B ∪C ).

Part 2

1. Write the multisets (bags) of prime factors of given numbers.

i. 160
ii. 120

10
 iii. 250
2. Write the multiplicities of each element of multisets (bags) in Part 2-1(i,ii,iii) separately.
3. Determine the cardinalities of each multiset (bag) in Part 2-1(i,ii,iii).

Part 3

1. Determine whether the following functions are invertible or not and if a function is invertible,

then find the rule of the inverse ( f ( x ) ) using appropriate mathematical technique.
−1

i. f :ℜ→ ℜ+ ii . f : ℜ+ → ℜ+
1
f ( x )= x2 f ( x )=
x
iii . f :ℜ+ →ℜ+ iv . f : [ −π π
,
2 2 ]
→ [ −1 ,1 ]

f ( x )= x2 f ( x )=sin x
v . f : [ 0 , π ] → [ −2 ,2 ]
f ( x )=2cos x

Part 4

1. Formulate corresponding proof principles to prove the following properties about defined sets.
A=B ⇔ A ⊆ B and B ⊆ A
i. .
ii. De Morgan’s Law by mathematical induction.
iii. Distributive Laws for three non-empty finite sets A, B, and C.

Activity 02

Part 1

1. Model two contextualized problems using binary trees both quantitatively and qualitatively.

Part 2

1. State the Dijkstra’s algorithm for a directed weighted graph with all non-negative edge
weights.

11
 2. Use Dijkstra’s algorithm to find the shortest path spanning tree for the following weighted
directed graph with vertices A, B, C, D, and E given. Consider the starting vertex as E.

Part 3

1. Assess whether the following undirected graphs have a Eulerian and/or a Hamiltonian cycle.

i.

ii.

12
 iii.

Part 4

1. Construct a proof of the five color theorem for every planar graph.

Activity 03

Part 1

1. Diagram two real world binary problems in two different fields using applications of Boolean
Algebra.

13
Part 2

1. Produce truth tables and its corresponding Boolean equation for the following scenarios.
i. If the driver is present and the driver has not buckled up and the ignition switch is on,
then the warning light should turn on.
ii. If it rains and you don't open your umbrella, then you will get wet.
2. Produce truth tables for given Boolean expressions.
i. Ā B̄C + A B̄ C̄ + ABC + Ā B C̄
ii. ( A+ B̄+C)( A +B +C)( Ā+ B+ C̄)

Part 3

1. Simplify the following Boolean expressions using algebraic methods.

i. A( A +B)+ B(B+C)+C (C+ A )
ii. ( A+ B̄)(B+C)+( A +B)(C + Ā)
iii. ( A+ B)( AC+ A C̄)+ AB+B
iv. Ā( A +B)+(B+ A )( A + B̄)

Part 4

1. Consider the K-Maps given below. For each K- Map

i. Write the appropriate standard form (SOP/POS) of Boolean expression.
ii. Design the circuit using AND, NOT and OR gates.
iii. Design the circuit only by using
 NAND gates if the standard form obtained in part (i) is SOP.
 NOR gates if the standard form obtained in pat (i) is POS.

(a)

AB/C 0 1

00 0 0

14
 01 0 1

11 0 1

10 1 0

(b)

AB/CD 00 01 11 10

00 1 0 0 1

01 0 1 0 1

11 1 1 1 0

10 1 1 1 1

(c)

AB/C 0 1

00 1 0

01 1 1

11 1 0

10 0 1

Activity 04

Part 1

1. Describe the distinguishing characteristics of different binary operations that are performed on the

15
 same set.

Part 2

1. Determine the operation tables for group G with orders 1, 2, 3 and 4 using the elements a, b, c, and
e as the identity element in an appropriate way.
2.
i. State the relation between the order of a group and the number of binary operations that can be
defined on that set.
ii. How many binary operations can be defined on a set with 4 elements?
3.
i. State the Lagrange’s theorem of group theory.
ii. For a subgroup H of a group G, prove the Lagrange’s theorem.
iii. Discuss whether a group H with order 6 can be a subgroup of a group with order 13 or not.
Clearly state the reasons.

Part 3

1. Validate whether the set S=ℜ−{−1}is a group under the binary operation ‘*’defined as
a∗b=a+ b+ab for any two elementsa , b ∈ S .

Part 4

Prepare a presentation for ten minutes to explore an application of group theory relevant to your course
of study. (i.e. in Computer Sciences)

16
17
18
Grading Rubric

Grading Criteria Achieved Feedback

LO1 : Examine set theory and functions applicable

to software engineering.

P1 Perform algebraic set operations in a formulated

mathematical problem.

P2 Determine the cardinality of a given bag (multiset).

M1 Determine the inverse of a function using

appropriate mathematical technique.

D1 Formulate corresponding proof principles to prove

properties about defined sets.
LO2 : Analyse mathematical structures of objects
using graph theory.

P3 Model contextualized problems using trees, both

quantitatively and qualitatively.
P4 Use Dijkstra’s algorithm to find a shortest path
spanning tree in a graph.

M2 Assess whether an Eulerian and Hamiltonian

circuit exists in an undirected graph.

D2 Construct a proof of the Five colour theorem.

19
 LO3 : Investigate solutions to problem
situations using the application of Boolean
algebra.
P5 Diagram a binary problem in the application of
Boolean Algebra.
P6 Produce a truth table and its corresponding Boolean
equation from an applicable scenario.
M3 Simplify a Boolean equation using algebraic
methods.

D3 Design a complex system using logic gates.

LO4 : Explore applicable concepts within abstract

algebra.
P7 Describe the distinguishing characteristics of
different binary operations that are performed on the
same set.

P8 Determine the order of a group and the order of a

subgroup in given examples.

M4 Validate whether a given set with a binary

operation is indeed a group.

D4 Explore with the aid of a prepared presentation the

application of group theory relevant to your course of
study

20
Activity 01

Part 1

01)

(i)

n ( A ∪ B )=n ( A )+ n ( B ) −n ( A ∩B )
n ( A ∪ B )=72+28−13=87

n ( A ∪ B )=87

(ii)

n ( A−B )=n ( A )−n( A ∩ B)

45=n ( A ) −15
n ( A ) =45+15=60

n ( A ) =60

n ( A ∪ B )=n ( A )+ n ( B ) −n( A ∩ B)
110=60+n ( B )−15
110=45+ n(B)
n ( B )=110−45=65

n ( B )=65

(iii)

n ( A ) =33
10+ a+5+b=33
21
a+ b+15=33
a+ b=33−15=18

a+ b=18 ⟶(1)

n ( B )=36
15+ a+5+c=36
a+ c+ 20=36
a+ c=36−20=16

a+ c=16 ⟶(2)

n ( C )=28
13+b +5+c=28
b+ c+ 18=28
b+ c=28−18=10

b+ c=10 ⟶(3)

( 1 )−(2)
a+ b− ( a+c )=18−16=2

b−c=2 ⟶(4)

( 3 ) +(4)
b+ c+ b−c=10+2=12

2 b=12
b=6

¿ ( 1) ,
a+ b=18
a+ 6=18
a=18−6=12

22
a=12

¿ ( 2) ,
a+ c=16
12+c=16
c=16−12=4

c=4

n ( A ∩ B )=a+5=12+5=17
n ( A ∩ B )=17

n ( A ∩C )=b+5=6+5=11
n ( A ∩C )=11

n ( B∩ C ) =c+ 5=4+5=9
n ( B∩ C ) =9

n ( A ∪ B∪ C )=n ( A )+ n ( B )+ n (C )−n ( A ∩ B ) −n ( A ∩C ) −n ( B ∩C ) +n( A ∩ B ∩C)

n ( A ∪ B∪ C )=33+ 36+28−17−11−9+5
n ( A ∪ B∪ C )=(33+36+ 28+5)−(17 +11+9)
n ( A ∪ B∪ C )=102−37=65

n ( A ∪ B∪ C )=65

Part 2

01)

(i)

23
160 / 2 = 80

80 / 2 = 40

40 / 2 = 20

20 / 2 = 10

10 / 2 = 5

5/5=1

160 = 2 * 2 * 2 * 2 * 2 * 5

Let A = Multiset of prime factors of 160

A = [2, 2, 2, 2, 2, 5]

(ii)

120 / 2 = 60

60 / 2 = 30

30 / 2 = 15

15 / 3 = 5

5/5=1

120 = 2 * 2 * 2 * 3 * 5

Let B = Multiset of prime factors of 120

B = [2, 2, 2, 3, 5]

24
(iii)

250 / 2 = 125

125 / 5 = 25

25 / 5 = 5

5/5=1

250 = 2 * 5 * 5 * 5

Let C = Multiset of prime factors of 250

C = [2, 5, 5, 5]

02)

(i)

A = [2, 2, 2, 2, 2, 5]

µA (2) = 5, µA (5) = 1

(ii)

B = [2, 2, 2, 3, 5]

25
µB (2) = 3, µB (3) = 1, µB (5) = 1

(iii)

C = [2, 5, 5, 5]

µC (2) = 1, µC (5) = 3

03)

(i)

A = [2, 2, 2, 2, 2, 5]

n(A) = µA (2) + µA (5)

n(A) = 5 + 1 = 6

n(A) = 6

(ii)

B = [2, 2, 2, 3, 5]

n(B) = µB (2) + µB (3) + µB (5)

26
n(B) = 3 + 1 + 1 = 5

n(B) = 5

(iii)

C = [2, 5, 5, 5]

n(C) = µC (2) + µC (5)

n(C) = 1 + 3 = 4

n(C) = 4

Activity 02

Part 1

01)

Problem 1: Making the decision to improve the programming skills of students based on their
programming test scores

27
In the decision-making process for improving the programming skills of students based on their test
scores, if the marks are greater than or equal to 75, no improvement is needed. However, if the marks are
less than 75, further evaluation is required. If the marks are greater than or equal to 50 but less than 75,
attending programming tutorials becomes necessary. For students scoring below 50, both tutorials and
theory revision are needed. If the marks are less than 50, a more focused approach is taken: if the marks
are greater than or equal to 30, individual programming classes should be arranged; if the marks are
below 30, the student may need to retake the exam to ensure they grasp the necessary skills.

Problem 2: Making a decision whether an outdoor sports event can be held or not by considering
wind speed and air quality

28
In the decision-making process for determining whether an outdoor sports event can be held, if the wind
speed is higher than the average threshold, the event will not be held. If the wind speed is less than or
equal to the average, the event can proceed. In cases where the wind speed is within the acceptable
range, the next step is to evaluate the air quality. If the air quality is poor, the event will be canceled;
however, if the air quality is good, the event can be held. This process ensures that the event is only held
when both wind speed and air quality are suitable for the participants' safety and comfort.

Part 2

01)

Dijkstra's algorithm is a well-known technique used to find the shortest paths between a source vertex
and all other vertices in a directed weighted graph with non-negative edge weights. It initializes the
distances to all vertices as infinity, except for the source vertex, which is set to zero. The algorithm uses
a priority queue to explore vertices with the least estimated distance. For each vertex, it updates the
distances of adjacent vertices (relaxing edges) and removes the vertex with the smallest distance from
the queue. The process repeats until all vertices are processed, yielding the shortest paths. Its time
complexity is O((V+E)logV). (GeeksforGeeks, 2023)

02)

29
 E A B C D
E 0 ∞ ∞ ∞ ∞
D 0 5 ∞ ∞ 3
A 0 5 7 9 3
B 0 5 7 9 3
C 0 5 7 9 3
0 5 7 9 3

According to the Dijkstra’s algorithm, the shortest distances for all vertices A, B, C and D from source
vertex E are as follows.

E to A: - 5

E to B: - 7

E to C: - 9

E to D: - 3

The shortest spanning tree for the above given graph is as follows.

Activity 03

Part 1

30
01)

Problem 1: Automatic garden watering system

In an automatic garden watering system, we want the water sprinklers to turn on if the soil moisture is
low or the temperature is high, but only when the system is enabled. The system also has a disable
feature that prevents the sprinklers from activating when turned off.

Boolean variables for this binary problem are as follows.

A: Soil moisture sensor (1 = moisture low, 0 = moisture sufficient)

B: Temperature sensor (1 = temperature high, 0 = temperature normal)

C: System enabled status (1 = enabled, 0 = disabled)

D: Sprinkler status (1 = sprinklers on, 0 = sprinklers off)

Equivalent equation for this binary problem is as follows.

D = (A + B). C

This is the truth table according to the equation for this binary problem.

A B C A+B D = (A + B).C

0 0 0 0 0

0 0 1 0 0

0 1 0 1 0
31
 0 1 1 1 1

1 0 0 1 0

1 0 1 1 1

1 1 0 1 0

1 1 1 1 1

Logic circuit design based on the above truth table for the given problem is as follows.

Problem 2: Server monitoring system for critical error alerts

In a server monitoring system, administrators need to be alerted when a server is experiencing high CPU
usage or low available memory. However, the alert is only triggered if the server is marked as critical for
operations, even if both conditions are met.

Boolean variables for this binary problem are as follows.

A: High CPU usage (1 = high usage, 0 = normal usage)

B: Low memory (1 = low memory, 0 = sufficient memory)

32
C: Server criticality (1 = critical server, 0 = non-critical server)

E: Error alert (1 = alert triggered, 0 = no alert)

Equivalent equation for this binary problem is as follows.

E = (A + B). C

This is the truth table according to the equation for this binary problem.

A B C A+B E = (A + B).C

0 0 0 0 0

0 0 1 0 0

0 1 0 1 0

0 1 1 1 1

1 0 0 1 0

1 0 1 1 1

1 1 0 1 0

1 1 1 1 1

Logic circuit design based on the above truth table for the given problem is as follows.

33
Part 2

01)

(i)

Input A

Driver present = 1

Driver absent = 0

Input B

Driver buckled up = 1

Driver not buckled up = 0

Input C

Ignition switch on = 1

34
Ignition switch off = 0

In this scenario, the warning light will turn on only when all the specified conditions are satisfied. This
corresponds to an AND gate logic, where the output is active if all inputs meet the required criteria.
According to this scenario, the output function f(A,B,C) can be expressed as A. B. C, meaning the
warning light is triggered when A is true (condition satisfied), B is false (condition not satisfied), and C
is true (condition satisfied).

f (A, B, C) = A. B. C

A B B C f (A, B, C)
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
1 0 1 0 0
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0

(ii)

Input A

Rain = 1

No rain = 0

Input B

35
Open umbrella = 1

Don’t open umbrella = 0

In this scenario, you will get wet only if it rains and you do not open your umbrella. This corresponds to
an AND gate logic, where the output is active only when specific conditions are met. According to this
scenario, the output function f(A,B) can be expressed as A⋅ B, meaning you will get wet when A (it
rains) is true and B (umbrella opened) is false.

f (A, B) = A. B

A B B f (A, B)
0 0 1 0
0 1 0 0
1 0 1 1
1 1 0 0

02)

(i)

f (A, B, C) = A BC + A B C + ABC + A BC

A B C A BC AB C ABC A BC f (A, B, C)
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 1
0 1 0 0 0 0 1 1
0 1 1 0 0 0 0 0
1 0 0 0 1 0 0 1
1 0 1 0 0 0 0 0

36
 1 1 0 0 0 0 0 0
1 1 1 0 0 1 0 1

(ii)

f (A, B, C) = (A + B + C) (A + B + C) ( A + B + C )

A B C A+B+C A+B+C A+B+C f (A, B, C)

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

Activity 04

Part 1

01)

Closure property

An operation (*) on an non-empty set A has closure property if a, b ∈ A, then a * b ∈ A.

Given below are some examples for closure property.

37
  Addition binary operator satisfies closure property on set of real numbers ( R ) since for a, b ∈ R ,
then a + b ∈ R .
 Multiplication binary operator satisfies closure property on set of real numbers ( R ) since for a, b
∈ R , then a × b ∈ R .

Commutative property

A binary operation (*) on set A is commutative if a, b ∈ A, then a * b = b * a.

Given below are some examples for commutative property.

 Addition satisfies commutative property for a and b when a, b ∈ R because a + b = b + a.

 Multiplication satisfies commutative property for a and b when a, b ∈ R because a × b = b × a.

Associative property

A binary operation (*) on set A is associative if a, b, c ∈ A, then a * (b * c) = (a * b) * c.

Given below are some examples for associative property.

 Addition satisfies associative property for a, b and c when a, b, c ∈ R because a + (b + c) = (a +

b) + c.
 Multiplication satisfies associative property for a, b and c when a, b, c ∈ R because a × (b × c) =
(a × b) × c.

Identity property

38
If A is a non-empty set and * is a binary operation, a * e = e * a = a when a ∈ A and e is an identity
element.

Given below are some examples for identity property.

 a ∈ R and e is an identity element. Then, a + e = e + a = a. The value of e is 0. e = 0 ∈ R .

Addition satisfies identity property.
 a ∈ R and e is an identity element. Then, a × e = e × a = a. The value of e is 1. e = 1 ∈ R .
Multiplication satisfies identity property.

Inverse property

If A is non-empty set and * is a binary operator and a, b ∈ A, when a * b = e, then b = a−1.

Given below are some examples for inverse property.

 a, b ∈ R and e is an identity element. Then, a + b = e. e is 0 for addition. So, a + b = 0 and b = -a.

b = -a ∈ R . Addition satisfies inverse property.
 a, b ∈ R and e is an identity element. Then, a × b = e. e is 1 for multiplication. So, a × b = 1 and
b = 1 / a. b = 1 / a ∈ R . Multiplication satisfies inverse property.

Part 2

01)

Operational table of group G with order 1 (Only contains e which is the identity element)

39
 * e
e e

Operational table of group G with order 2 (Contains e and a)

* e a
e e a
a a e

Operational table of group G with order 3 (Contains e, a and b)

* e a b
e e a b
a a b e
b b e a

Operational table of group G with order 4 (Contains e, a, b and c)

* e a b c
e e a b c
a a b c e
b b c e a
c c e a b

02)

(i)

40
 2
The total number of binary operations that can be defined on a group of order n is n n . This is because a
binary operation maps each pair of elements in the group to an element in the same group. For a group of
order n, there are n2 pairs of elements, and each pair can be mapped to any of the n elements in the
2
group. Therefore, the total number of possible binary operations is n n .

(ii)

Number of elements = Order of the group = 4

n n (n = 4)
2
16
4 4 = 4 = 4, 294, 967, 296

The total number of binary operations that can be defined on a set with 4 elements is 4,294,967,296. This
is because a binary operation involves mapping every pair of elements in the set to an element in the
same set. For a set with 4 elements, there are 4×4=16 pairs of elements, and each pair can be mapped to
any of the 4 elements. Therefore, the total number of binary operations is 416=4,294,967,296.

03)

(i)

The order of a group is always divisible by the order of any of its subgroups, leaving a remainder of 0.
This means that the order of the group is an integer multiple of the order of its subgroup.

(ii)

41
If H is a subgroup of a group G, the order of H divides the order of G exactly, leaving no remainder. In
other words, the size of the subgroup H is a factor of the size of the group G.

(iii)

According to Lagrange's theorem, the order of a subgroup H must divide the order of the group G
exactly, leaving no remainder. If the order of the group G is 13, which is a prime number, the possible
orders of any subgroup H are 1 or 13, as these are the only factors of 13. If the order of H is given as 6, it
cannot be a factor of 13. Therefore, a group H with order 6 cannot be a subgroup of a group with order
13, as it violates Lagrange's theorem.

References

‌GeeksforGeeks (2023). What is Dijkstra’s Algorithm? | Introduction to Dijkstra’s Shortest Path

Algorithm. [online] GeeksforGeeks.
Available at:
https://www.geeksforgeeks.org/introduction-to-dijkstras-shortest-path-algorithm
[Accessed 06 Jun. 2025].

42