x

# Discrete Mathematical Structures

IIT Madras, , Prof. Kamala Krithivasan

Updated On 02 Feb, 19

##### Overview

What is Discrete Mathematics - Propositional Logic - Predicates & Quantifiers - Logical Inference - Resolution Principles & Application to PROLOG - Methods of Proof- Normal Forms - Proving programs correct - Sets - Induction - Set Operations on Strings Over an Alphabet - Relations - Graphs - Trees - Special Properties of Relations - Closure of Relations - Order and Relations and Equivalence Relations: Equivalence relations and partitions - Functions - Pigeon hole Principle - Permutations and combinations - Generating Functions- Recurrence Relations - Algebras - Finite State Automaton - Lattices

## Lecture 27: Pigeonhole Principle

4.1 ( 11 )

###### Lecture Details

Discrete Mathematical Structures

#### 4.0

2 Ratings
55%
30%
10%
3%
2%

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Dembe

Great course. Thank you very much.