Fundamentals of Discrete Math for Computer Science (2nd Ed.)
A Problem-Solving Primer
Undergraduate Topics in Computer Science Series
Authors: JENKYNS Tom, STEPHENSON BenLanguage: Anglais
In Print (Delivery period: 15 days).Add to cart the livre of JENKYNS Tom, STEPHENSON Ben
519 p. · Paperback
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. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
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