Discrete Mathematics is the backbone of Computer Science.
Discrete mathematics is the mathematical language of computer science. Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in all branches of computer science, such as computer algorithms, programming languages, cryptography, automated theorem proving, and software development. Conversely, computer implementations are tremendously significant in applying ideas from discrete mathematics to real-world applications, such as in operations research.

Course Objectives: The course aims:

1. Cultivate clear thinking and creative problem solving
2. Thoroughly train in the construction and understanding of mathematical proofs. Exercise common mathematical arguments and proof strategies
3. To apply graph theory in solving practical problems
4. Thoroughly prepare for the mathematical aspects of other Computer Engineering courses

Course Outcomes:

1. On successful completion, of course, learner/student will be able to: Understand the notion of mathematical thinking, mathematical proofs and to apply them in problem solving
2. Ability to reason logically
3. Ability to understand relations, functions, Diagraph and Lattice
4. Ability to understand and apply concepts of graph theory in solving real world problems
5. Understand use of groups and codes in Encoding-Decoding
6. Analyse a complex computing problem and apply principles of discrete mathematics to identify solutions

Pre-requisite of this course: Basic Mathematics