| CODE | CSA5015 | |||||||||
| TITLE | Fundamentals of Discrete Mathematics | |||||||||
| UM LEVEL | 05 - Postgraduate Modular Diploma or Degree Course | |||||||||
| MQF LEVEL | Not Applicable | |||||||||
| ECTS CREDITS | 6 | |||||||||
| DEPARTMENT | Computer Science | |||||||||
| DESCRIPTION | The study-unit is primarily aimed to introduce the basic mathematical tools that are required for the formal and rigorous treatment of the various aspects of computing. The importance of formal reasoning is emphasised in the unit, concentrating on syntax, and formal proofs. Syllabus: • Propositional Calculus; • Predicate Calculus; • Set theory; • Relations and Functions; • Natural Numbers and cardinality; • Group theory; • Graph theory. This unit is also intended to introduce the concept of logic as a tool for studying the validity of arguments. Topics include an introduction to: • Predicate and propositional logic. • Logical equivalence and satisfiability. • The syntax of First Order Logic. • Axioms and inference rules. • Proof systems and techniques. • Set theory; • Principle of Induction; • Natural Numbers:; • Cardinality; • Structured Types. Textbooks: • Andrew Simpson, Discrete Mathematics by example, McGraw-Hill. |
|||||||||
| STUDY-UNIT TYPE | Lecture | |||||||||
| METHOD OF ASSESSMENT |
|
|||||||||
| LECTURER/S | Christian Colombo Gordon J. Pace (Co-ord.) |
|||||||||
|
The University makes every effort to ensure that the published Courses Plans, Programmes of Study and Study-Unit information are complete and up-to-date at the time of publication. The University reserves the right to make changes in case errors are detected after publication.
The availability of optional units may be subject to timetabling constraints. Units not attracting a sufficient number of registrations may be withdrawn without notice. It should be noted that all the information in the description above applies to study-units available during the academic year 2023/4. It may be subject to change in subsequent years. |
||||||||||