Unit information: Discrete Mathematics in 2011/12

Please note: you are viewing unit and programme information for a past academic year. Please see the current academic year for up to date information.

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 Professor. Lawry
Open unit status Not open
Pre-requisites

None
Co-requisites

None
School/department School of Engineering Mathematics and Technology
Faculty Faculty of Science and Engineering

Description including Unit Aims

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 through knowledge of the subject is necessary to appreciate the capabilities and limitations of computers.

Aims:

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 Information

Lectures & examples classes

Assessment Information

  • 2 x in-class tests: 10% each (learning outcome 1)
  • Examination (3 hours): 80% (all learning outcomes)

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

Related links