Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic – do not vary smoothly in this way, but have distinct, separated values.
Research in discrete mathematics increased in the latter half of the twentieth century partly due to the development of digital computers which operate in discrete steps and store data in discrete bits. Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in branches of computer science, such as computer algorithms, programming languages, cryptography, automated theorem proving, and software development. Conversely, computer implementations are significant in applying ideas from discrete mathematics to real-world problems, such as in operations research.
- To use appropriate set, function and relation models to understand practical examples, and
interpret the associated operations and terminologies in context.
- Determine number of logical possibilities of events.
- Learn logic and proof techniques to expand mathematical maturity.
- Formulate problems precisely, solve the problems, apply formal proof techniques, and
explain the reasoning clearly.
On completion of the course, student will be able to:
- Solve real world problems logically using appropriate set, function, and relation models
and interpret the associated operations and terminologies in context.
- Analyze and synthesize the real world problems using discrete mathematics.