Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Discrete Math for Computer Science

A Problem-Solving Primer

  • Textbook
  • © 2018

Overview

Authors:
  1. Tom Jenkyns

    1. Brock University, St. Catharines, Canada

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Ben Stephenson

    1. University of Calgary, Calgary, Canada

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Updated and enhanced new edition with additional material on directed graphs, and on drawing and coloring graphs, as well as more than 100 new exercises (with solutions)
  • 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

Part of the book series: Undergraduate Topics in Computer Science (UTICS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 chapters)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Algorithms, Numbers, and Machines

    • Tom Jenkyns, Ben Stephenson
    Pages 1-43

  3. Sets, Sequences, and Counting

    • Tom Jenkyns, Ben Stephenson
    Pages 45-79

  4. Boolean Expressions, Logic, and Proof

    • Tom Jenkyns, Ben Stephenson
    Pages 81-136

  5. Searching and Sorting

    • Tom Jenkyns, Ben Stephenson
    Pages 137-189

  6. Graphs and Trees

    • Tom Jenkyns, Ben Stephenson
    Pages 191-239

  7. Directed Graphs

    • Tom Jenkyns, Ben Stephenson
    Pages 241-298

  8. Relations: Especially on (Integer) Sequences

    • Tom Jenkyns, Ben Stephenson
    Pages 299-332

  9. Sequences and Series

    • Tom Jenkyns, Ben Stephenson
    Pages 333-378

  10. Generating Sequences and Subsets

    • Tom Jenkyns, Ben Stephenson
    Pages 379-419

  11. Discrete Probability and Average-Case Complexity

    • Tom Jenkyns, Ben Stephenson
    Pages 421-466

  12. Turing Machines

    • Tom Jenkyns, Ben Stephenson
    Pages 467-481

  13. Back Matter

    Pages 483-512
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Brock University, St. Catharines, Canada

    Tom Jenkyns

  • University of Calgary, Calgary, Canada

    Ben Stephenson

About the authors

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.

Bibliographic Information

  • Book Title: Fundamentals of Discrete Math for Computer Science

  • Book Subtitle: A Problem-Solving Primer

  • Authors: Tom Jenkyns, Ben Stephenson

  • Series Title: Undergraduate Topics in Computer Science

  • DOI: https://doi.org/10.1007/978-3-319-70151-6

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2018

  • Softcover ISBN: 978-3-319-70150-9Published: 08 May 2018

  • eBook ISBN: 978-3-319-70151-6Published: 03 May 2018

  • Series ISSN: 1863-7310

  • Series E-ISSN: 2197-1781

  • Edition Number: 2

  • Number of Pages: XIII, 512

  • Number of Illustrations: 120 b/w illustrations

  • Topics: Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity

Publish with us

Policies and ethics

Back to top

Search

Navigation