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

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $47.15
Usually ships in 1-2 business days
(Save 21%)
Other sellers (Paperback)
  • All (8) from $47.15   
  • New (6) from $47.15   
  • Used (2) from $64.18   


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 mathematicsIdeally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendationsDescribes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expectedContains examples and exercises throughout the text, and highlights the most important concepts in each sectionSelects examples that demonstrate a practical use for the concept in questionThis 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.

Read More Show Less

Editorial Reviews

From the Publisher

From the reviews:

Prof. Vladik Kreinovich, University of Texas at El Paso, TX, USA

Excerpts from full review posted Dec 28 2012 to Computing Reviews [Review #: CR140786]

This book is specifically aimed at CS students. The authors include the same discrete math topics that other books have, but, in contrast to most existing books, they introduce each topic with a clear (and entertaining) CS motivation…

The book covers the usual discrete math topics …in a very entertaining way…

Each section is well written, with a highlighted subsection on the most important ideas and plenty of exercises. I highly recommend this book to everyone. It can be used in two different ways. The easiest way is to teach only the topics that are usually taught in discrete math classes (and ignore the other parts of the book). Alternatively, you could cover the whole book and, if needed, rearrange the other classes to avoid duplication. No matter how you use this book, its highly entertaining presentation of the material will undoubtedly make the class a success.

“Jenkyns (Brock Univ., Canada) and Stephenson (Univ. of Calgary, Canada) have written an introductory textbook on discrete mathematics for computer science majors. The volume’s ten chapters cover the standard topics taught in such courses at the freshman or sophomore level … . In comparison with other introductory discrete mathematics textbooks, this work has a very strong emphasis on algorithms, proofs of algorithmic correctness, and the analysis of worst-case and average-case complexity. … Summing Up: Recommended. Lower-division undergraduates.” (B. Borchers, Choice, Vol. 50 (9), May, 2013)

Read More Show Less

Product Details

  • ISBN-13: 9781447140689
  • Publisher: Springer London
  • Publication date: 8/31/2012
  • Series: Undergraduate Topics in Computer Science Series
  • Edition description: 2013
  • Edition number: 1
  • Pages: 416
  • Sales rank: 712,042
  • Product dimensions: 6.10 (w) x 9.00 (h) x 1.00 (d)

Meet the Author

Dr. Tom Jenkyns is an Associate Professor in the Department of Mathematics and the Department of Computer Science at Brock University, Canada.
Dr. Ben Stephenson is an Instructor in the Department of Computer Science at the University of Calgary, Canada.

Read More Show Less

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

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)