Authors:
- Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics
- Ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations
- Contains examples and exercises throughout the text, and highlights the most important concepts in each section
Part of the book series: Undergraduate Topics in Computer Science (UTICS)
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (10 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Reviews
From the reviews:
“This book is dedicated to presenting the basic notions of discrete mathematics for undergraduate students in computer science. With a good balance between theory and practice – including the algorithmic point of view – this book will prove very helpful. … Many examples and exercises make the book both enjoyable and useful.” (Jean-Paul Allouche, zbMATH, Vol. 1278, 2014)
“Jenkyns (Brock Univ., Canada) and Stephenson (Univ. of Calgary, Canada) have written an introductory textbook on discrete mathematics for computer science majors. The volume’s ten chapters cover the standard topics taught in such courses at the freshman or sophomore level … . In comparison with other introductory discrete mathematics textbooks, this work has a very strong emphasis on algorithms, proofs of algorithmic correctness, and the analysis of worst-case and average-case complexity. … Summing Up: Recommended. Lower-division undergraduates.” (B. Borchers, Choice, Vol. 50 (9), May,2013)
“This book is specifically aimed at CS students. The authors include the same discrete math topics that other books have, but, in contrast to most existing books, they introduce each topic with a clear (and entertaining) CS motivation. … Each section is well written, with a highlighted subsection on the most important ideas and plenty of exercises. I highly recommend this book to everyone.” (V. Kreinovich, Computing Reviews, December, 2012)
Authors and Affiliations
-
Department of Mathematics, Brock University, St. Catharines, Canada
Tom Jenkyns
-
Department of Computer Science, University of Calgary, Calgary, Canada
Ben Stephenson
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.
Bibliographic Information
Book Title: Fundamentals of Discrete Math for Computer Science
Book Subtitle: A Problem-Solving Primer
Authors: Tom Jenkyns, Ben Stephenson
Series Title: Undergraduate Topics in Computer Science
DOI: https://doi.org/10.1007/978-1-4471-4069-6
Publisher: Springer London
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag London Ltd., part of Springer Nature 2013
eBook ISBN: 978-1-4471-4069-6Published: 16 October 2012
Series ISSN: 1863-7310
Series E-ISSN: 2197-1781
Edition Number: 1
Number of Pages: XII, 416
Number of Illustrations: 143 b/w illustrations
Topics: Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity