This book has been designed to deal with the topics which are indispensable in the advanced age of computer science. The first three chapters cover mathematical logic, sets, relations and function. Next come the chapters on ordered sets, Boolean albegra and switching circuits and matrices. Finally there are individual chapters on combinatorics, discrete numeric functions, generating functinos, recurrence relations, algebraic structures and graph theory; Graphs are binary trees. The purpose of this book is to present principles and concepts of discrete structures as relevant to student learning. The matter has been presented in as simple and lucid manner as possible and a large number of solved examples to understand the concept and principle of the theory have been introduced.

In this book, matrices and their algebra have been introduced from the beginning. So, the addition, multiplication, determinants, adjoint and inverse of matrices with concrete examples have been discussed properly. For advanced students, rank, vector spaces, with row and column spaces of matrices have been given in detail. Some new chapters on geometrical transformation, bilinear forms, quadratic forms, Hermitian forms and similar matrices are dealt with at specific length to give the book a self contained feel. Conceptual, theoretical as well as numerical problems have also been included. Many important problems have been solved and graded exercises are given at the end of each section. This book caters to the needs of undergraduate students of engineering, physics, computer graphics, economics, psychology and other branches.