Mathematical Foundations of Computer Science/Discrete Mathematics caters to all students of JNTU Kakinada and JNTU Anantapur who study the subject. Major topics including, but not limited to Set Theory, Relations, Functions, Algebraic Structures, Combinatorics and Number Theory have been explained in detail along with the examples which are based on the latest examinations of various institutions.

This book, in its Second Edition, provides the basic concepts and applications of discrete mathematics and graph theory. The book is aimed at undergraduate students of computer science and engineering, and information technology. It is also suitable for undergraduate and postgraduate students of computer science, mathematics and computer applications. The book exposes the students to fundamental knowledge in: - Mathematical logic, tautology and normal forms - Elementary set theory, functions and their relations - Algebraic structure, binary operation, group theory and homomorphism - Theory of permutations and combinations, binomial and multinomial theorems - Recurrence relations and methods of solving them - Graph theory, spanning tree, Eulerian and Hamiltonian circuits and isomorphism Key Features Includes a large number of worked-out problems for sound understanding of the concepts. Offers chapter-end exercises to test students’ comprehension of theory. Gives a quiz section at the end of each chapter to help students prepare for the competitive examinations. Incorporates short questions asked in universities’ examinations.

This book deals with those topics from mathematics that have proven to be particularly relevant in computer science. The particular topics are mostly of a set-theoretical nature: sets, relations and functions, partially ordered sets, induction, enumerability, and diagonalization. This book is organized by mathematical area, which means that material on the same computer science topic appears in more than one place. Readers will find useful applications in algorithms, databases, semantics of programming languages, formal languages, theory of computation, and program verification. There are few specific mathematical prerequisites for understanding the material in this volume, but it assumes the mathematical maturity gained from a good mathematics or computer science undergraduate major.