Author Description

An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems. Based on their teaching experiences, the authors offer an accessible text that emphasizes the fundamentals of discrete mathematics and its advanced topics. This text shows how to express precise ideas in clear mathematical language. Students discover the importance of discrete mathematics in describing computer science structures and problem solving. They also learn how mastering discrete mathematics will help them develop important reasoning skills that will continue to be useful throughout their careers. Includes a free Student Solutions Manual on the CD-ROM packaged with the text. Develops mathematical maturity and guides students in learning how to express mathematically precise ideas in the language of mathematics. Discusses applications such as relational database systems, the complexity of a computation, and normal forms of propositions. Builds on a strong, focused development of fundamental ideas about sets, logic, relations, and functions as well as graph theory and combinatorics. Presents algorithms in pseudocode to reinforce the applications of discrete structures. The book is flexible with most of the algorithm material being optional. Provides a wealth of exercises throughout each chapter to give students ample opportunity to master the material. Table Of SETS, PROOF TEMPLATES, AND INDUCTION. Basic Definitions. Exercises. Operations on Sets. Exercises. The Principle of Inclusion-Exclusion. Exercises. Mathematical Induction. Program Correctne