Overview
- Updated and enhanced new edition with additional material on directed graphs, and on drawing and coloring graphs, as well as more than 100 new exercises (with solutions)
- 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)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (11 chapters)
Keywords
About this book
This clearly written textbook presents an accessible introduction to discrete mathematics for computer science students, offering the reader an enjoyable and stimulating path to improve their programming competence. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Its motivational and interactive style provokes a conversation with the reader through a questioning commentary, and supplies detailed walkthroughs of several algorithms.
This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises).
Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course.
Authors and Affiliations
About the authors
Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is a Teaching Professor 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-3-319-70151-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2018
Softcover ISBN: 978-3-319-70150-9Published: 08 May 2018
eBook ISBN: 978-3-319-70151-6Published: 03 May 2018
Series ISSN: 1863-7310
Series E-ISSN: 2197-1781
Edition Number: 2
Number of Pages: XIII, 512
Number of Illustrations: 120 b/w illustrations
Topics: Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity