STUDENT ASSESSMENT SUBMISSION AND DECLARATION

When submitting evidence for assessment, each student must sign a declaration confirming
that the work is their own.

Student full name: M.T Himas Ahamed Assessor name:

Eng. A.L. Jubailah Begum

Issue date: Submission date: Submitted on:

27.05.2024

Programme:
Pearson BTEC HND in Computing

Unit no. & title: Unit 18 - Discrete Maths

Assignment title: Maths for software development at Pilani devs (Pvt) Ltd

Plagiarism
Plagiarism is a particular form of cheating. Plagiarism must be avoided at all costs and
students who break the rules, however innocently, may be penalised. It is your responsibility
to ensure that you understand correct referencing practices. As a university level student,
you are expected to use appropriate references throughout and keep carefully detailed notes
of all your sources of materials for material you have used in your work, including any material
downloaded from the Internet. Please consult the relevant unit lecturer or your course tutor
if you need any further advice.

Student Declaration

Student declaration

I certify that the assignment submission is entirely my own work and I fully understand the
consequences of plagiarism. I understand that making a false declaration is a form of
malpractice.

Student signature: 1028651 Date:

1
Assessment Tracking
Student M.T Himas Ahamed
Programme: HND Computing
Name:
Unit No. & Unit 18: Discrete Assessment Submission
Title: Maths Date: Date:
Assessor Eng. A.L. Completion IV sajeetha@bc
Name: Jubailah Begum Date: Signature: as.lk

Tasks Learning Criteria Date Hand In Formative Resubmission

Objectives Targeted Issued Date Feedback Date

P1, P2
1 LO1 M1 02.06.2024 03.06.2024 07.06.2024
D1

P3, P4
2 LO2 M2 19.06.2024 20.06.2024 24.06.2024
D2

27.05.2024
P5, P6
3 LO3 M3 30.06.2024 01.07.2024 05.07.2024
D3

P7, P8
LO4
4 M4 14.07.2024 15.07.2024 19.07.2024
D4

2
 ASSIGNMENT BRIEF
Unit 18: Discrete Maths
Student Full Name: M.T Himas Ahamed

Zoho ID: 1028651

Unit Number and Title: Unit 18: Discrete Maths

Academic Year: 2024

Programme & Batch no.: HND Computing – batch 19

Unit Assessor: Eng. A.L. Jubailah Begum

Assignment Title: Maths for software development at Pilani devs (Pvt) Ltd

Issue Date: 27.05.2024

Submission Date: 25.07.2024

Submission Format
Pdf document of the report & Microsoft PowerPoint Presentation slide set.

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.

Transferable skills and competencies developed

• Sets and set operations, Algebra within set theory, Set identities and proof of
identities, Set cardinality and power sets.
• Inverse relations and the inverse function, Injective and surjective functions, and
transitive relations.
• Spanning trees and rooted trees, Eulerian and Hamiltonian graphs, Vertex and edge
colourings of graphs, Walks, trails, paths and shortest paths.
• Expressing a truth table as a Boolean equation. Simplification of a Boolean equation
using algebraic methods, representing a Boolean equation using logic gates.
• Binary operations and associated properties, Commutative and associative operations.

3
• Introduction to groups, semigroups and monoids, Families of groups and group codes.
Vocational scenario
Suppose you are the team leader of your web development team at Pilani devs (Pvt) Ltd
which provides software solutions & web applications to the clients.

Your team is working on a multi-tenant web application where each tenant represents a
different organization. Each organization has various roles (e.g., admin, editor, viewer)
with specific permissions (e.g., read, write, delete) assigned to each role. Users are
assigned to one or more roles within their organization, and these roles determine what
actions they can perform in the application.

Assignment activity and guidance

Task 1
Task 1.1

If A = {2, 3, 4, 5} B = {4, 5, 6, 7} C = {6, 7, 8, 9} D = {8, 9, 10, 11}, Perform the

following algebraic set operations.

(a) A ∪ B (e) (A ∪ B) ∪ C

(b) A ∩ B (f) A ∪ (B ∩ C)

(c) B ∪ C (g) B ∪ (C ∪ D)

(d) C ∩ D (h) A - B

Task 1.2

Given than A = {a, b, c, d}. Using the knowledge that you have in determining the
cardinality, write down the power set of A.

Task 1.3

Determine the inverse of following functions using appropriate mathematical

techniques.
(i) f(x) = 3x – 5
(ii) g(x) = x3 – 7
(iii) h(x) = (x + 2)/(x-3)

4
 (iv) i(x) = √(x + 2)

Task 1.4

Prove the followings using the idea of set identity. Use the knowledge of Venn diagram.
Utilize the corresponding proof principles to prove properties in each.

(a) B ∪ (ø ∩ A) = B

(b) (A ′ ∩ U) ′ = A

(c) (C ∪ A) ∩ (B ∪ A) = A ∪ (B ∩ C)

(d) (A ∩ B) ∪ (A ∩ B ') = A

(e) A ∩ (A ∪ B) = A

Task 2
Task 2.1

Discuss about binary trees both quantitatively and qualitatively with the help of
exemplary diagrams.

Task 2.2

Find the shortest path between A to Z using Dijkstra's algorithm in the diagram given
below.

5
Task 2.3

Access whether an Eulerian and Hamiltonian circuit exists in the below given undirected
graphs.

Task 2.4

Construct a proof of the Five Color Theorem. Utilize the theory of the ‘chromatic
number’.

Task 3

Task 3.1

Discuss two real world binary problems in two different fields where the concept/theory
of Boolean Algebra is applied. Provide relevant diagrams.

Task 3.2

6
Given above a complex logic circuit system created with NAND, NOT and AND gates
according to the below given scenario.

• There are three conditions provided for the inputs of the circuit system. A lamp has
been fixed at the output.
• At one of the combinations of the input conditions only, the lamp will work.

Provide the Boolean Expression and the corresponding truth table for the above
circuit system which satisfies the above mentioned scenario.

Task 3.3

Simplify the following Boolean equation using algebraic methods and Boolean laws.

a) ACC + (A + A’) C + ABC

b) AA’ + BC + ABC
c) (A + B + B) (A + A’) (AA + (B’)’) + CC’

Task 3.4

An AC (Air Conditioner) in a room can be on (1) or off (0). A control system is required to
operate the AC efficiently with the following conditions / functionalities.

1. The AC can manually be switched on or off.

2. The timer will be either on or off.
3. The sensor will detect whether the environment is cold or hot.
4. The AC will automatically be switched on when the timer is on and the sensor
indicates the environment is hot.

The following table assigns Boolean values for the above conditions / functionalities

Condition / functionality Boolean value

AC switched on manually 1
AC switched off manually 0
Timer is on 1
Timer is off 0
Sensor detects cold environment 1
Sensor detects hot environment 0

7
 a) Produce a truth table to represent the functionality of the above system.

b) Write the corresponding Boolean equation/ expression to represent the truth

table constructed in the (a) above.

c) Design a complex logic circuit system by using a combination of only the basic
logic gates to implement the above control system.

Task 4
Task 4.1
When considering the set of all the natural numbers (ℕ), show whether the mathematical
operations of addition, subtraction, multiplication and division are:
(a) Associative binary operation

(b) Commutative binary operation

Task 4.2
(a) Describe the definition for ‘Group’ along with its properties.
(b) Validate that the set of non-zero real numbers with the operation of multiplication
is a commutative group.

Task 4.3

You are required to prepare a 15-minutes presentation aimed towards new students
engaged under a technology company’s graduate scheme.

Your presentation will include evidence of:

An explanation that adequately explains why group theory is taught to computing
students.

Recommended Resources
Please note that the resources listed are examples for you to use as a starting point in
your research – the list is not definitive.

• Attenborough, M. (2003) Mathematics for Electrical Engineering and

Computing. Oxford: Newnes.

• Piff, M. (2008) Discrete Maths Software Engineers: An Introduction for

Software Engineers. Cambridge: Cambridge University Press.

8
Learning Outcomes and Assessment Criteria

Pass Merit Distinction

LO1 Examine set theory and functions applicable to

software engineering

P1 Perform algebraic set M1 Determine the inverse D1 Formulate corresponding

operations in a of a function using proof principles to prove
formulated mathematical appropriate mathematical properties about defined sets.
problem. techniques.

P2 Determine the
cardinality of a given bag
(multiset)

LO2 Analyse mathematical structures of objects using

graph theory

P3 Model contextualised M2 Assess whether a

M2 Assess whether a Eulerian
problems using trees, Eulerian and Hamiltonian
and Hamiltonian circuit exists in
both quantitatively and circuit exists in an
an undirected graph.
qualitatively undirected graph.

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

Pass Merit Distinction

LO3 Investigate solutions to problem situations using

the application of Boolean algebra

P5 Diagram a binary M3 Simplify a Boolean D3 Design a complex

problem in the application equation using algebraic system using logic gates.
of Boolean algebra. methods.

9
P6 Produce a truth table
and its corresponding
Boolean equation from an
applicable scenario.

LO4 Explore applicable concepts within abstract algebra

P7 Describe the M4 Validate whether a

distinguishing given set with a binary
D4 Explore, with the aid of
characteristics of different operation is indeed a
a prepared presentation,
binary operations that are group.
the application of group
performed on the same
theory relevant to y
set.
P8 Determine the order of
a group and the order of a
subgroup in given
examples.

10
Guidance for Students

Deliverable: Report should be submitted as a soft copy of word processed Report.

NOTE:
• You should include the COVER PAGE, Assessment Declaration form and Unit Review
Plan of this assignment when you submit your final report.

• If submitted after the extended deadline, the assignment will not be accepted whereas
you shall be asked to go for a NEW assignment.

• Late Submission is not permitted until otherwise recommended by the Assessor

/Course Coordinator.
• Plagiarism will be treated as a very serious academic misconduct.

Instructions to students:

1. All assignment should comprise of the standard Front Cover given. No other front page
will be accepted.

2. Report Writing Guidelines:

1. Every Assignment should have an Introduction and Conclusion.

2. The standard Table of Contents should be generated.
3. All the Figures, Tables, Diagram etc. should be numbered.
4. Main Heading Font: Arial; Size 16
5. Sub heading: Font: Arial; Size 14
6. Body text: Font: Arial; Size 11
7. Paragraph: 1.5 spacing
8. Margins: Top: 1” Bottom: 1” Left: 1” Right: 1”
9. Header – include the module name on the right hand side
10. Footer – include the page number on the right hand side
11. All sections should have continuity and pages should be clearly ladled.
12. References – clear references for all the materials, books, articles, website etc
should be given in accordance with Harvard Reference style (Harvard Anglia
2008)

11
12
13
Task 1
Task 1.1

If A = {2, 3, 4, 5} B = {4, 5, 6, 7} C = {6, 7, 8, 9} D = {8, 9, 10, 11}, Perform the

following algebraic set operations.

(a) A ∪ B (e) (A ∪ B) ∪ C

(b) A ∩ B (f) A ∪ (B ∩ C)

(c) B ∪ C (g) B ∪ (C ∪ D)

(d) C ∩ D (h) A - B

14
 (a) A ∪ B

List all unique elements in A and B:

• A= {2,3,4,5}
• B= {4,5,6,7}

Combine the elements from both sets

• A∪B= {2,3,4,5,6,7}

b) A ∩ B
List all elements in A and B:

• A= {2,3,4,5}
• B= {4,5,6,7}

Identify the common elements:

• The common elements in both sets are 4 and 5.

Write the intersection of A and B

• A∩B= {4,5}

(c) B ∪ C
List all unique elements in B and C:

• B= {4,5,6,7}
• C= {6,7,8,9}

Combine the elements from both sets:

• B∪C= {4,5,6,7,8,9}

(d) C ∩ D

List all elements in C and D:

• C= {6,7,8,9}
• D= {8,9,10,11}

Identify the common elements:

• The common elements in both sets are 8 and 9

Write the intersection of C and D:

• C∩D= {8,9}

15
 e) (A ∪ B) ∪ C

Find the union of A and B:

• A∪B= {2,3,4,5,6,7}

Find the union of (A∪B) and C:

• (A∪B) ∪C= {2,3,4,5,6,7,8,9}

(f) A ∪ (B ∩ C)

Find the intersection of B and C:

• B∩C= {6,7}

Find the union of A and (B∩C):

• A= {2,3,4,5}
• B∩C= {6,7}
• A∪(B∩C) = {2,3,4,5,6,7}

(g) B ∪ (C ∪ D)

Find the union of C and D:

• C∪D= {6,7,8,9,10,11}

Find the union of B and (C∪D)

• B= {4,5,6,7}
• C∪D= {6,7,8,9,10,11}
• B∪(C∪D) = {4,5,6,7,8,9,10,11}

(h) A – B

List all elements in AAA:

• A= {2,3,4,5}

Identify and remove the elements that are also in BBB:

• The elements in A that are also in B are 4 and 5.

• Remove 4 and 5 from A.

Write the difference of A and B:

✓ A−B= {2,3}

16
Task 1.2
Given than A = {a, b, c, d}. Using the knowledge that you have in determining the
cardinality, write down the power set of A.

17
 1. Identify the number of elements in A:
o A has 4 elements.

2. Determine the number of subsets (cardinality of the power set):

o The power set of A will have 2^4 = 16 subsets.

3. List all subsets of A:

o The subsets can be grouped by the number of elements they contain:
▪ Subsets with 0 elements: {∅}
▪ Subsets with 1 element: {{a}, {b}, {c}, {d}}
▪ Subsets with 2 elements: {{a, b}, {a, c}, {a, d}, {b, c}, {b, d}, {c, d}}
▪ Subsets with 3 elements: {{a, b, c}, {a, b, d}, {a, c, d}, {b, c, d}}
▪ Subsets with 4 elements: {{a, b, c, d}}

Power Set of A:

P(A)={∅,{a},{b},{c},{d},{a,b},{a,c},{a,d},{b,c},{b,d},{c,d},{a,b,c},{a,b,d},{a,c,d},{b,c,d},{a,b,c,d}}

18
Task 1.3

Determine the inverse of following functions using appropriate mathematical techniques.

(i) f(x) = 3x – 5
(ii) g(x) = x3 – 7
(iii) h(x) = (x + 2)/(x-3)
(iv) i(x) = √ (x + 2)

19
To determine the inverse of each function, we follow a systematic process

✓ (f(x) = 3x - 5)

Step 1:
Write (y) instead of (f(x)):

[ y = 3x - 5]

Step 2: Solve for (x) in terms of (y):

[ y + 5 = 3x]

[ x = frac {y + 5}{3}]

Step 3: Replace (y) with () to write the inverse function:

[ f^ {-1} (x) = frac {x + 5}{3}]

✓ (ii) (x) = x^3 - 7)

Step 1: Write (y) instead of (g(x)):

[ y = x^3 - 7]

Step 2: Solve for (x) in terms of (y):

[ y + 7 = x^3]

[ x =sqrt [3] {y + 7}]

Step 3: Replace (y) with (x) to write the inverse function:

[ g^ {-1} (x) = sqrt [3] {x + 7}]

✓ (iii) (h(x) = frac {x + 2} {x - 3})

Step 1: Write (y) instead of (h(x)):

[ y =frac {x + 2} {x - 3}]

Step 2: Solve for (x) in terms of (y):

[ y (x - 3) = x + 2]

[ yx - 3y = x + 2]

[ yx - x = 3y + 2]

20
[ x (y - 1) = 3y + 2]

[ x =frac {3y + 2} {y - 1}]

Step 3: Replace (y) with (x) to write the inverse function:

[ h^ {-1} (x) = frac {3x + 2} {x - 1}]

✓ iv) (i(x) = sqrt {x + 2})

Step 1: Write (y) instead of (i(x)):

[ y = sqrt {x + 2}

Step 2: Solve for (x) in terms of (y):

[ y^2 = x + 2]

[ x = y^2 - 2]

Step 3: Replace (y) with (x) to write the inverse function:

[ i^ {-1} (x) = x^2 - 2]

21
Task 1.4

Prove the followings using the idea of set identity. Use the knowledge of Venn diagram.
Utilize the corresponding proof principles to prove properties in each.

(a) B ∪ (ø ∩ A) = B

(b) (A ′ ∩ U) ′ = A

(c) (C ∪ A) ∩ (B ∪ A) = A ∪ (B ∩ C)

(d) (A ∩ B) ∪ (A ∩ B ') = A

(e) A ∩ (A ∪ B) = A

22
(a) B ∪ (ø ∩ A) = B

Proof:

I choose x be any element at random.

Case 1: x ∈ B

By the definition of union, x ∈ B ∪ (ø ∩ A).

Case 2: x ∉ B

Since ø ∩ A = ø (the empty set), x ∉ (ø ∩ A).

Therefore, x ∉ B ∪ (ø ∩ A).

in both cases, x ∈ B ∪ (ø ∩ A) if and only if x ∈ B.

Hence, B ∪ (ø ∩ A) = B.

(b) (A′ ∩ U)′ = A

Proof:

I choose x be any element at random.

Case 1: x ∈ A

By the definition of complement, x ∉ A′.

By the definition of intersection, x ∉ (A′ ∩ U).

By the definition of complement again, x ∈ (A′ ∩ U)′.

Case 2: x ∉ A

By the definition of complement, x ∈ A′.

Since U is the universal set, x ∈ U.

By the definition of intersection, x ∈ (A′ ∩ U).

By the definition of complement again, x ∉ (A′ ∩ U)′

Thus, in both cases, x ∈ (A′ ∩ U)′ if and only if x ∈ A.

Hence, (A′ ∩ U) ′ = A.

23
(c) (C ∪ A) ∩ (B ∪ A) = A ∪ (B ∩ C)

Proof:

I choose x be any element at random.

Case 1: x ∈ A

By the definition of union, x ∈ (C ∪ A) and x ∈ (B ∪ A).

By the definition of intersection, x ∈ (C ∪ A) ∩ (B ∪ A).

Also, by the definition of union, x ∈ A ∪ (B ∩ C).

Case 2: x ∉ A and x ∈ B ∩ C

By the definition of intersection, x ∈ B and x ∈ C.

By the definition of union, x ∈ (C ∪ A) and x ∈ (B ∪ A).

By the definition of intersection, x ∈ (C ∪ A) ∩ (B ∪ A).

Also, by the definition of union, x ∈ A ∪ (B ∩ C).

Case 3: x ∉ A and x ∉ B ∩ C

By the definition of complement, x ∉ B or x ∉ C.

By the definition of union, x ∉ (C ∪ A) or x ∉ (B ∪ A).

By the definition of intersection, x ∉ (C ∪ A) ∩ (B ∪ A).

Also, by the definition of union, x ∉ A ∪ (B ∩ C).

Thus, in all cases, x ∈ (C ∪ A) ∩ (B ∪ A) if and only if x ∈ A ∪ (B ∩ C).

Hence, (C ∪ A) ∩ (B ∪ A) = A ∪ (B ∩ C).

24
(d) (A ∩ B) ∪ (A ∩ B′) = A

Proof:

I choose x be any element at random.

Case 1: x ∈ A

By the definition of intersection, x ∈ A ∩ B or x ∈ A ∩ B′.

By the definition of union, x ∈ (A ∩ B) ∪ (A ∩ B′).

Case 2: x ∉ A

By the definition of complement, x ∉ A ∩ B and x ∉ A ∩ B′.

By the definition of union, x ∉ (A ∩ B) ∪ (A ∩ B′).

Thus, in both cases, x ∈ (A ∩ B) ∪ (A ∩ B′) if and only if x ∈ A.

Hence, (A ∩ B) ∪ (A ∩ B′) = A.

(e) A ∩ (A ∪ B) = A

Proof:

I choose x be any element at random.

Case 1: x ∈ A

By the definition of union, x ∈ A ∪ B.

By the definition of intersection, x ∈ A ∩ (A ∪ B).

Case 2: x ∉ A

By the definition of complement, x ∉ A ∩ (A ∪ B)

Thus, in both cases, x ∈ A ∩ (A ∪ B) if and only if x ∈ A.

Hence, A ∩ (A ∪ B) = A.

25
26