Book Description: Connecting Discrete Mathematics and Computer Science 2nd Edition provides an introduction to discrete mathematics and computer science that emphasizes connections between these two fields. The authors present a comprehensive overview of the fundamental concepts and techniques of discrete mathematics, including logic, graphs, combinatorics, and number theory, and show how they are used in computer science. The book covers topics such as algorithms, data structures, programming languages, and software engineering, and demonstrates how discrete mathematics can be applied to solve real-world problems. The book begins with an introduction to the history of computing and the role of discrete mathematics in its development, followed by an overview of the basic concepts and techniques of discrete mathematics, including sets, functions, and relations. It then delves into more advanced topics such as combinatorics, graph theory, and number theory, and shows how these concepts are used in computer science. The authors also discuss the importance of proof techniques and mathematical induction in solving problems in computer science. Throughout the book, the authors use numerous examples and exercises to illustrate the applications of discrete mathematics in computer science, and provide a variety of resources for further learning. They also include case studies on the application of discrete mathematics in computer science, such as cryptography, coding theory, and computational complexity.

''