At any rate, I do plan on revisiting sections later Not sure I will make a ton progress, but you won t know till you try And many of these topics are reachable once you missed them the first twenty times.
Difficult, instructive, intelligent, amusing and brain numbing all rolled in to one in this classic of CS Buy it, read a page at a sitting and savor it this is a book read over 5 years.
The depth of thought and exploration of fundamental algorithms and their adaptation sometimes modification to computing is impressive Knuth clearly has a love for detail and making the detail germane.
Some sections are very thick and not all of the mathematics or exercises I could do, but don t let the book scare you away I understand far about how my computer works than I did before and I learned a lot about algorithmic methods for what feel like simple tasks that only feel simple because we were taught the easiest algorithms in fifth grade.
I think his passionate and favorite parts of the book were pseudo random numbers, method of complements, and the manipulation of numbers represented in exotic radixes like negabinary or imaginary.
More so than even in the first volume of the series, this is a math forward approach to Computer Science I enjoyed the theory on psuedorandom number series, and the early parts of arithmetic, but got lost during the coverage of polynomial series and matrices Knuth s treatment of his subject matter is as expected almost painfully thorough.
If you re a programmer with limited mathematical background, I strongly advise reviewing college algebra, pre calculus, and calculus prior to reading this book.
didn t really read this volume.
Creating Web Pages for Dummies