9781447140689-1447140680-Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science)

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science)

ISBN-13: 9781447140689
ISBN-10: 1447140680
Edition: 2013
Author: Ben Stephenson, Ben Stephenson Tom Jenkyns
Publication date: 2012
Publisher: Springer-Verlag New York Inc
Format: Paperback 416 pages
FREE US shipping
Buy

From $16.50

Book details

ISBN-13: 9781447140689
ISBN-10: 1447140680
Edition: 2013
Author: Ben Stephenson, Ben Stephenson Tom Jenkyns
Publication date: 2012
Publisher: Springer-Verlag New York Inc
Format: Paperback 416 pages

Summary

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science) (ISBN-13: 9781447140689 and ISBN-10: 1447140680), written by authors Ben Stephenson, Ben Stephenson Tom Jenkyns, was published by Springer-Verlag New York Inc in 2012. With an overall rating of 4.0 stars, it's a notable title among other Computer Science (Data Processing, Databases & Big Data, Algorithms, Programming) books. You can easily purchase or rent Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer (Undergraduate Topics in Computer Science) (Paperback) from BooksRun, along with many other new and used Computer Science books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.3.

Description

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.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book