Advertisement

Fundamentals of Discrete Math for Computer Science

A Problem-Solving Primer

  • Tom Jenkyns
  • Ben Stephenson

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

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Tom Jenkyns, Ben Stephenson
    Pages 1-43
  3. Tom Jenkyns, Ben Stephenson
    Pages 45-79
  4. Tom Jenkyns, Ben Stephenson
    Pages 81-136
  5. Tom Jenkyns, Ben Stephenson
    Pages 137-189
  6. Tom Jenkyns, Ben Stephenson
    Pages 191-239
  7. Tom Jenkyns, Ben Stephenson
    Pages 241-298
  8. Tom Jenkyns, Ben Stephenson
    Pages 299-332
  9. Tom Jenkyns, Ben Stephenson
    Pages 333-378
  10. Tom Jenkyns, Ben Stephenson
    Pages 379-419
  11. Tom Jenkyns, Ben Stephenson
    Pages 421-466
  12. Tom Jenkyns, Ben Stephenson
    Pages 467-481
  13. Back Matter
    Pages 483-512

About this book

Introduction

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.

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.

Keywords

Analysis of Algorithms Complexity Analysis Discrete Mathematics Proof of Correctness Graph Theory

Authors and affiliations

  • Tom Jenkyns
    • 1
  • Ben Stephenson
    • 2
  1. 1.Brock UniversitySt. CatharinesCanada
  2. 2.University of CalgaryCalgaryCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-70151-6
  • Copyright Information Springer International Publishing AG, part of Springer Nature 2018
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-70150-9
  • Online ISBN 978-3-319-70151-6
  • Series Print ISSN 1863-7310
  • Series Online ISSN 2197-1781
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Energy, Utilities & Environment
Engineering