Complete Discrete Maths with F

Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics and computer science. It is a very good tool for improving reasoning and problem-solving capabilities. This tutorial explains 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.

Audience

This tutorial has been prepared for students pursuing a degree in any field of computer science and mathematics. It endeavors to help students grasp the essential concepts of discrete mathematics.

Prerequisites

This tutorial has an ample amount of both theory and mathematics. The readers are expected to have a reasonably good understanding of elementary algebra and arithmetic.

Chapters that are included are :

Home

Introduction

Sets, Relations, & Functions

Sets

Relations

Functions

Mathematical Logic

Propositional Logic

Predicate Logic

Rules of Inference

Group Theory

Operators & Postulates

Group Theory

Counting & Probability

Counting Theory

Probability

Mathematical & Recurrence

Mathematical Induction

Recurrence Relation

Discrete Structures

Graph & Graph Models

More on Graphs

Introduction to Trees

Spanning Trees

Boolean Algebra

Boolean Expressions & Functions

Simplification of Boolean Functions