DeepRead
Cover of Applied Discrete Structures

Applied Discrete Structures

Ken Levasseur, Al Doerr · 2012

Mathematics and physics › Proofs and analysis intro

#14,503 most recommended

About the book

An undergraduate textbook on discrete mathematics for computer science and applied mathematics students. It covers the core structures used in computing, including logic, sets, relations, functions, combinatorics, graphs and trees, and Boolean algebra, with examples drawn from computing applications. The book presents discrete structures as the working mathematics behind software, algorithms, and digital systems, and holds that students learn them best by connecting formal definitions and proof techniques to concrete applications. Its main claims are that precise reasoning, such as induction and recursive thinking, is a practical skill for building and analysing computer systems, not only an abstract exercise. The text's approach is to motivate each topic with an application before developing the formal theory.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

012201720182020202220242017 peak · 1
This bookAverage book in Proofs and analysis intro

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2012
ISBN
9781105559297
Editions known
2 at Open Library
Open Library
OL29163627W

Applied mathematicsMathematicsTextbooks

Explore in the mosaic

Read next: its neighbours on the mosaic