This book explains the basic principles of discrete mathematics and structures in a clear systematic manner. A contemporary approach is adopted throughout.

The book is divided in five sections. The first section discusses set theory, relations and functions, probability and counting techniques; the second section covers recurrence relations and propositional logic; the third section is related to lattices and boolean algebra; the fourth section covers the study of graph and trees; the last section is about algebraic structures and finite state machines.

Suitable examples, illustrations and exercises are included throughout to enable greater understanding of the subject. This book can serve as a comprehensive text for students of computer science and engineering, computer applications and information technologies.