Discrete Mathematics Tutorial: Home

 Discrete Mathematics Tutorial: Home


Discrete Mathematics

Discrete mathematics Tutorial provides basic and advanced concepts of Discrete mathematics. Our Discrete mathematics Structure Tutorial is designed for beginners and professionals both. 

Discrete mathematics is the branch of mathematics dealing with objects that can consider only distinct, separated values. This tutorial includes the fundamental concepts of Sets, Relations and Functions, Mathematical Logic, Group theory, Counting Theory, Probability, Mathematical Induction, and Recurrence Relations, Graph Theory, Trees and Boolean algebra.

{tocify} $title= {Table of Contents}

               

                                     Discrete Mathematics Tutorial: Index

·         Discrete Mathematics Tutorial 

 Sets Theory
  •        Introduction of Sets
  •        Types of Sets
  •        Sets Operations
  •        Algebra of Sets
  •        Multisets
  •        Inclusion-Exclusion Principle
  •        Mathematical Induction
  Relations
  •         Binary Relation
  •         Representation of Relations
  •         Composition of Relations
  •         Types of Relations
  •         Closure Properties of Relations
  •         Equivalence Relations
  •         Partial Ordering Relations
Functions & Algorithms
  •     Functions
  •       Types of Functions
  •        Identity Functions
  •        Composition of Functions
  •        Mathematical Functions
  •        Algorithms & Functions
Logic & Propositional 
  •      Propositions & Compound Statements 
  •    Basic Logical Operations
  •      Conditional & Biconditional Statements 
  •      Tautologies & Contradictions
  •      Predicate Logic
  •      Normal Forms
   Counting Techniques
  •        Basic Counting Principles
  •       Permutations & Combinations
  •       Pigeonhole Principle
    Recurrence Relations
  •        Recurrence Relations
  •        Linear Recurrence Relations with Constant Coefficients             
  •        Particular Solution
  •       Total Solution
  •       Generating Functions
  Probability Theory
  •        Probability
  •        Addition Theorem
  •        Multiplication Theorem
  •        Conditional Probability
  Graph Theory

  •         Introduction of Graphs
  •        Types of Graphs
  •         Representation of Graphs
  •         Isomorphic and Homeomorphic Graphs 
  •      Regular and Bipartite Graphs
  •         Planar and Non-Planar Graphs
  •        Dijkstra's Algorithm
  •        Travelling Salesman Problem

Binary Trees

  •          Introduction of Trees
  •          Binary Trees
  •          Traversing Binary Trees
  •          Binary Search Trees
  •          Minimum Spanning Tree
   Operator & Postulates
  •      Binary Operation
  •      Property of Binary Operations
   Group Theory

  •          SemiGroup
  •          Group
  •          SubGroup
  •          Normal Subgroup
  Ordered Sets & Lattices

  •        Partially Ordered Sets
  •  Hasse Diagrams
  • Lattices
 Boolean Algebra
  •     Boolean Algebra
  •     Boolean Expression
  •       Canonical Forms
  •       Logic Gates & Circuits
  •       Karnaugh Maps

More about Discrete Mathematics

Prerequisite

Before learning Discrete Mathematics Tutorial (DMS Tutorial), you must have the basic knowledge of Elementary Algebra and Mathematics.

Audience

Our DMS Tutorial is designed to help beginners and professionals. This tutorial has been making for students pursuing a degree in any field of computer science and mathematics. It endeavors to help students grasp the fundamental concepts of discrete mathematics.

Problems

We assure that you will not find any problem in this Discrete Mathematics (DMS Tutorial). 


Post a Comment (0)
Previous Post Next Post