Higher Nationals

Assignment Brief – BTEC (RQF)

Higher National Diploma in Computing

Student Name /ID Number

Unit Number and Title Unit 18: Discrete Maths

Academic Year 2023-2024

Unit Assessor

Assignment Title ASSIGNMENT 1- Set theory and functions- Graph theory

Issue Date 15/9/2023

Submission Date 15/9/2023

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 line spacing is 1.5, font is Times New Roman, and font size is 12. You are required to make use of
headings, paragraphs and subsections as appropriate, and all work must be supported with research and
referenced using the Harvard referencing system. Please also provide a bibliography using the Harvard
referencing system. Plagiarism will lead to the failure of the assignment. The recommended word limit is
3000 words, although you will not be penalised for exceeding the total word limit.

Unit Learning Outcomes:

LO1. Examine set theory and functions applicable to software engineering

LO2: Analyse mathematical structures of objects using graph theory
Assignment Brief and Guidance:

Part 1:
1. Let A and B be two non-empty finite sets. If cardinalities of the sets A, B, and A ∩ B are 86, 43
and 11 respectively, find the cardinality of the set A ∪ B.

2. Let A={n∈N:30≤n<50} and B={n∈N:10<n≤42} and C={n∈N:5<n≤35} Suppose D is a set such

that D⊆A and D⊆B and D⊆C

What is the largest possible cardinality of D?

3. Let A={1,2,…,10}. Define B2={B⊆A:|B|=2}. Find |B2|?
4. Consider the sets A and B, where A={3,|B|} and B={1,|A|,|B|}. What are the sets?
Part 2:
1. Write the multi-sets of prime factors of given numbers.

a. 1300

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

3. Present the application of set and multiset in software engineering? Give specific programming
example
Part 3:
1. Determine whether the following functions are invertible or not. If it is invertible, then find the rule
of the inverse f-1(x)
a. f: 𝑅 → 𝑅 + b. f: [0, 𝜋] → [−2,2]
𝑓(𝑥) = 𝑥 2 𝑓(𝑥) = 2 𝑐𝑜𝑠𝑥
5
2. Function f(x) = 9(x-32) converts Fahrenheit temperatures into Celsius. What is the function for
opposite conversion?

3. Present the application of function in software engineering? Give specific programming example

Part 4:
1. Formulate corresponding proof principles to prove the following properties about defined sets.

2. De Morgan's Law by mathematical induction.

3. Distributive Laws for three non-empty finite sets A, B, and C.

Part 5:
1. Discuss using two examples on binary trees both quantitatively and qualitatively.

Part 6:
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, E, F,
G given using Dijkstra's algorithm.
Part 7:
Check whether the following graphs have an Eulerian and/or Hamiltonian circuit.

Part 8:
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 by cycling from
Bkacad Academy of Technology to Hoan Kiem Lake in Ha Noi by considering most of the
practical situations (such as millage of the vehicle, etc.) as much as you can. Essentially consider
routes with shortest distance.
3. Radio stations broadcast their signal at certain frequencies. However, there are a limited number of
frequencies to choose from, so nationwide many stations use the same frequency. This works
because the stations are far enough apart that their signals will not interfere; no one radio could pick
them up at the same time. Suppose 10 new radio stations are to be set up in a currently unpopulated
(by radio stations) region. The radio stations that are close enough to each other to cause interference
are recorded in the table below. What is the fewest number of frequencies the stations could use?
Learning Outcomes and Assessment Criteria

Learning Outcome Pass Merit Distinction

LO1. Examine set P1 Perform algebraic set M1 Determine the inverse D1 Formulate
theory and functions operations in a formulated of a function using corresponding proof
applicable to software mathematical problem. appropriate mathematical principles to prove
engineering P2 Determine the techniques. properties about defined
cardinality of a given sets.
bag (multiset).

LO2: Analyse P3 Model contextualised M2 Assess whether an D2 Construct a proof of

mathematical structures problems using trees, Eulerian and the Five Colour
of objects using graph both quantitatively and Hamiltonian circuit Theorem..
theory qualitatively. exists in an undirected
P4 Use Dijkstra's graph.
algorithm to find a
shortest path spanning
tree in a graph.
Higher Education Qualifications
Assignment Brief