Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer
- 6h 20m
- Ben Stephenson, Tom Jenkyns
- Springer
- 2013
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.
About the Authors
Dr. Tom Jenkyns is an Associate Professor in the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is an Instructor in the Department of Computer Science at the University of Calgary, Canada.
In this Book
-
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
