Scribd
Upload
116 views4 pages

Unit 18

This 15-credit unit introduces discrete mathematics concepts that underpin software engineering. It covers topics like set theory, functions, graph theory, Boolean algebra, and abstract algebra. Students will learn about sets and functions, graph structures, binary problems modeled with truth tables and Boolean equations, and algebraic structures like groups. The goal is for students to develop logical thinking and problem-solving skills relevant to understanding software engineering concepts.

Uploaded by

Ayush Maharjan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
116 views4 pages

Unit 18

This 15-credit unit introduces discrete mathematics concepts that underpin software engineering. It covers topics like set theory, functions, graph theory, Boolean algebra, and abstract algebra. Students will learn about sets and functions, graph structures, binary problems modeled with truth tables and Boolean equations, and algebraic structures like groups. The goal is for students to develop logical thinking and problem-solving skills relevant to understanding software engineering concepts.

Uploaded by

Ayush Maharjan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Unit 18: Discrete Maths

Unit code Y/615/1648


Unit level 5
Credit value 15

Introduction

Digital computer technologies operate with distinct steps, and data is stored within
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 computer science
courses and ultimately aids 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
tasked-based assessments students will explore set theory and functions within a
variety of scenarios; perform analysis using graph theory; apply Boolean algebra to
applicable scenarios; and finally explore additional concepts within 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 be able to gain confidence with
the
relevant discrete mathematics needed to successfully understand software
engineering concepts. As a result they will develop 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.

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, surjective and transitive functions.

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

You might also like