# 17CS36 – Discrete Mathematics and its Applications Notes

## 18CS36 / 17CS36 – Discrete Mathematics and its Applications Notes

Download Discrete Mathematics and its Applications with subject code18CS36 notes for 3rd-semester computer science and engineering, VTU Belagavi.

### Module 1 – Introduction

Following are the contents of module 1 – Discrete Mathematics and its Applications

Mathematical induction, Proposition logic, Quantifiers, Laws of logic, Inference rules.

### Module 2 – Group Theory

Sample notes module 2 – Discrete Mathematics and its Applications

A finite or infinite set ‘S’ with a binary operation ‘0’ (Composition) is called semigroup if it holds the following two conditions simultaneously: Closure: For every pair (a, b) ∈ S, (a 0 b) has to be present in the set S.

### Module 3 – Relations

Following are the contents of module 3 – Discrete Mathematics and its Applications

Whenever sets we discussed, we need to understand the relation between the elements of sets. Relations may exist between elements of the same set or between elements of two or more sets.

### Module 4 – Probability and Addition Principle

Following are the contents of module 4 – Discrete Mathematics and its Applications

Probability is a closely related concept to counting. We often try to guess the results of games of chance, like card games, slot machines, and lotteries; i.e. we try to find the likelihood or probability that a particular result with being obtained.

### Module 5 – Graph and Graph Models

Following are the contents of module 5 – Discrete Mathematics and its Applications

The previous part brought forth different tools for reasoning, proofing, and problem-solving.