Contents: Preface. Acknowledgments. I. 1. Sets. 2. Relations and functions. 3. Techniques of counting. 4. Partial ordering relations. 5. Discrete probability. II. 6. Recurrence relations. 7. Logic. III. 8. Lattices. 9. Boolean algebra. IV.10. Graph Theory. 11. Trees. V. 12. Algebraic system. 13. Finite state machine. Index.

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

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

Suitable examples, illustrations and exercises are included throughout the book to facilitate an easier understanding of the subject. The book would serve as a comprehensive text for students of computer science and engineering, computer applications and information technologies."