Proposition || Proposition Logic || Statement || DMS || Discrete Mathematics | Fundamentals of logic

Connectives || Logical Connectives || Proposition Logic || Statement || DMS || Discrete Mathematics

Converse, Inverse, Contrapositive of Implication || Propositions || DMS || Discrete Mathematics

Truth Tables in Discrete Mathematics || DMS || Propositions || Statement

Tautology, Contradiction, Contingency in DMS || Discrete Mathematics || Proposition Logic |Statement

Well Formed Formula || WFF || DMS || MFCS || Propositional Logic || Discrete Mathematics

Equivalent Formulas || Laws of logic || Discrete Mathematics || DMS || with out using truth tables

Equivalence of Formulas || Logical Equivalence using Truth Tables || Propositional Logic ||DMS |MFCS

Logical Equivalence with out using truth table examples or equivalent formulas examples

Logical Equivalence with out using truth table examples or equivalent formulas examples

Logical Equivalence with out using Truth table || Examples || DMS || MFCS

Logical Equivalence with out using truth table examples or equivalent formulas || DMS || 3 examples

Equivalent Formulas and Logical Equivalence with out using Truth Table Solved examples || DMS ||MFCS

Duality Law || Principle of Duality || Discrete Mathematics || DMS || MFCS

Tautological Implication || Discrete Mathematics || DMS || MFCS

Conjunctive Normal Form || CNF|| 8 Solved Examples || Procedure to obtain CNF ||What is || DMS |MFCS

Disjunctive Normal Form || DNF|| 7 Solved Examples || Procedure to obtain DNF ||What is || DMS |MFCS

Principal Disjunctive Normal Form || PDNF|| 3 Solved Examples || Procedure to obtain PDNF | DMS|MFCS

Principal Conjunctive Normal Form || PCNF|| 2 Solved Examples || Procedure to obtain PCNF | DMS|MFCS

Rules of Inference || 8 Solved Examples || Rule P || Rule T || Rule CP || DMS || MFCS

INFERENCE THEORY || VALID CONCLUSION USING TRUTH TABLE || THEORY OF INFERENCE || DMS

Consistency and Inconsistency of Premises || DMS || MFCS || Discrete Mathematics

Indirect method of proof || Proof by Contradiction|| Inconsistency Premises || DMS || MFCS

Predicate Logic || Statement Function || Quantifiers || Universal || Existential || DMS || MFCS

Quantifiers in Predicate logic || Represent the Sentences(Statements) in Symbolic Form || DMGT ||DMS

Negation Of a Quantified Statement in Discrete Mathematics || 3 Examples || Predicate logic

Sets || Set Representation || Set Operations || power Set || finite || infinite || subset || proper

Introduction to Functions in DMS || Definition of Function || Examples of functions || MFCS

One To One Function || Injective Function || Discrete Mathematics || Types of Functions || MFCS

Onto Function || Surjective Function || Discrete Mathematics || MFCS || DMS || Types of Functions

Bijective Function || One to One and Onto || Discrete Mathematics || MFCS || Types of Functions

Many to One Function || Identity Function || Constant Function || Discrete Mathematics || MFCS

Types of Functions in Discrete Mathematics || One to One || Onto || Bijective || Constant ||Identity

Composite Functions || Function Composition || DMS || MFCS || GATE || Discrete Mathematics

Composite Functions || Function Composition || 4 Examples || DMGT || DMS || MFCS || DM

Inverse of function in Discrete Mathematical Structures || DMS || GATE Lecture || MFCS

Introduction to Relations in Discrete Mathematics || Definition || Examples || DMS || MFCS

Reflexive Relation || Irreflexive || Discrete Mathematics ||DMS || MFCS ||GATE||Types of Relations

Symmetric Relation || Anti Symmetric Relation || Types of Relations || DMS || MFCS || GATE

Transitive Relation || Types of Relations || DMS || MFCS || GATE || Discrete

Types of Relations || Reflexive || Irreflexive || Symmetric || Anti Symmetric || Transitive ||DMS

Representation of Relations || Relational Matrix || Digraph Representation ||Discrete Mathematics

Equivalence Relation in Discrete Mathematics || DMS || MFCS || GATE || Examples

Compatibility Relation in Discrete Mathematics || DMS || MFCS || GATE || Examples

Partial Order relation in discrete mathematics || Partial Order Set || POSET || DMS || MFCS || GATE

Transitive Closure of a Relation in Discrete Mathematics || DMS || MFCS || GATE || Examples

Operations on Relations in Discrete Mathematics || DMS || MFCS || GATE || Examples

Graph Terminologies ||Basic concepts of Graphs || Discrete Mathematics || DMS || MFCS | DS

Isomorphic Graphs || Example 1 || Isomorphism in Graph Theory || Discrete Mathematics || DMS ||MFCS

Isomorphic Graphs || Example 2 || Isomorphism in Graph Theory || Discrete Mathematics || DMS ||MFCS

Degree of a vertex for Directed Graph and undirected Graph || Indegree of a vertex || Outdegree |DMS

Graph Traversals - Breadth First Search|BFS

Graph traversal - Depth first search|DFS

what is minimum cost spanning tree

Prim's Algorithm for Minimum Cost Spanning Tree

Kruskal’s Algorithm for Minimum Cost Spanning Tree

Planar Graph || Non Planar Graph || 3 Solved Examples || DMS || MFCS || Discrete Mathematics || Gate

Euler's Formula || Euler's Theorem || 2 Solved Examples || DMS || Discrete Mathematics || GATE

Graph Coloring in Discrete Mathematics || 6 Solved Examples || DMS || GATE || Graph Theory

Graph Coloring and Chromatic Number of a Graph in Discrete Mathematics || Graph Theory || DMS ||GATE

Euler Graph || Euler Path || Euler Circuit || Eulerian Graph || Discrete Mathematics || DMS || GATE

Hamiltonian Graph || Hamiltonian Circuit || Hamiltonian Path || Discrete Mathematics || DMS || GATE

Matrix Representation of Graphs in Discrete Mathematics || Adjacency Matrix || Incidence Matrix |DMS

Introduction to Recurrence Relations || Definition || Example || Fibonacci Sequence || DMS || MFCS

First Order linear Homogeneous Recurrence Relations || 2 Solved Examples || DMS || MFCS || GATE

Second Order Homogeneous Recurrence Relations || 4 Solved Examples ||case 1||case 2 ||case 3|| DMS

Third Order Homogeneous Recurrence Relations || 3 Solved Examples ||case 1||case 2 ||case 3|| DMS

Find the Sequence of Generating Functions || Recurrence Relations || Discrete Mathematics || DMS

Find Generating Function for the Sequence || Recurrence Relations || Discrete Mathematics || DMS

Find the Coefficient of Generating Function || Recurrence Relations || Discrete Mathematics || DMS

General Properties of Algebraic System || Properties of Binary Operations || Discrete Mathematics

Semi Group in Algebraic Systems || Discrete Mathematics Structures

Monoid in Algebraic Systems || Discrete Mathematics Structures

Abelian Group in DMS || 2 Solved Examples || Discrete Mathematics || Algebraic Systems or Structures

Group in Algebraic Systems with 2 examples |Show that set of all non zero real numbers is group| DMS

Sub Group in Algebraic System |Group G={1,-1,i,-i } check sub group{1,-1} is present in Group or not

Lagrange's Theorem with an example || Algebraic Systems || DMS || Discrete Mathematical Structures

Homomorphism in Group Theory with an Example || Algebraic Systems || DMS || Discrete Mathematics

Chromatic number of a Graph in Discrete Mathematics || 5 Solved Examples || DMS || GATE

Semi Group Homomorphism in Discrete Mathematics || Group Theory || Algebraic Systems || DMS || MFCS

Pigeonhole Principle With 3 Solved Examples || Combinatorics || Discrete mathematics || DMS || MFCS

Principle of Inclusion and Exclusion with an Example || Combinatorics || Discrete Mathematics || DMS

Basics of Computing || Sum rule || Product Rule || Combinatorics || Discrete Mathematics || DMS

Inference Rules For Predicate Logic | Rules of Inference for Quantified Statements | DMS |3 Examples

Types of graphs in discrete mathematics | Regular | Cyclic | Complete | Bipartite|Complete Bipartite

Planar Graph Examples | K2,3 | K3,3 | K5 | A graph of oder 5 and size 8 | Order 6 & size 12 | DMS

Show that Ǝx(P(x) ʌ Q(x)) = (Ǝx) (P(x)) ʌ (Ǝx) ( Q(x)) | Logical Equivalences Involving Predicates

Show that ∀x(P(x) v Q(x)) = (∀x) (P(x)) v (Ǝx) ( Q(x)) || Logical Equivalences Involving Predicates