DeepRead
Cover of Foundations of computer science

Foundations of computer science

Alfred V. Aho · 1992

Programming and computer science › Electronics and computer architecture

#6,639 most recommended

About the book

An introductory textbook on the mathematical and algorithmic foundations of computer science, written for students who are learning to program in C. It covers discrete mathematics such as logic, sets, induction, and combinatorics, along with recursion, data structures, and the analysis of algorithms. Its scope is the core theory that underlies programming rather than any single language or application. The book's central claim is that a small set of mathematical tools, especially induction, recursion, and graph and counting methods, can be used to reason about what a program does, how correct it is, and how fast it runs. It presents recursion and induction as closely related ideas, so that proving a property and writing a program follow the same pattern. It also treats data representation and algorithm design as subjects to be analyzed mathematically, not as matters of trial and error.

Written by Claude from what it knows of this book.

What Hacker News says 80% recommend · 0% critical

02420122015202020262021 peak · 3
This bookAverage book in Electronics and computer architecture

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 15 want to read
  • 1 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

The threads it came up in

Details

First published
1992
ISBN
9780716782841
Editions known
4 at Open Library
Open Library
OL3509443W

C (Computer program language)Computer science

Explore in the mosaic

Read next: its neighbours on the mosaic