Concrete Mathematics: A Foundation for Computer Science (2nd Edition) 2nd Edition
Use the Amazon App to scan ISBNs and compare prices.
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Frequently bought together
What other items do customers buy after viewing this item?
From the Back Cover
This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline.
Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study.
Major topics include:
- Integer functions
- Elementary number theory
- Binomial coefficients
- Generating functions
- Discrete probability
- Asymptotic methods
This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them.
About the Author
Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.
There was a problem filtering reviews right now. Please try again later.
If you're going to publish a kindle version of your book. Have enough respect for your readers to make it "readable".
Take-Aways (As of Ch 3):
There are many aspects of summations, integer functions, and proofing that: I never saw covered in my CS degree, are unforgettable, and can be immediately applied to most algorithm research. Those alone make this book worth every penny. Further, the problems posed by this book are more than just repeated mechanics, as I have seen in books like those mentioned below. Each problem is carefully chosen, thorough, and exposes multiple aspects of each topic. They really do weed out many faults that I wasn't really exposed to- as a small example: the importance of ensuring validity of n-1 and n-2 hypothesis & base cases during an induction proof.
Students educated through a contemporary CS track at most American uni's, I believe, (e.g. Rosen Discrete Math, Cormen Algorithms) will find this book both terrifyingly terse and frustratingly paced. In many cases, examples are given without derivation. In many cases, important points are made without obvious connection to previous topics. This is not without a solution however, and getting through this book is often an acquired technique of paper noting things as-you-go, as well as a learned hyper-literacy. The terseness is also a double-edged sword, as sometimes I found it useful as an extra opportunity to practice the taught methods to see if I could come to the same result. Further, the reader should be prepared to go back and review propositional logic & university calculus theorems (atleast FTC, definite vs indefinite integrals). For example, the description of sum by parts in the section on finite calculus assumes _much_ from the reader, and being able to use university calc. as a point of reference to get through that is helpful.
A lot of exercises are tersely explained in both problem and solution. Further, many solutions are totally left-field (having little to do with material in the book). This isn't necessarily bad, as even taking the wrong path to a solution is very educational. However, at some point the reader has to make a judgment as to how long to commit to a certain problem. Many terse problems & left-field solutions instill the wrong judgment: quitting too early.
Attention to detail & extra work is necessary to overcome the terseness of this particular beast, but it's worth it. I recommend this book for developers confronted with algorithm optimization problems, as a well as for a different take on parts of discrete math, and definitely for students coming out of a US state school CS program, the last which this book complements very well. Having worked through some of V1 TAOCP, I would also say that the book is effective in expanding upon its math underpinnings (V1 at-least), and incidentally, does give one confidence to tackle Knuth's other works.
The book is great for self -study. As with TAOCP, problems are graded. Solutions exist to all problems - except research ones- but trying to solve them yourself will be the best way to use this book.
Overall, worth every penny. A classic reference and must have.
Top international reviews
The marginal notes are wonderful.
Das Buch basiert auf einem Kurs, der an der Stanford Universität jährlich seit 1970 gehalten wird; es macht den Leser mit den mathematischen Grundlagen vertraut, die benötigt werden, um Computer Programme und Algorithmen verstehen und zu analysieren zu können.
In den ersten Kapiteln werden Grundlagen zu rekursiven Problemen, Summen, Ganzzahligen Funktionen und Kongruenzen gelegt; danach werden Binominal Koeffizienten und spezielle Zahlen, d.h. Stirling, Euler, Harmonische, Bernoulli und Fibonacci Zahlen, behandelt. Es folgt ein Kapitel über Generator Funktionen, einen der wichtigsten 'Werkzeuge' dieses Werkes. Es handelt sich dabei um ein Methode, mittels (formalen) unendlichen Reihen, eine ganze Folge von Koeffizienten zusammen zu fassen, und somit als ein Objekt behandeln zu können. Es lassen damit u.a. Rekursions- Probleme und Eigenschaften von 'speziellen' Zahlen bzw. von Polynom Familien systematisch behandeln.
Ergänzt wird das Buch mit Abschnitten über Diskrete Wahrscheinlichkeiten und Asymptotiken.
Die Komposition des Werk ist ausgezeichnet gelungen, die Darstellung der einzelnen Themen ist elegant und präzise. Neben der, durch langjährige Erfahrung, motivierte Stoffauswahl, tragen auch die geschickt gewählten Bezeichnung zum Erfolg bei; hier sei besonders die [logical expression] Konstruktion – eine Erweiterung des Kronecker Deltas, erwähnt, damit können u.a. auch komplexe Mehrfach- Summen effizient manipulieren und umgeformt werden. Alles in Allem ist die Lektüre nicht nur interessant, sondern ein regelrechter Genuss.
Der Text enthält ca. 500 Übungsaufgaben in sechs Schwierigkeitsgraden (von 'warmup' bis 'research problem') – Antworten zu den Aufgaben sind in einem Anhang zu finden. Eine sehr ausführliche Bibliographie, sowie ein Stichwortverzeichnis runden die exzellente Ausstattung ab.
The book is not written like your typical academic text book you see these days. It contains full solutions, in plain and concise English, and a lot of humorous footnotes by TA's and Students.
If you're a freshman or junior in a Computer Science program and just have done Calculus 1 and Discrete Math, you'll want to work through this if you want to masterfully analysis algorithms later on in your program.
Anyways, it's from the Legend himself - Knuth!
Allgemein kann man sagen, dass es eine FRECHHEIT ist für so einen Mist auch noch Geld zu verlangen.
Dies ist explizit eine Beurteilung für das eBook. Das physische Version ist ausnahmslos empfehlenswert.