DeepRead
Cover of Discrete mathematics for computer science

Discrete mathematics for computer science

Kenneth P. Bogart, Clifford Stein, Robert L. Drysdale · 2005

Mathematics and physics › Proofs and analysis intro

#15,014 most recommended

About the book

An undergraduate introduction to discrete mathematics aimed at computer science students. It covers the mathematical foundations used in programming and algorithms, including logic, sets, functions and relations, induction, counting, and graphs and trees. The book's central aim is that the reasoning tools of discrete mathematics, especially precise definitions and rigorous proof, are what computer scientists need to analyse algorithms and data structures. It presents these topics through computing applications so that proof technique is taught alongside the problems it helps solve. The specific claims are about pedagogy and content rather than a single thesis.

Written by Claude from what it knows of this book.

What Hacker News says 0% recommend · 0% critical

012201520162018202020222015 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.

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

The threads it came up in

Details

First published
2005
ISBN
9781930190863
Editions known
2 at Open Library
Open Library
OL19850016W

Computer scienceMathematics

Explore in the mosaic

Read next: its neighbours on the mosaic