Skip to main content

Unit information: Discrete Mathematics in 2021/22

Please note: It is possible that the information shown for future academic years may change due to developments in the relevant academic field. Optional unit availability varies depending on both staffing, student choice and timetabling constraints.

Unit name Discrete Mathematics
Unit code EMAT10704
Credit points 20
Level of study C/4
Teaching block(s) Teaching Block 4 (weeks 1-24)
Unit director Miss. Lee
Open unit status Not open
Pre-requisites

A-level mathematics or equivalent.

Co-requisites

None

School/department Department of Engineering Mathematics
Faculty Faculty of Engineering

Description

Discrete mathematics is the mathematical study of discrete objects, that is, sets of distinct elements. It is used whenever objects are counted, or relationships between finite sets of objects are studied, or when processes involving a finite number of steps are analysed. Discrete mathematics underlies almost all present day information processing systems, and a thorough knowledge of the subject is necessary to appreciate the capabilities and limitations of computers.

EMAT10704 will cover foundation level material in discrete mathematics including: number systems and arithmetic, logic and proof, sets, relations and functions. It will then move on to provide a background into more advanced topics in discrete mathematics, including graph theory, and the link between continuous and discrete mathematics.

The unit aims to provide a foundational level background in discrete mathematics.

Intended learning outcomes

The unit will provide students with:

  1. a basic understanding of topics in discrete mathematics, and
  2. their application to real-world problems

Teaching details

Teaching will be delivered through a combination of synchronous and asynchronous sessions, including lectures, supported by live online sessions, problem sheets and self-directed exercises. The unit will be supported by weekly workshops, which will provide blended learning involving class discussion, problem solving, and/or group presentations. Students will be expected to actively participate in the workshops, and engage with readings, self-directed exercises, and problem-solving activities

Assessment Details

The unit is assessed by 100% coursework, as follows:

6 x worksheets (10% each)

1 x worksheet (40%)

Worksheets will assess all ILOs.

Reading and References

  • Introductory Logic and Sets for Computer Science, Nimal Nissanke (ISBN:0-201-17957-1)

Main recommendation:

  • Graphs and Applications: An Introductory Approach, J M Aldous and R J Wilson Springer, 2000, ISBN:185233259X

Supplementary recommendation:

  • Introduction to Graph Theory (4th Edition), R J Wilson Prentice Hall, 1996, ISBN:0582249937

Feedback