Home » B.Tech / MCA » Discrete Mathematics Tutorial
Category:

# Discrete Mathematics Tutorial

• ## Sampling and Inference

Sampling and Inference A sample is defined as a method of selecting a small section from a population or large data. The…

• ## Graph isomorphism in Discrete Mathematics

Graph isomorphism in Discrete Mathematics The isomorphism graph can be described as a graph in which a single graph can have more…

• ## Probable error formula for discrete mathematics

Probable error formula for discrete mathematics Probable Error The probable error can be described as a correlation coefficient. The value of the…

• ## Rolle’s Mean Value Theorem

Rolle’s Mean Value Theorem Roll’s theorem is a special case of the mean value theorem. Rolle’s theorem states that if a f…

• ## Discrete Mathematics Karnaugh Maps

Karnaugh Maps: A Karnaugh map is a planar area subdivided into 2n equal cells each representing a point for functions of n…

• ## Permutations and Combinations

Permutation and Combinations: Permutation: Any arrangement of a set of n objects in a given order is called Permutation of Object. Any…

• ## Tautology in Discrete Mathematics

Tautology in Discrete Mathematics A tautology is a compound statement that will always be true for every value of individual statements. A…

• ## Identity Functions

Identity Functions The function f is called the identity function if each element of set A has an image on itself i.e.…

• ## Planar and Non-Planar Graphs

Planar Graph: A graph is said to be planar if it can be drawn in a plane so that no edge cross.…

• ## Quantifiers in Discrete Mathematics

Quantifiers Quantifier is used to quantify the variable of predicates. It contains a formula, which is a type of statement whose truth…