Discrete mathematics

Day 03 Part 02- Discrete mathematics for cse-Total order relation and it’s graph representation.

Day 03Part 03-Discrete mathematics for gate-How to Convert Partial order Relations to hasse diagram.

Day 03Part 04- Discrete mathematics for computer science in hindi- Example on Hasse Diagram.

Day 03Part 05- Discrete mathematics for computer science – Finding Relation from Hasse Diagram.

Day 03Part 06-Discrete Mathematics in Hindi-Concept of maximal and minimal with maximum and minimum.

Day 03Part 07-Discretse mathematics for cse-Finding of maxiamal, minimal, maximum, minimum points.

Day 03Part 08-Discrete mathematics for gate- Concept of Least upper bound and greatest lower bound.

Day 03Part 09-CseIt- Cross structure failure case of greatest lower bound and least upper bound.

Day 03Part 10- Discrete mathematics – Introduction of Lattices and and it’s type in Very easy ways.

Day 03Part 11-Discrete Mathematics-Example on lattice How to find a hasse diagram is lattice or not