Skip to main content
main-content

About this book

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

2013 | OriginalPaper | Chapter

1. Algorithms, Numbers, and Machines

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

2. Sets, Sequences, and Counting

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

3. Boolean Expressions, Logic, and Proof

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

4. Searching and Sorting

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

5. Graphs and Trees

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

6. Relations: Especially on (Integer) Sequences

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

7. Sequences and Series

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

8. Generating Sequences and Subsets

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

9. Discrete Probability and Average-Case Complexity

Tom Jenkyns, Ben Stephenson

2013 | OriginalPaper | Chapter

10. Turing Machines

Tom Jenkyns, Ben Stephenson
Additional information