Mathematical Foundation of Computer Science

The interesting feature of this book is its organization and structure. That consists of systematizing of the definitions, methods, and results that something resembling a theory. Simplicity, clarity, and precision of mathematical language makes theoretical topics more appealing to the readers who are of mathematical or non-mathematical background. For quick references and immediate attentions ? concepts and definitions, methods and theorems, and key notes are presented through highlighted points from beginning to end. Whenever, necessary and probable a visual approach of presentation is used. The amalgamation of text and figures make mathematical rigors easier to understand. Each chapter begins with the detailed contents, which are discussed inside the chapter and conclude with a summary of the material covered in the chapter. Summary provides a brief overview of all the topics covered in the chapter. To demonstrate the principles better, the applicability of the concepts discussed in each topic are illustrated by several examples followed by the practice sets or exercises. About the author: y.n. Singh is senior faculty of computer science & engineering at the institute of engineering & technology, lucknow. He taught over 4 years at various universities viz. Kanpur university, agra university before joining the faculty of institute of engineering & technology where he is serving from last 6 years. He teaches and conducts research in the areas of theory of computation, design and analysis of algorithm, artificial intelligence and genetics algorithm. Table of contents: discrete theory, relations and functions discrete numeric functio