Higher Nationals

Internal verification of assessment decisions – BTEC (RQF)

INTERNAL VERIFICATION – ASSESSMENT DECISIONS
Programme title BTEC Higher National Diploma in Computing
Mr Lilanka
Assessor Internal Verifier
Unit 18: Discrete Mathematics
Unit(s)
Discrete mathematics in software engineering concepts
Assignment title
Kariyawasam Katukoliha Gamage Anne Shevoni
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 comments on the Y/N
student work?
Has the work been assessed
Y/N
accurately?
Is the feedback to the student:
Give details:

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

• Identifying opportunities for

improved performance?
Y/N

• Agreeing actions? Y/N

Does the assessment decision need

Y/N
amending?
Assessor signature Date

Internal Verifier signature Date

Programme Leader signature (if
Date
required)

Confirm action completed

Remedial action taken

Give details:

Assessor signature Date

Internal Verifier
Date
signature 1
Programme Leader
Date
signature (if required)
Higher Nationals - Summative Assignment Feedback Form
Student Name/ID Kariyawasam Katukoliha Gamage Anne Shevoni COL/E-008848

Unit Title Unit 18 : Discrete Mathematics

Assignment Number 1 Assessor Mr Lilanka

/ /2021 Date Received 1st
Submission Date
submission
Date Received 2nd
Re-submission Date
submission

2
 Assessor Feedback:

LO1 Examine set theory and functions applicable to software engineering .

Pass, Merit & Distinction P1 P2 M1 D1

Descripts
LO2 Analyse mathematical structures of objects using graph theory.

Pass, Merit & Distinction P3 P4 M2 D2

Descripts

LO3 Investigate solutions to problem situations using the application of Boolean algebra.
Pass, Merit & Distinction P5 P6 M3 D3
Descripts
LO4 Explore applicable concepts within abstract algebra.

Pass, Merit & Distinction P7 P8 M4 D4

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.

Pearson
Higher Nationals in

3
Computing
Unit 18 : Discrete Mathematics
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 be sure to fill the details correctly.
2. This entire brief should be attached in first before you start answering.
3. All the assignments should prepare using word processing software.
4. All the assignments should print in A4 sized paper, and make sure to only use one side printing.
5. Allow 1” margin on each side of the paper. But on the left side you will need to leave room for binging.

Word Processing Rules

1. Use a font type that will make easy for your examiner to read. The font size should be 12 point, and should be in the style of
Times New Roman.
2. Use 1.5 line word-processing. Left justify all paragraphs.
3. Ensure that all headings are consistent in terms of size and font style.
4. Use footer function on 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 edit your assignment.

Important Points:
1. Check carefully the hand in date and the instructions given with the assignment. Late submissions will not be accepted.
2. Ensure that you give yourself enough time to complete the assignment by the due date.
3. Don’t leave things such as printing to the last minute – excuses of this nature will not be accepted for failure to hand in the
work on time.
4. You must take responsibility for managing your own time effectively.
5. 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.
6. Failure to achieve at least a PASS grade will result in a REFERRAL grade being given.
7. Non-submission of work without valid reasons will lead to an automatic REFERRAL. You will then be asked to complete an
alternative assignment.
8. Take great care that if you use other people’s work or ideas in your assignment, you properly reference them, using the
HARVARD referencing system, in you text and any bibliography, otherwise you may be guilty of plagiarism.
9. If you are caught plagiarising you could have your grade reduced to A REFERRAL or at worst you could be excluded from the
course.

4
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 aspects 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
Edexcel UK.
6. I understand that my assignment will not be considered as submitted if this document is not attached to the attached.

shevonikariyawasam5@gmail.com / /2021
Student’s Signature: Date:
(Provide E-mail ID) (Provide Submission Date)

Assignment Brief
Student Name /ID Number Kariyawasam Katukoliha Gamage Anne Shevoni COL/E-008848

Unit Number and Title Unit 18 :Discrete Mathematics

5
Academic Year 2020/2021

Unit Tutor Mr Lilanka

Assignment Title Discrete mathematics in Computing

Issue Date 19/12/2020

Submission Date / /2021

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:

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. 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 .

2. If n( A  B )=45, n( A  B )=110 and n( A  B )=15, then find n(B).

3. If n(A)=33, n(B)=36 and n(C)=28, find n( A  B  C ).

6
Part 2
1. Write the multisets of prime factors of given numbers.
I. 160
II. 120
III. 250
2. Write the multiplicities of each element of multisets in part 2(1-I,ii,iii) separately.
3. Find the cardinalities of each multiset in part 2-1.

Part 3
1. Determine whether the following functions are invertible or not. If it is invertible, then find the
rule of the inverse f  x 
1

i. f :     ii. f :   
f ( x)  x 2 f ( x)  1
x
iii. f :  
 
iv.  2 2

f :   ,    1, 1
f ( x)  x 2 f ( x)  sin x
v. f : 0 ,     2, 2
f ( x)  2 cos x
5
f ( x)  ( x  32)
2. Function 9 converts Fahrenheit temperatures into Celsius. What is the
function for opposite conversion?

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

Activity 02

7
Part 1

1. Discuss using two examples on 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.
2. Find the shortest path spanning tree for the weighted directed graph with vertices A, B, C, D, and E given using
algorithm.

Part 3
1. Check whether the following graphs have an Eulerian and/or Hamiltonian circuit.

I.

II.

8
 III.

Part 4

1. Construct a proof for the five color theorem for every planar graph.
2. Discuss how efficiently Graph Theory can be used in a route planning project for a vacation trip from Co
Trincomalee by considering most of the practical situations (such as millage of the vehicle, etc.) as much as
Essentially consider the two fold,
- Routes with shortest distance(Quick route travelling by own vehicle)
- Route with the lowest cost
3. Determine the minimum number of separate racks needed to store the chemicals given in the table (1
considering their incompatibility using graph coloring technique. Clearly state you steps and graphs used.

Chemical Incompatible with

Ammonia Mercury, chlorine, calcium hypochlorite,

(anhydrous) iodine, bromine, hydrofluoric acid (anhydrous)

Chlorine Ammonia, acetylene, butadiene, butane, methane, propane

, hydrogen, sodium carbide, benzene,
finely divided metals, turpentine

Iodine Acetylene, ammonia (aqueous or anhydrous), hydrogen

Silver Acetylene, oxalic acid, tartaric acid, ammonium compounds,

pulmonic acid

9
 Iodine Acetylene, ammonia (aqueous or anhydrous), hydrogen

Mercury Acetylene, pulmonic acid, ammonia

Fluorine All other chemicals

Activity 03

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

Part 2
1. Develop 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. A B C  AB C  ABC  A BC
ii. ( A  B  C )( A  B  C )( A  B  C )
Part 3
1. Find the simplest form of given Boolean expressions using algebraic methods.
i. A(A+B)+B(B +C)+C(C+A)
ii. ( A  B )( B  C )  ( A  B )(C  A )

iii. ( A  B )( AC  AC )  AB  B
iv. A ( A  B )  ( B  A)( A  B )
Part 4
1. Consider the K-Maps given. For each K- Map
i. Write the appropriate standard form (SOP/POS) of Boolean expression.
ii. Draw the circuit using AND, NOT and OR gates.
iii. Draw the circuit only by using
i. NAND gates if the standard form obtained in part (i) is SOP.
ii. NOR gates if the standard form obtained in pat (i) is POS.

(a)

AB/C 0 1

00 0 0

01 0 1

10
 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

11
Activity 04

Part 1
1. Describe the characteristics of different binary operations that are performed on the same set.
2. Justify whether the given operations on relevant sets are binary operations or not.
i. Multiplication and Division on se of Natural numbers
ii. Subtraction and Addition on Set of Natural numbers
Exponential operation: ( x, y )  x on Set of Natural numbers and set of Integers
y
iii.

Part 2
1. Build up 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 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. Check whether the set S    {1} is a group under the binary operation ‘*’defined as
a * b  a  b  ab for any two elements a, b  S .
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. Discuss the group theory concept behind the Rubik’s cube.
Part 4
1. Prepare a presentation for ten minutes that explains an application of group theory in computer
sciences.

12
Discrete Maths

Unit 18

K.K.G. Anne Shevoni

HND -COM Batch 89
Acknowledgement

On behalf of all the students, I wish to thank you profusely my Discrete Maths lecturer,
Mr Lilanka for guiding towards the completion of the assignment in a well-mannered
way. I would like to thank my parents who helped me to continue my studies. It would be
amiss if I did not thank my friends who helped me to do this assignment.
Thank You.

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page

Contents
List of figures.....................................................................................................................

List of tables.......................................................................................................................

List of charts.......................................................................................................................

Activity 01..........................................................................................................................

Part 1..................................................................................................................................

Part 2..................................................................................................................................

Part 3..................................................................................................................................

Part 4..................................................................................................................................

Activity 02..........................................................................................................................

Part 1..................................................................................................................................

Part 2..................................................................................................................................

Part 3..................................................................................................................................

Part 4..................................................................................................................................

Activity 03..........................................................................................................................

Part 1..................................................................................................................................

Part 2..................................................................................................................................

Part 3..................................................................................................................................

Part 4..................................................................................................................................

Activity 04..........................................................................................................................

Part 1..................................................................................................................................

Part 2..................................................................................................................................

Part 3..................................................................................................................................

Part 4..................................................................................................................................

Self-Criticism...................................................................................................................

Conclusion........................................................................................................................

References........................................................................................................................

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page

Gantt chart........................................................................................................................

List of figures

Figure 1: Hub23

Figure 2: Switch23

Figure 3: NIC24

Figure 4: Hub23

Figure 5: Switch23

Figure 6: NIC24

Figure 7: Hub23

Figure 8: Switch23

Figure 9: NIC24

Figure 10: Hub23

Figure 11: Switch23

Figure 12: NIC24

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page

Introduction

Discrete Mathematics is not any special branch of mathematics. It is actually a description

of a set of different branches of mathematics which are “discrete” in nature, and not
“continuous”. It involves discrete elements of mathematics that uses algebra and
arithmetic. This branch of mathematics has intensive application in applied mathematics,
and computer science. Discrete mathematics provides effective tools for improving
mathematical reasoning, interpretation, and problem-solving capabilities of researchers.

The following is a list of the learning outcomes which are covered by this
assignment:

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

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page

Activity 01

Part 1

1. 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 .

n(A)=72 n(B)=28 n(A∩B)=13 n(AUB)=?

We can solve this question using below formula.

n(AUB)= n(A) + n(B) – n(A∩ B ¿

= 72 + 28 – 13
= 100 – 13
= 87

2. If n( A  B )=45, n( A  B )=110 and n( A  B )=15, then find n(B).

We can find n(B) using below formula.

n(A-B) + n(B) = n(AU B ¿

45 + n(B) = 110
n(B) = 110 – 45
= 65

3. If n(A)=33, n(B)=36 and n(C)=28, find n( A  B  C ).

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page

We should find some values using above Venn diagram before finding n( A  B  C ).
10 + 5 + a + b = 33
a + b = 33 – 15
a + b = 18 1

15 + 5 + a + c = 36
a + c = 36 – 20
a + c = 16 2

13 + 5 + b + c = 28
b + c = 28 – 18
b + c = 10 3

1 - 2 ,
(a+b) – (a+c) = 18 – 16
a+b–a–c=2
b–c=2 4

3 - 4 ,
(c+b) – (b-c) = 10 – 2
c+b–b+c=8
2c = 8
c=4

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page

a + c = 16
a + 4 = 16
a = 12

a + b = 18
12 + b = 18
b=6

According to above Venn diagram,

n(AUBUC) = 10 + 13 + 15 + a + b + c + 5
= 10 + 13 + 15 + 12 + 6 + 4 + 5
= 65

Part 2

1. Write the multisets of prime factors of given numbers.

I. 160

Prime factors of 160 are 2, 2, 2, 2, 2 and 5

Prime factors multiset as A
A = [2, 2, 2, 2, 2, 5]

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page

II. 120

Prime factors of 120 are 2, 2, 2, 3 and 5

Prime factors multiset as A
A = [2, 2, 2, 3, 5]

III. 250

Prime factors of 250 are 2, 5, 5 and 5

Prime factors multiset as A
A = [2, 5, 5, 5]

2. Write the multiplicities of each element of multisets in part 2(1-I,II,III) separately.

I. 160
Prime factors multiset as A
A = [2, 2, 2, 2, 2, 5]
μ2= 5
μ5= 1

II. 120
Prime factors multiset as A

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page

 A = [2, 2, 2, 3, 5]
μ2= 3
μ3= 1
μ5= 1

III. 250
Prime factors multiset as A
A = [2, 5, 5, 5]
μ2= 1
μ5= 3

3. Find the cardinalities of each multiset in part 2-1.

I. 160
Prime factors multiset as A
A = [2, 2, 2, 2, 2, 5]
│A│= 6

I. 120
Prime factors multiset as A
A = [2, 2, 2, 3, 5]
│A│= 5

I. 250
Prime factors multiset as A
A = [2, 5, 5, 5]
│A│= 4

Part 3

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

1. Determine whether the following functions are invertible or not. If it is invertible, then
 x 
find the rule of the inverse f
1

y = x2

R R+
x y
+/- +

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

Function is not invertible as more than one cut per line.
So, there is no inverse for the function.

1
y=
x

R+ R+
x y
+ +

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

Function is invertible as only one cut per horizontal line is there.

1
y=
x
Inverse
1
x=
y
1
y=
x
1
𝑓-1(𝑥) =
x

y = x2

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

R+ R+
x y
+ +

Function is invertible as only one cut per horizontal line is there.

y = x2
Inverse
x = y2

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

y = √x
𝑓-1(𝑥) = √x

y = Sin x

x y
[-π/2, π/2] [-1, 1]

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

Function is invertible as only one cut per horizontal line is there.

y = Sin x
Inverse
x = Sin y
y = Sinx
𝑓-1(𝑥) = Sin(x)

y = 2 Cos x

x y
[0, π] [-2, 2]

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

Function is invertible as only one cut per horizontal line is there.

y = 2 Cos x
Inverse
x = 2 Cos y
Cos y = x/2
y = Cos(x/2)
𝑓-1(𝑥) = Cos(x/2)

5
f ( x)  ( x  32)
2. Function 9 converts Fahrenheit temperatures into Celsius. What is the
function for opposite conversion?

5
y= (x – 32)
9

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

Function is invertible as only one cut per horizontal line is there.

5
f ( x)  ( x  32)
9
5
y= (x – 32)
9
Inverse
5
x= (y – 32)
9
9x = 5(y – 32)
9x
y – 32 =
5
9x
y = 5 + 32

9x
𝑓-1(𝑥) = + 32
5

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

Part 4
2. Formulate corresponding proof principles to prove the following properties about
defined sets.
iv. A  B  A  B and B  A
v. De Morgan’s Law by mathematical induction
vi. Distributive Laws for three non-empty finite sets A, B, and C

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

Self-Criticism

First of all, I would like to say this assignment was a challenge for me. Especially because
I thought that Discrete Maths is just another simple topic. Therefor I started doing the the
assignment and then it made me realize that I was wrong. When I find the real
information and dig deeper into the root of the topic, I realized that Discrete Maths is also
an iceberg hidden in the calming sea. It had more interesting and important facts proving
my first impression was wrong. Doing this assignment was harder and more time
consuming than I thought. It thought me to be productive when using time and also to be
patient. Most importantly, this assignment taught me not to judge nothing without
knowing it in full.
I think I have tried my best for completing this assignment and I am sure that I have
answered all the questions in my best. I got a good knowledge related to Discrete Maths
subject.

Conclusion

References

Gantt Chart

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |

K. K. G. Anne Shevoni Unit 18 – Discrete Maths Page |
 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 Eularian and Hamiltonian circuit exists in an

undirected graph.

D2 Construct a proof of the Five colour theorem.

LO3 Investigate solutions to problem situations using the

application of Boolean algebra.

K. K. G. Anne Shevoni Unit 18 – Discrete Maths P a g e | 22

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 Prepare a presentation that explains an application of group theory
relevant to your course of study.

K. K. G. Anne Shevoni Unit 18 – Discrete Maths P a g e | 23

K. K. G. Anne Shevoni Unit 18 – Discrete Maths P a g e | 24
K. K. G. Anne Shevoni Unit 18 – Discrete Maths P a g e | 25
K. K. G. Anne Shevoni Unit 18 – Discrete Maths P a g e | 26