×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer / Edition 1
     

Fundamentals of Discrete Math for Computer Science: A Problem-Solving Primer / Edition 1

by Tom Jenkyns, Ben Stephenson
 

See All Formats & Editions

ISBN-10: 1447140680

ISBN-13: 9781447140689

Pub. Date: 08/31/2012

Publisher: Springer London

An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence. Fundamentals of Discrete Math for Computer Science 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

Overview

An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence. Fundamentals of Discrete Math for Computer Science 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. Topics and features: 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 Describes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expected 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 This easy-to-understand and fun-to-read textbook is ideal for an introductory discrete mathematics course for computer science students at the beginning of their studies. The book assumes no prior mathematical knowledge, and discusses concepts in programming as needed, allowing it to be used in a mathematics course taken concurrently with a student's first programming course.

Product Details

ISBN-13:
9781447140689
Publisher:
Springer London
Publication date:
08/31/2012
Series:
Undergraduate Topics in Computer Science Series
Edition description:
2013
Pages:
416
Product dimensions:
6.10(w) x 9.00(h) x 1.00(d)

Table of Contents

Algorithms, Numbers and Machines
Sets, Sequences and Counting
Boolean Expressions, Logic and Proof
Searching and Sorting
Graphs and Trees
Relations: Especially on (Integer) Sequences
Sequences and Series
Generating Sequences and Subsets
Discrete Probability and Average Case Complexity
Turing Machines

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews