A Beginners Guide to Discrete Mathematics

Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term “discrete mathematics” is therefore used in contrast with “continuous mathematics,” which is the branch of mathematics dealing with objects that can vary smoothly. Whereas discrete objects can often be characterized by integers, continuous objects require real numbers. The study of how discrete objects combine with one another and the probabilities of various outcomes is known as combinatorics. Other fields of mathematics that are considered to be part of discrete mathematics include graph theory and the theory of computation. Topics in number theory such as congruences and recurrence relations are also considered part of discrete mathematics. The study of topics in discrete mathematics usually includes the study of algorithms, their implementations, and efficiencies. Discrete mathematics is the mathematical language of computer science, and as such, its importance has increased dramatically in recent decades. Discrete Mathematics is designed as a textbook for undergraduate engineering students of computer science and postgraduate students of computer applications. The book seeks to introduce students to the mathematical concepts needed to develop logical reasoning, abstract thinking, and problem solving—important prerequisites for the study of computer science. This introduction to discrete mathematics is aimed primarily at undergraduates in mathematics and computer science at the freshmen and sophomore levels. The idea is to provide all relevant and up-to-date information at one place so that readers of the book can have an idea about “Discrete Mathematics.