This document introduces discrete mathematics. Discrete mathematics develops mathematical thinking and problem solving abilities, and is particularly relevant for computer science students. It involves the study of discrete, distinct objects rather than continuous ones. Topics covered in discrete mathematics include set theory, relations, functions, logic, orders, combinations, graph theory, and finite state automation. Discrete mathematics can be used to solve problems involving sorting lists, finding shortest paths, combinations, and encrypting messages.

1. INTRODUCTION TO DISCRETE MATHEMATICS

2. WHY STUDY DISCRETE MATHEMATICS?
 It develops your mathematical thinking.
 Improves your problem solving ability.
 If you are computer science student, then no need to go anywhere else because discrete mathematics is
for you.
 Many problems can be solve using discrete mathematics:

3. FOR EXAMPLE
 Sorting list of integers
 Finding shortest path from your home to your friend’s home
 How many different combinations are possible with just 8 alphanumeric characters
 Encrypt a message and deliver it to your friend and you don’t want anybody to read that message
except your friend

4. FOR EXAMPLE
 Drawing a graph with two condition:
 You are not allowed to lift your pen.
 You are not allowed to repeat edges

5. WHAT IS DISCRETE MATHEMATICS?
 Discrete Mathematics is the study of discrete objects.
 Discrete means: distinct or not connected
 It is not a branch of Mathematics. It is rather a description of set of branches that have one common
property- that they are “discrete” and not “continuous”.

6. DISCRETE VS CONTINUOUS
 The whole world of Mathematics is divided in two realms
 Discrete
 Continuous

7. TOPICS TO BE COVERED
 Set Theory
 Relations
 Functions
 Propositional Logic and First Order Logic
 Partial Orders and Lattices
 Combinations
 Graph Theory
 Finite State Automation