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 functis, 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.