Foundations of Discrete Mathematics with Algorithms and Programming is written in a reader-friendly manner and provides a comprehensive, coherent and structured course on the subject matter. The topics covered are: sets, relations and functions, combinatorics, basics of number theory, introduction to algorithms and data structures, introduction to graph theory, and introduction to logic and probability. Many illustrative examples are provided to enhance the understanding of the concepts. The aim of this book is to bring together the fundamentals of discrete mathematics with algorithms and programming for the benefit of the student community. Highlights include: Topics are introduced with suitable examples, Worked out examples are prevalent throughout, Solutions are provided for all even-numbered exercises, Algorithms are expressed in both formal and informal languages, Greater flexibility in choosing topics as the book can be used for instructor courses in combinatorics, graph theory and data structures and algorithms, A solid foundation in the topics mentioned above are presented, The book is best suited for undergraduates as well as beginning graduates in the disciplines of mathematics, computer science and engineering. Book jacket.