Theory, Practice and Techniques in Discrete Mathematics

Discrete mathematics deals with objects that can assume only distinct, separated values. The study of how discrete objects conglomerate 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 congruence’s 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.

“Theory, Practice and Techniques in Discrete Mathematics” explains the fundamental concepts of Sets, Relations and Functions, Mathematical Logic, Group theory, and combinatorics. It studies discrete objects and the relationships that bind them, including algorithms, their implementations, and efficiencies. It presents a wide variety of interesting and important applications in discrete mathematics, grouped in individual chapters for thorough treatment of each application. This book covers a wide-ranging introduction to discrete mathematics and is highly recommended to every student of mathematics and computer science. Specific key notes, learning objectives, comprehensive indicative content, tables, and illustrations together with the topic areas are also presented.