Unit Code: MTH511

Unit Name: Discrete Mathematics

Description: This Unit covers the mathematical topics most directly related to computer science and mathematics. Topics includes: logic, proofs, relations, sets and functions, algorithms and complexity, integers, Boolean algebra, mathematical induction and recursion and counting. Emphasis will be placed on providing a context for the application of the mathematics within computer science. The objective is intended for students to understand the basic theory and some applications of discrete mathematics. The unit gives students training in the ability to think quantitatively and analyse problems critically.

Learning Target Outcomes: As a result of successfully completing this unit the student will be able to: 1. Convey elementary mathematical arguments and identify fallacious reasoning (not just fallacious conclusions). 2. Analyse operations on and algorithms involving integers. 3. Discuss the fundamentals of Boolean algebra. 4. Apply proof methods to prove properties of sets and relations. 5. Discuss methods of counting permutations and combinations of set elements. 6. Design and assess Boolean functions. 7. Discuss the role of discrete mathematics in applications in computer science.

Prerequisite: The student must have passed Year 13 or Equivalent

Prerequisite Sentence: Pass Form 7 or Foundation Mathematics or equivalent

Credit Point: 15

Offered In: Semester 2