Higher Nationals

Internal verification of assessment decisions – BTEC (RQF)

INTERNAL VERIFICATION – ASSESSMENT DECISIONS
Programme title BTECinHigher
HND National
Computing Diploma
- Software in Computing
Engineering Pathway

Assessor Internal Verifier

Unit 18 : Discrete Mathematics
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 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
Programme Leader
Date
signature (if required)
Higher Nationals - Summative Assignment Feedback Form
Student Name/ID
Unit Title Unit 18 : Discrete Mathematics

Assignment Number 1 Assessor

Date Received 1st
Submission Date
submission
Date Received 2nd
Re-submission Date
submission
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
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 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. 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 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 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: Date:

(Provide E-mail ID) (Provide Submission Date)
Feedback Form

Formative feedback: Assessor to Student

Action Plan

Summative feedback

Feedback: Student to Assessor

Assessor’s
Date
Signature

Student’s
Date
Signature
Assignment Brief

Student Name /ID Number

Unit Number and Title Unit 18 :Discrete Mathematics

Academic Year 2020/21

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:

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
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 −1 (x ) using appropriate mathematical technique.
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
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

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.
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 an Eulerian and/or a Hamiltonian cycle.

i.
 ii.

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.

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. 𝐴̄𝐵̄ 𝐶 + 𝐴𝐵̄ 𝐶̄ + 𝐴𝐵𝐶 + 𝐴̄𝐵𝐶̄
ii. (𝐴 + 𝐵̄ + 𝐶)(𝐴 + 𝐵 + 𝐶)(𝐴̄ + 𝐵 + 𝐶̄ )

Part 3
1. Simplify the following Boolean expressions using algebraic methods.
i. 𝐴(𝐴 + 𝐵) + 𝐵(𝐵 + 𝐶) + 𝐶(𝐶 + 𝐴)
ii. (𝐴 + 𝐵̄ )(𝐵 + 𝐶) + (𝐴 + 𝐵)(𝐶 + 𝐴̄)
iii. (𝐴 + 𝐵)(𝐴𝐶 + 𝐴𝐶̄ ) + 𝐴𝐵 + 𝐵
iv. 𝐴̄(𝐴 + 𝐵) + (𝐵 + 𝐴)(𝐴 + 𝐵̄ )
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

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
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 elements a, b  S .

Part 4
1. Prepare a presentation for ten minutes to explore an application of group theory relevant to
your course of study. (i.e. in Computer Sciences)
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.

 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 Prepare a presentation that explains an application of group

theory relevant to your course of study.