- Full Description
This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; contains examples and exercises throughout the text, and highlights the most important concepts in each section; selects examples that demonstrate a practical use for the concept in question.
- Table of Contents
Table of Contents
- Algorithms, Numbers and Machines.
- Sets, Sequences and Counting.
- Boolean Expressions, Logic and Proof.
- Searching and Sorting.
- Graphs and Trees.
- Relations: Especially on (Integer) Sequences.
- Sequences and Series.
- Generating Sequences and Subsets.
- Discrete Probability and Average Case Complexity.
- Turing Machines.
If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.No errata are currently published