Now in its second edition, this text provides an exhaustive presentation of the fundamental concepts of discrete mathematical structures and their applications in computer science and mathematics. It aims to develop the ability of the students to apply mathematical thought in order to solve computation-related problems.

The introductory chapter presents an overview of the foundations of the subject, including topics such as logic, set theory, relations, functions, algebraic structures, and graphs. The subsequent chapters provide detailed coverage of each of these topics, as well as major areas of discrete mathematics, such as combinatorics, lattices and Boolean algebras. Major applications such as computer models and computation, coding theory, cryptography and databases are dealt with in the final chapters. In addition, a new chapter on matrices has been included.

The book includes features to help build a firm foundation in the principles of the subject and to provide adequate scope for testing comprehension. Each chapter contains numerous worked-out examples. There are several chapter-end Supplementary Examples for revision. The Self-Test and Exercises at the end of each chapter provide objective type questions and problems respectively. Answers to objective type questions and hints to exercises are also provided.

The book is intended undergraduate and postgraduate students of mathematics and also for students of computer science and engineering, and computer applications.