Mathematical Structures for Computer Science. A Modern Treatment of Discrete Mathematics (6^th Ed.)

he new edition of Mathematical Structures for Computer Science continues to offer a pedagogically rich and intuitive introduction to discrete mathematics structures. It meets the needs of computer science majors by being both comprehensive and accessible. Relevant applications are balanced alongside clear presentation of concepts to help students better understand this text, which has been popular amongst professors and their classes for almost twenty-five years.

Formal Logic. Proofs, Recursion, and Analysis of Algorithms. Sets, Combinatorics, and Probability. Relations, Functions, and Matrices. Graphs and Trees. Graph Algorithms. Boolean Algebra and Computer Logic. Modeling Arithmetic, Computation, and Languages. Appendix A Summation Notation. Appendix B The Logarithm Function. Answers to Practice Problems. Answers to Selected Exercises. Answers to Self Tests. Index.