Sponsored
Fundamentals of Discrete Math for Computer Science - (Undergraduate Topics in Computer Science) 2nd Edition by Tom Jenkyns & Ben Stephenson
About this item
Highlights
- Highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematicsIdeally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendationsContains examples and exercises throughout the text, and highlights the most important concepts in each section
- About the Author: Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
- 512 Pages
- Computers + Internet, Data Processing
- Series Name: Undergraduate Topics in Computer Science
Description
About the Book
This book offers an engaging introduction to traditional topics in discrete mathematics, in a manner designed to appeal to computer science students. Presents detailed walkthroughs of several algorithms, along with exercises and practical examples throughout.Book Synopsis
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
From the Back Cover
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).
Topics and features:
- Assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed
- Designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations
- Describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task
- Includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts
- Selects examples that demonstrate a practical use for the concept in question
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.
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.
About the Author
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.