Unit 18 Discrete Maths (F/618/7429) Assignment Brief 2026 | Pearson

Unit 18 Discrete Maths Assignment Brief

Introduction

Digital computer technologies operate with distinct steps and data is stored as separate bits. This method of finite operation is known as ‘discrete’, and the division of mathematics that describes computer science concepts such as software development, programming languages and cryptography is known as ‘discrete mathematics’. This branch of mathematics is a major part of a computer science course and aids, ultimately, in the development of logical thinking and reasoning that lies at the core of all digital technology.

This unit introduces students to the discrete mathematical principles and theory that underpin software engineering. Through a series of case studies, scenarios and taskbased assessments, students will explore set theory and functions in a variety of scenarios, perform analysis using graph theory, apply Boolean algebra to applicable scenarios and, finally, explore additional concepts in abstract algebra.

Among the topics included in this unit are set theory and functions, Eulerian and Hamiltonian graphs, binary problems, Boolean equations, algebraic structures and group theory.

On successful completion of this unit, students will have gained confidence in the discrete mathematics that is needed to understand software engineering concepts. As a result, they will have developed skills such as communication literacy, critical thinking, analysis, reasoning and interpretation, which are crucial for gaining employment and developing academic competence.

Learning Outcomes

By the end of this unit students will be able to:

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.

Essential Content

LO1 Examine set theory and functions applicable to software engineering

Set theory:

Sets and set operations. Algebra within set theory.

Set identities and proof of identities. Bags manipulation functions.

Functions:

Domain, range and mappings.

Inverse relations and the inverse function. Injective and surjective functions, and transitive relations

LO2 Analyse mathematical structures of objects using graph theory

Graph theory:

Structure and characterisation of graphs. Spanning trees and rooted trees.

Eulerian and Hamiltonian graphs. Vertex and edge colourings of graphs.

Directed graphs:

Directed and undirected graphs.

Walks, trails, paths and shortest paths.

LO3 Investigate solutions to problem situations using the application of Boolean algebra

Boolean algebra:

Binary states (e.g. on/off; 1/0; open/closed; high/low).

Identification of binary problems and labelling inputs and outputs. Production of a truth table corresponding to a problem situation.

Equations:

Express a truth table as a Boolean equation.

Simplify a Boolean equation using algebraic methods. Represent a Boolean equation using logic gates.

LO4 Explore applicable concepts within abstract algebra

Algebraic structures:

Binary operations and associated properties. Commutative and associative operations.

Algebraic structures and substructures.

Groups:

Introduction to groups, semigroups and monoids. Families of groups and group codes.

Substructures and morphisms.

Learning Outcomes and Assessment Criteria

Recommended Resources

Textbooks

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.

Journals

Journal of Graph Theory. Wiley.

Journal of Mathematical Modelling and Algorithms in Operations Research. Springer.

Links

This unit links to the following related units:

Unit 14: Maths for Computing

Unit 33: Applied Analytical Models.

Answer

Request Answer of this Assignment