"Discrete Mathematics for Computer Science" - Information and Links:

Discrete Mathematics for Computer Science

An Example-Based Introduction

Book's cover
The cover of “Discrete Mathematics for Computer Science” - Open Library.

"Discrete Mathematics for Computer Science" is published by Chapman and Hall/CRC in Dec 24, 2020 - Boca Raton London New York and it has 272 pages.


“Discrete Mathematics for Computer Science” Metadata:

  • Title: ➤  Discrete Mathematics for Computer Science
  • Author:
  • Number of Pages: 272
  • Publisher: Chapman and Hall/CRC
  • Publish Date:
  • Publish Location: Boca Raton London New York

“Discrete Mathematics for Computer Science” Subjects and Themes:

Edition Specifications:

  • Format: hardcover

Edition Identifiers:

AI-generated Review of “Discrete Mathematics for Computer Science”:


"Discrete Mathematics for Computer Science" Description:

Open Data:

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook

Read “Discrete Mathematics for Computer Science”:

Read “Discrete Mathematics for Computer Science” by choosing from the options below.

Search for “Discrete Mathematics for Computer Science” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Discrete Mathematics for Computer Science” in Libraries Near You:

Read or borrow “Discrete Mathematics for Computer Science” from your local library.

Buy “Discrete Mathematics for Computer Science” online:

Shop for “Discrete Mathematics for Computer Science” on popular online marketplaces.