This book addresses a full spectrum of discrete mathematics concepts used in computer science. The book provides an introduction to the building blocks of discrete mathematics, including sets, relations, and presents the essentials of algebra; explains fundamentals of automata theory, matrices; reviews the history of logic, discussing propositional logic. Each of these concepts is presented in detail, since these concepts are basis of computer science and this book begins with a presentation of the rules of logic as used in mathematics where many examples of formal and informal proofs are given.
The focus of the book is on concept, the ―Why, ―What” and ―How ―of the operations. The authors recommend that these concepts should be introduced to Computer Science early in their course curriculum, so that they learn to use mathematical concepts to develop their skills.
To facilitate easy understanding, the texts and problems have been put in simpler form. Unnecessary details have been avoided as far as possible, but at the same time treatment of the subject has been made rigorous and up to date. This will certainly help to readers to understand the subject in better way.