Discrete Mathematics for Computing

This book is a concise introduction to the key mathematical ideas that underpin computer science, continually stressing the application of discrete mathematics to computing.  It is suitable for students with little or no knowledge of mathematics, and covers the key concepts in a simple and straightforward way. The theoretical ideas are constantly reinforced by worked examples and each chapter concludes with a mini case study showing a particular application.  This provides further motivation to the reader to engage with the mathematical ideas involved, as well as demonstrating how the mathematics can be applied within a computing context.  The book also contains carefully selected exercises for which full worked solutions are provided. 

1. Introduction
2. Logic and Proof
3. Set Theory
4. Relations
5. Functions
6. Combinatorics
7. Graphs
8. Directed Graphs
9. Boolean Algebra
Application: Designing a 2-Bit Adder

• Offers thorough treatment of key mathematical ideas of particular relevance to computing in order to develop students' understanding and confidence, and to demonstrate how the material can be applied in computing.
• Presents numerous worked examples and practice exercises with full solutions so students see how to work with the mathematical concepts covered, thereby developing their own competence.
• Encourages students with modest mathematical backgrounds to develop their mathematical skills.