Instructor:

Course Venue:
## Lecture Theatre LLT6B

CIT Block B

LLT6B

College of Computing and Information Sciences

Course Code:

MTH 3105

Course Credit Units:

3

Semester:

Semester 1

Year of Study:

Year 3

Undergraduate or Graduate Level:

Undergraduate Level

Academic Programs:

School:

Course Description & Objectives:

Discrete mathematics is sometimes called finite mathematics. It is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity. Most of the objects studied in finite mathematics are countable sets, such as the integers. Discrete mathematics has got many interesting applications to computer science. Concepts and notations from discrete mathematics are used to study or express objects or problems in computer algorithms and programming languages

Learning Outcomes:

Upon completion of this course, the student should be able to:

- determine the validity of a given argument;
- apply the concepts of set theory to problems which involve set operations, cardinality, and counting techniques;
- apply the concepts of number theory to problems involving arithmetic operations;
- apply the concepts of relations and functions to problems involving recursion, sequences and set equivalence;
- use the theory of graphs to solve problems in applied mathematics.