Product Description
This book still remains the best introduction to computer algebra, catering to both the interested beginner and the experienced pure mathematician and computer scientist. This updated Second Edition provides a comprehensive review, and contains excellent references to fundamental papers and worked examples. In addition to being a general text on the subject, the book includes an appendix describing the use of one particular algebra system-REDUCE. ... Read more

Product Description
Covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Provides clear and relevant insight into why the algorithms work. Softcover.Amazon.com Review
Robert Sedgewick's Algorithms series has earned a place amongthe classics of computer books. Algorithms in C++ provides acomprehensive collection of classic algorithms for sorting, searching,parsing, geometrical manipulation, and more. The book includes notjust C++ code but detailed--yet readable--explanations of how it worksand what each algorithm's advantages and disadvantages are in terms ofexecution time and memory demands. An invaluable and timelessresource. ... Read more

Customer Reviews (34)

Terse
It's quite terse and needs many more COMPLETE diagrams for better visualization of difficult concepts. Fill-in-the-details sort of diagrams don't quite cut it for understanding complicated algorithms. The explanation of code isn't that verbose, so you might have to read the same sentence three or more times to understand its meaning.

Brilliant book on Graphs and Graph Algorithms!
I am not going to give you an amazing review here. All I can do is help "up" the score of this book, because it has been lowered by other reviews which are not even reviews of previous editions of this book (there are none!). Actually, several (if not most), are of this nature. Others are even worse, for they are reviews of previous editions of Parts I-IV, for the version in C! The new 3rd edition for the first volume is much better, and the book featured in this page: Volume II of Sedgewick's Algorithms in C++, is really good too.

Just a few things I want to say:
-The book is not hard to read (I am an Ecuadorian, living in Ecuador, first language is Spanish, and even then, I can understand the author very well).
-The explanations are amazing. Not only that, but Sedgewick really gives you loads of insight on all the topics covered.
-Even with little mathematical content, one can understand rather well the complexity of all algorithms (and data structure implementations) in this book.
-Perfect as a Reference. Sections are small, and one can jump in at any time.
-Plenty of (incredible) exercises
-Implementations are actually very good, very readable. Sure, the Author may not have the best of programming practices, but any reader programming in C++ should read Effective C++ anyways. If you dislike the fact that variables are often not given the best of names, rest assured that the author, more often than not, explains their nature.

Plain average!
This is an okay book. The algorithms are described in great detail (actually sometimes too much detail), moreover it is not very mathematical. For this reason it could be the choice for the readers fed up of the math in other algorithms books e.g., Cormen et al's.

However the biggest complain I have with this book is that it is overloaded with too much contents. When things could have been described in a few lines, dozens of paragraphes have been used for it. The reader just losts in the text. And interestingly the job is still not done, i.e., the reader is still not able to follow the algorithms easily.

Also for this reason it is not a good choice for someone wants to get a quick overview or revision.

Bought this to complete the series...
I don't intend to read this book from front to back (well maybe one day if I get really bored) but I think this book does a very good job explaining the algorithm without getting obsessed with overly formal mathematical games.In my opinion the graphs are the most important part of the series, since these are the algorithms and data structures that usually AREN'T included in a programming language's libraries; STL for example.You will find many of these topics in a mathematics and statistics program (how I first encountered them) so the book does get mathematical, but out of necessity.

4 out of 5 stars for sometimes being unclear.

Best of thebunch
I had to teach this course and must see it is the pick of the books I have seen on this subject though it is far from ideal. Why can't these people use meaningful variable names and comment the code. Is it the authors intent to teach bad programming practice. ... Read more

Product Description
Algorithms and Networking for Computer Games is an essential guide to solving the algorithmic and networking problems of modern commercial computer games, written from the perspective of a computer scientist. Combining algorithmic knowledge and game-related problems, the authors discuss all the common difficulties encountered in game programming.

The first part of the book tackles algorithmic problems by presenting how they can be solved practically. As well as "classical" topics such as random numbers, tournaments and game trees, the authors focus on how to find a path in, create the terrain of, and make decisions in the game world. Part two introduces networking related problems in computer games and focuses on three key questions: how to hide the inherent communication delay, how to utilize limited network resources, and how to cope with cheating.

Algorithms and Networking for Computer Games provides a comprehensive resource that offers deeper algorithmic insight into game programming and explains game-specific network considerations. Read on for...

• Algorithmic solutions in pseudo code format, which not only emphasizes the idea behind the solution, but also can easily be written into the programming language of your choice.
• A section on the Synthetic player, covering decision-making, influence maps, finite-state machines, flocking, fuzzy sets and probabilistic reasoning.
• In-depth treatment of network communication including dead reckoning, local perception filters and cheating prevention.
• 51 ready-to-use algorithms and 178 illustrative exercises.

Algorithms and Networking for Computer Games is a must-read text for advanced undergraduate and graduate students on computer game-related courses, postgraduate researchers in game-related topics, and game developers interested in new approaches and the theoretical background to games. ... Read more

Customer Reviews (1)

Extremely useful resource for experienced developers
I teach a college course on network game programming and this is probably the best resource that I've yet seen on the subject.Only the last few chapters specifically deal with network programming however they are extremely good and cover a lot of the core issues with network gaming.Some of the topics include dealing with lag via dead reckoning and splines, local perception filters, area of interest filters, as well as some information on cheating and how to deal with it.

This book is absolutely NOT for someone just starting out with network programming or programming in general; I would recommend this for someone who knows the fundamentals of networking and using sockets and is a fairly strong C/C++ programmer and is interested in developing moderately simple network games.More inexperienced developers will probably benefit from this book if they have someone who can help clarify and explain the concepts. ... Read more

Customer Reviews (2)

A Reference "collection" for all those who love math and CS
I came accross the three books of Knuth while a grad student in CS at William and Mary back in the middle 70's.I am happy to see that those books are still reference for all those studying CS.I regret we have towait until 2004 to take a peek at volume 4!Needless do say of volumes 5,6, and 7.

Brilliant & Amazing. Unequaled achievement in this field.
I used to be a high-school student when I accidently found a copy of thefirst volume. It moved my all life. I decided to become a computerscientist at the end of the first chapter. And today, having accomplishedthis, I still didn't finish the second volume and it has been a long timealready. Nevertheless, I couldn't resist buying the third volume. I justhope to live long enough to get to the end of the fifth and last volume ofthis collection. Thank you Donald Knuth for this brilliant and inspiringwork. ... Read more

Product Description
The design and analysis of algorithms is one of the two essential cornerstone topics in computer science (the other being automata theory/theory of computation). Every computer scientist has a copy of Knuth's works on algorithms on his or her shelf. Dexter Kozen, a researcher and professor at Cornell University, has written a text for graduate study of algorithms. This will be an important reference book as well as being a useful graduate-level textbook. ... Read more

Customer Reviews (3)

covers a lot of topics, sometimes difficult to follow
This book covers a lot of interesting topics and is very up-to-date with current research results in the field. Its main drawback is that it has few examples. It is also at times hard to follow, unless the reader is already somehow familiar with the material.

Excellent supplementary text for a graduate course
This book is basically a set of lecture notes used by Prof. Kozen at Cornell, plus some practise 'homework' exercises.

As such, it isn't really a textbook, and can't be used as the only book for a course in the design and analysis of algorithms - for that, you'll need the books by Aho et al, or Cormen et al. (Knuth's books, of course are great for the topics they cover; and while on the book by Cormen et al, there's a second edition now, since September 2001).

However,this is an excellent self-study supplement. There are 40 lectures, each being a concise, self-contained discussion on a chosen topic. Thus, you get a condensed presentation of the important points, along with invaluable insights from Prof. Kozen.

Another feature which makes this a great option for self-study/rapid review is that each chapter ends with 'homeworks', for which answers have been provided. There's a set of miscellaneous exercises as well.

It is important to realize that this is a graduate text, for those who are already familiar with data structures and algorithms. This is not an introductory text by any means, and would ill serve that purpose.

The author presumes a fairly strong background in basic data structures and algorithms as well as mathematics on the part of the reader, without which it may be very difficult to follow the presentation.

All in all, if you're doing a graduate course in the design and analysis of algorithms, then this is a superb choicefor self-study, practising problem-solving and rapid review of already familiar topics.

An excellent self-study guide
The text conists of of 40 'lectures' or chapters, each about 4-5 pages, 10 moderately difficult 'homeworks', each about 3-4 problems and one set of 29 miscellaneous exercises. Solutions to both the homeworks and miscellaneousexercises are provided. The text is based on the notes used by the authorat Cornell in a one-semester graduate course.

Each lecture is (largely)self-contained and brief. Being clearly written and concise makes it anexcellent choice for those interested in self-study. The homeworks are thekey to understanding the material. I would suggest trying for atleast a daybefore looking up the solutions.

For more comprehensive treatment of thetopics dicussed in the book see "The design and analysis of computeralgorithms" (Aho, Hopcroft and Ullman) and "Computers andIntractability" (Garey and Johnson). ... Read more

Product Description
The design of algorithms for problem-solving lies at the heart of computer science. Concise yet authoritative, Algorithms: A Functional Programming Approach teaches the skills needed to master this essential subject.The authors challenge more traditional methods of teaching algorithms by using a functional programming context, with Haskell as the implementation language. This leads to smaller, clearer and more elegant programs which enable the programmer to understand the algorithm itself more quickly and to use that understanding to explore alternative solutions. Placing the emphasis on program development rather than the mathematical properties of algorithms, the book uses a succession of practical programming examples to develop in the reader problem-solving skills which can be easily transferred to other language paradigms.Key features of this innovative text include:Unmatched collection of functional programming algorithmsA wealth of practical examples, bringing the algorithms into clear focus

End of chapter exercises throughoutSource code and selected solutions freely available onlineComprehensive index and bibliographical notesAppendices on Haskell implementations and mathematicalbackground For computer science students taking algorithms and/or functional programming courses, Algorithms: A Functional Programming Approach represents the ideal textbook. It is also an invaluable reference source of functional programs for practitioners. ... Read more

Customer Reviews (2)

Eh...
It took me a while to find this book, and I had to ultimately buy it used. It turned out not to be quite as good as I expected.

The book is littered with single-letter variable names and is in love with mutually-recursive functions.It includes a quicksort implementation that runs on lists (instead of an ST-based array implementation).If this book were easy to find, I'd say go for it.But since it's out of print, don't bother.

A book with no purpose
I bought this book as I thought it would make a good companion to the excellent Purely Functional Data Structures. How wrong I was. It was supposed to be a book about implementing algorithms in a functional language, but instead the content spreads far a wide. In the opening chapters the authors starts out with a incredible short introduction to Haskell, which quickly turns into a vague discussion on algorithm optimization in functional languages (and this is before! they have even shown how to implement "quick sort") - this writing style is completely unacceptable, either you set the bar high by requiring the audience to know Haskell beforehand or you explain it properly.

The book continues in the same random style, with the authors starting out trying to accomplish something simple, quickly throwing in a few random related computer science topics and then ultimately failing to explain what they set out to do. In short, if you want to learn how to implement classic algorithms in a functional programming language go read Purely Functional Data Structures instead (perhaps after first getting acquaintedwith Haskell via Real World Haskell). ... Read more

Product Description

This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms.

NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new "war stories" and "interview problems", relating experiences from real-world applications.

Written by a well-known, IEEE Computer Science teaching-award winner, this new edition is an essential learning tool for students needing a solid grounding in algorithms, as well as a uniquely comprehensive text/reference for professionals.

Customer Reviews (39)

it is a great book
a great value for keeping all the key things in a relatively small volume. as one of the review says, "accessible"

Great book.Maybe a beginner book, but not for comp sci novices!
I've got the Cormen book as well, which I love.This book is a much more readable text, by far.I think that others here have broken down the areas covered quite well; so I'll just give a stream of consciousness version of what I liked about the book.

It gives the subject matter with from a need to know standpoint.It also gives you real world examples of how the author has had to utilize algorithms not just to implement a particular solution, but to also optimize existing solutions.Although it doesn't give the hardcore theoretical breakdowns in Cormen's text, don't think that the subject matter is presented in a lightweight format.You will still be given some level of mathematical proof for some algorithms and data structure optimizations.

Although less terse than the typical text on Algorithms, it doesn't try too hard to be cute and quirky.The humor is well placed and not too overbearing.

Though less academic than "Introduction To Algorithms", this ain't the book to pickup to learn about coding algorithms for a quick study prior to an interview.However, if you're planning to get ready for interviews maybe a few months down the road...go for it!

A caveat...I got the Kindle version for the Android, which is none too forgiving when it comes to images.So diagrams look horrible on the phone (even with the DroidX's big-assed screen).It looks fine on the laptop, however.

Enjoy!

Excellent reference and study book
This book is by far the best algorithms book I've read.

Two major reasons for this: the sections include many considerations when choosing algorithms/data structures, and the number of war stories showing how such decisions were made in real situations.

I would recommend this text to anyone that writes software seriously.

Could be called "The Joy of Algorithms"
My Dad loved to cook and one of his favorite cookbooks was "The Joy of Cooking." By the time he died, the pages of his copy were stained and dusted with flour from being constantly used in his kitchen.

Why did he like it so much? Because not only did it have great recipes, it also explored the basic ingredients and methods and told interesting stories about cooking.

That's why "The Algorithm Design Manual" could be called "The Joy of Algorithms." Not only has it become my "goto" book for finding the right algorithmic approach to a problem, it is a joy to read with Skiena's "war stories" and his lively writing style.

Just like my Dad's "The Joy of Cooking" was never far from his stove, "The Algorithm Design Manual" will never be far from my computer.

Great book
As mentioned in previous reviews, this book is much more approachable than the CLRS.In particular, it's a really good book to use to brush up for interviews.I also like it because it gives a nice high-level overview of each set of algorithms as opposed to trying to give a comprehensive overview of everything. ... Read more

Product Description
Computer Algebra and Symbolic Computation: Elementary Algorithms provides a systematic approach for the algorithmic formulation and implementation of mathematical operations in computer algebra programming languages.

The viewpoint is that mathematical expressions, represented by expression trees, are the data objects of computer algebra programs, and by using a few primitive operations that analyze and construct expressions, we can implement many elementary operations from algebra, trigonometry, calculus, and differential equations.

With a minimum of prerequisites, this book is accessible and useful to students of mathematics, computer science, and other technical fields. The book contains a CD with the full, searchable text and implementations of all algorithms in Maple, Mathematica, and MuPad programming languages. ... Read more

Customer Reviews (2)

well-written guide for building a basic CAS
Excellent book covering the basics of building your own computer algebra system, together with its partner text: "Computer Algebra and Symbolic Computation: Mathematical Methods".The author presents the mathematical fundamentals, practical challenges, formulaic solutions, suggested implementations, and examples in a few programming languages appropriate for someone building their own CAS from scratch in very clear prose.The author makes extensive further reading recommendations for each topic.

At each stage of the development, the author presents the motivation for each feature of the CAS along with formal basics of the math behind the techniques.The author presents the basic practical challenges faced by the computer and algorithms in working with the math.Together, these make the text appropriate for both those with math experience moving into programming, and programmers moving towards math.The author lists step-by-step techniques from a mathematician's point of view for solving the problems, and then continues to give algorithm listings in an easily-read "Math Pseudo Language", complete with flow charts explaining the more complex algorithms.A formal computational complexity analysis of the algorithms is not included.

The author's examples are provided in Mathematica, MuPad, and Maple, but not in C-like languages.The examples, however, are function/structure-based, and are thus clear enough as to be immediately extensible to the reader's language of choice.For an engineer, the examples amount to a practical recipe. The book also contains a CD with the examples & the text of the book as a .pdf.However, this .pdf is only directly accessible to Windows users.Mac users will need to use Windows to run the included Windows app which can access the .pdf and then save it into another .pdf file to use on their Mac.(I've never seen anything like this before!The .pdf files on the CD show up as "Zero KB Symbolic links" on the Mac which don't resolve unless opened in Windows!In the end, I was able to get the .pdf onto my iPhone so I can easily carry the e-book with me when traveling.)

The author provides insight into both the mathematical and computational limitations of the algorithms, the problems caused by the limitations, and frequently gives examples for recognizing the limitations or working around them.

Finally, the author provides extensive references for further reading for details on particular topics.

In all cases, the author's mastery of English prose makes the information easily accessible, which is not at all the case with some other CAS books I've wasted money on...Speaking of price, considering the extreme niche market and the exquisiteness of the text, the combined price of the two books was worth it.

To help the potential customer (as a preview is not available), this book is the one of the two books (which can be effectively read in any order), and covers the basics of CAS's, the included Math Pseudo Language (MPL), defining mathematical expressions as data and functions, solving first order ordinary differential equations, recursion, basic indefinite symbolic integration algorithms, manipulation of general polynomial and rational expressions, and transforming exponential and trigonometric expressions with expansions and contractions.

It's possible I may one day find a more extensive text with more advanced techniques, but the two texts provide a foundation for building my own CAS.

A scholarly text and a seminal reference
Computer Algebra And Symbolic Computation: Elementary Algorithms by mathematician and computer expert Joel S. Cohen is a scholarly text and a seminal reference to the science of computer algebra and programming elementary mathematical expressions both iteratively and recursively. Structures of polynomials and rational expressions, exponential and trigonometric transformations are also covered in this solid teaching tool packed with exercises and sample code. An accompanying CD provides the student with the entire print text, useful internet hyperlinks, and complete algorithms. Highly recommended. ... Read more

Product Description
Create sound software designs with data structures that use modern object-oriented design patterns! Author Bruno Preiss presents the fundamentals of data structures and algorithms from a modern, object-oriented perspective. The text promotes object-oriented design using Java and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy. This framework clearly shows the relationships between data structures and illustrates how polymorphism and inheritance can be used effectively. Key Features of the Text
* All data structures are presented using a common framework. This shows the relationship between the data structures and how they are implemented.
* Object-oriented design patterns are used to demonstrate how a good design fits together and transcends the problem at hand.
* A single Java software design is used throughout the text to provide a better understanding of the operation of complicated data structures.
* Just-in-time presentation of mathematical analysis techniques introduces students to mathematical concepts as needed.The site includes:
* The Web Book (a hypertext version of the complete book)
* Links to the Java Source Code (all the program examples from the text)
* Opus5 Package (a Java package comprised of all the source code from the text)
* Documentation (source code documentation)
* Demo Applets (various Java applets that illustrate data structures and algorithms from the text)
* Archive (JAR format archive of the source code from the text)
* Front Matter (table of contents and preface)
* Solutions Manual (password required)
* Errata ... Read more

Customer Reviews (10)

Terribly written
I have taken several math and computer programming courses. This it the worst book I have ever been forced used. I had a hard time recalling some of the math that is used immediately, the explanations are terrible to say the least. I tried for hours to figure it out using just that book. When I got home I found a different reference and had it figure out in one minutes. So basically the problems I am assigned I have to learn from another source to do... that shouldn't be. Find another author that cares if he makes sense or not, one that doesn't assume you will understand it regardless of how it is explained.... "such is higher education these days" I wish I could slap that guy.

Average and TOO much mathematics
The initial sections of the book focus on too much mathematical formula without providing plain English examples especially in the asymptotic analysis sections.Isn't there a book out there which explains in plain simple English?It also uses misleading terms like "external nodes" and "internal nodes" when it comes to trees.I wouldn't recommend this book.(I'm only using it because it is the university text, now I wish I had my money back)

Not so much in quality
I know this book is used as a textbook in some computer engineering courses at my school. However, I do not belong to engineering, but I am a computer science undergraduate. :-) I've tried to help my friends who were having a lot of trouble implementing a binary tree. So to follow what they learned, I've looked at the book. Hmm. I sat there, and said "I'm lucky that my profs don't teach me algorithms like this." Some implementations did not make quite intuitive sense to me. Although I understood what the book was trying to illustrate, but I didn't see why such implementation would be intuitive and useful.

I used this book at school
Hi, as an undergrad engineering student, I had this book for the coursebook in my algorithms course. Honestly speaking, it's good , very readable text. I never used any of the code examples fom the book in my assignments, yet they proved rather helpfull in understanding the material. Something, that I think is missing from this book is the answeres to the problems at the end of the chapter that are not programming projects. Ading them to the book could help students a lot ( no need to relay on TA's )

decent for soft eng, bad for data structures
As a second year student, the use of design patterns (see chapter 5) bothers me. It really detracts from what the author is trying to convey.It's extremely hard to ignore them because you have to backtrack to previous chapters frequently which creates more confusion.

This book may be useful to learn the basics of software engineering.But given complexity of the design patterns in this book, it could be glossed over in one lecture.

... ... Read more

Product Description
This reference/text discusses the structure and concepts of multivariable control systems, offering a balanced presentation of theory, algorithm development, and methods of implementation.;The book contains a powerful software package - L.A.S (Linear Algebra and Systems) which provides a tool for verifying an analysis technique or control design.;Reviewing the fundamentals of linear algebra and system theory, Algorithms for Computer-Aided Design of Multivariable Control Systems: supplies a solid basis for understanding multivariable systems and their characteristics; highlights the most relevant mathematical developments while keeping proofs and detailed derivations to a minimum; emphasizes the use of computer algorithms; provides special sections of application problems and their solutions to enhance learning; presents a unified theory of linear multi-input, multi-output (MIMO) system models; and introduces new results based on pseudo-controllability and pseudo-observability indices, furnishing algorithms for more accurate internodel conversions.;Illustrated with figures, tables and display equations and containing many previously unpublished results, Algorithms for Computer-Aided Design of Multivariable Control Systems is a reference for electrical and electronics, mechanical and control engineers and systems analysts as well as a text for upper-level undergraduate, graduate and continuing-education courses in multivariable control. ... Read more

Customer Reviews (1)

comprehensive, well structured
The book presents the structure and concepts of multivariable control systems, including theory, development & implementation of algorithms.
It revises the mathematical notions required: controllability, observability, matrix calculation in a very precise & understandable manner.
Each concept is developed & deepened based on a general pattern involving presentation/procedures/examples, a summary of the chapter followed by references & applicative exercises.
It is divided into 5 main chapters:
- introduction: background material & matrix form description (MFD)
- system discretization: basic procedures such as step-invariant linearly interpolated models, etc
- system modeling: canonical forms, equivalent state space models for both single-input-single-output (SISO) and multi-input-multi-output (MIMO) systems.
- intermodel conversion: from state space models, transfer function models, Markov Parameters, etc
- system identification: identification identity, conversions from I/O samples and between discrete-time (DT) and continuous-time (CT).
3 Appendices complete the presentation:
A.Theory part of matrix algebra employed
B.Linear algebraic equations, Hessenberg transformations, Kalman decomposition,etc
C.Introduction to Linear Algebra and Systems (LAS,) a supporting design of linear control systems for implementation, and also the LAS code for specific algorithms.
2 diskettes containing the CAD package are also supplied with the book.
Conclusion: the book represents a comprehensive reference book for all professionals in multivariable control. ... Read more

Product Description
This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth’s writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.

To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.

Volume 4, Fascicle 0

This fascicle introduces what will become by far the longest chapter in The Art of Computer Programming, a chapter on combinatorial algorithms that will itself fill three full-sized volumes. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs. Combinatorial patterns or arrangements solve vast numbers of practical problems, and modern approaches to dealing with them often lead to methods that are more than a thousand times faster than the straightforward procedures of yesteryear. This fascicle primes the pump for everything that follows in the chapter, discussing first the essential ideas of combinatorics and then introducing fundamental ideas for dealing efficiently with 0s and 1s inside a machine, including Boolean basics and Boolean function evaluation. As always, the author’s exposition is enhanced by hundreds of new exercises, arranged carefully for self-instruction, together with detailed answers.

... Read more

Customer Reviews (3)

TAOCP: Volume 4 - Fascicle 0
I bought this book after a class I had in "Boolean Functions" and I must admit that the content was superb. Many interesting subjects about boolean functions, an extensive range of problems with solutions, and certainly a great deal of "food for thought" for further applications or research. All in all, a highly recommended book, and I am only wondering why volume 4 is not published in its final version (assuming that the rest of fascicles are in the same form). If you are interested in the field, just buy it.

the richness of Boolean functions
Nobody should read this book lightly. It continues the decades-long practice of Knuth's series, by furnishing a huge set of exercises in the computational field. Yet ones where the emphasis is not on writing computer programs, though he does have some problems where you are asked to do this. Instead, you have to nut out puzzles in what you might term applied number theory. A key trait of the book, and of the entire series, is that the reduction of an algorithm to source code is a relatively minor aspect.

The book differs from the first 3 volumes in the surfeit of problems. Perhaps in part because decades have elapsed since those volumes came out. During which, Knuth accrued ever more problems that he now gives us.

The focus of this book on Boolean functions can be an eye opener to some readers. You might think, naively, how difficult could the theory of Boolean functions be? Knuth shows that there is a vast level of complexity and conceptual richness lurking in such apparently simple functions. The typical computer science text that mentions Boolean functions might devote some space to examples of these. But it rarely goes deeper than explaining how to optimise, say, ORs of ANDs, where this is used for in turn optimising circuit layouts on a chip. Knuth goes way beyond this.

Granted, those are introductory CS texts, and this is not. But the average computer programmer or chip designer rarely goes beyond those in mathematical depth. And so is unlikely to have seen the material in this book.

A fresh introduction to combinatorial thinking
For those interested in combinatorial thinking, ranging from combinatorial card game puzzles to how to count the number of ways to do something, this is a great re-introduction. In this first part of the long-awaited Volume 4, Knuth tells you why he loves combinatorics and computer algorithms, and why it took him so long to publish volume 4.

Hearing it from Knuth, the fascicle basically reassured me in my personal dance with mathematics and algorithmics: there is no problem if you love these things!

I highly recommended this to few friends who were computer science students, and they really liked it. They could not stop reading it during a party at our home!

Disclaimer: This review is based on the preview version that was made available on Knuth's home page. I believe not much is changed, except that some errors should be corrected. ... Read more

Product Description
(Paperback not available in U.S. and Canada.)Amazon.com Review
If you had to buy just one text on algorithms, Introductionto Algorithms is a magnificent choice. The book begins byconsidering the mathematical foundations of the analysis of algorithmsand maintains this mathematical rigor throughout the work. The toolsdeveloped in these opening sections are then applied to sorting, datastructures, graphs, and a variety of selected algorithms includingcomputational geometry, string algorithms, parallel models ofcomputation, fast Fourier transforms (FFTs), and more.

This book'sstrength lies in its encyclopedic range, clear exposition, andpowerful analysis. Pseudo-code explanation of the algorithms coupledwith proof of their accuracy makes this book is a great resource onthe basic tools used to analyze the performance of algorithms. ... Read more

Customer Reviews (68)

Excellent Book
This book is must have for any software programmer. It is one of the best book I had ever had. It has many mathematical concepts and ppl who are mathematical geeks with software skills will love this book even more like me. This was the first book i bought from Used book section and I am extremely satisfied with the condition. I was quite skeptical when I was buying the book, but the sellers are really good with the what they promised. I am totally impressed and i really appreciate it.
Thanks Guys.

An Incredible Masterpiece (but NOT for the faint of heart)
Introduction to Algorithms is, without a doubt, a "must have" for any student going into the fields of computer science, mathematics, or engineering.

At first glance, the book appears to be impossible, but as you begin to read, everything falls into place.This book provokes the mind into working over the various problems addressed in the books as well as the theory introduced.Not only is new theory introduced, but pre-requisite knowledge is also briefed over so the reader does not become lost in the incredible depth this book extends to.

For the computer science student, this book deals extensively with data structures (heaps, queues, trees...) as well as various methods of manipulating their contents.Also, this book takes into account many practical applications for many practical algorithms, such as sorting and searching algorithms.The math covered in this book goes beyond what the typical programmer requires and pushes into the realm of hardcore systems engineering, a rather large bonus that is rarely seen in computer science texts.

For the engineering and mathematics students, as previously stated, this book covers many practical problems and solutions to them via computational methods and formulae.That's all there is to it.

On the downside, there are minor mistakes in the book which take a little thought to get over, but are not too severe.I am a final year high school student and I am having no difficulty understanding the concepts, but I find it rather bothersome to sort through the "anti-Orwell" style of writing which makes one page seem like many.The only suggestion I can make is that you have a strong mathematical foundation before attempting this book (a basic knowledge of calculus is a must)

With all being said, this book is a definite "must-have".You can't go wrong in purchasing this veritable tome of knowledge.

A student's perspective -- this book is horrible
I don't know who is paying the other critics to give this book a high rating but this book has a lot of problems.There is an insufficient number of sample problems with answers, which is a minimum requirement for any math book.The questions at the end of each chapter are not related to the examples described within the chapters.It can take hours to frame a problem and even then you are not sure if your answers are correct because you have no way to check your work. "We will leave that as an excersise for the student" -- what a cop out.

The sad part is that the material should not be impossible to learn. The authors have managed to take a difficult subject and make it worse.You know you are in trouble when your professor is also struggling with the material in the book.Whatever happened to "reaching the students".

Caution: Great book but there is a new edition
Please note that this is a great book, but that the second edition is being published; it was scheduled for September, 2001.

... seems to be selling both editions. Pleasemake sure you really want the 11 year old one. To find the others, click on the first author's name.

review
I hate this book! It is sooo hard to understand it. Even the simple concepts are described so bad that i hate opening it. I wish there was another book with simple words and easy explanation of concepts. ... Read more

Product Description
While many computer science textbooks are confined to teaching programming code and languages, Algorithms and Data Structures: The Science of Computing takes a step back to introduce and explore algorithms -- the content of the code. Focusing on three core topics: design (the architecture of algorithms), theory (mathematical modeling and analysis), and the scientific method (experimental confirmation of theoretical results), the book helps students see that computer science is about problem solving, not simply the memorization and recitation of languages. Unlike many other texts, the methods of inquiry are explained in an integrated manner so students can see explicitly how they interact. Recursion and object oriented programming are emphasized as the main control structure and abstraction mechanism, respectively, in algorithm design. Designed for the CS2 course, the book includes text exercises and has laboratory exercises at the supplemental Web site.

Features:
* Reflects the principle that computer science is not solely about learning how to speak in a programming languages
* Covers recursion, binary trees, stacks, queues, hash tables, and object-oriented algorithms
* Written especially for CS2 students
* Accompanying Web site includes lab exercises, code, and instructor's notes, ... Read more

Customer Reviews (2)

A good mix of programming and algorithms design
Algorithm and Algorithm design is a difficult topic to talk about or to learn.It is probably one of the most complex topics in the field of Computer Science and Mathematics, mostly due to its abstractness.Proof after proof, theory after theory, and complex mathematical expressions make the topic very difficult to grasp at times.The authors of Algorithms and Data Structures have taken this notion into account, and wrote this book in such a way that a Computer Science major student can relate popular programming and problems that we come across everyday to the notion of algorithm and complexity.The Java programming language is utilizes throughout the book, and the authors, D. Bladwin and G. W. Scragg, write pseudo-Java-code to demonstrate how, for example, various versions of the quicksort algorithm are coded.Programming is obviously not the focus of this book, but the code snippets are certainly a good teaching aid for the novice readers.

The book starts off with the basic ground work surrounding algorithms: what is a proof? Computer Science, Mathematics and theory, etc..It basically answers the question why anyone should bother learning about algorithms and the complexity that surrounds this topic.The authors then take a rather unique approach to the theory behind algorithms by discussing program recursion and iteration.It seems a little odd, but it turns out to be a very good way to introduce readers to topic algorithms.Recursions is a topic covered in CS1 courses, and using that as the basis and introduction to algorithm design and correctness proof really reels in the reader and makes the topic easier to grasp.

After discussing algorithms basics, and showing the readers what algorithm efficiency, etc is, the authors take on the second part of the book which covers the data structures aspects of things.List, Queues, Stacks, Trees, etc... are all covered in detail.Algorithms that were discussed earlier in the text are applied to the data structures, and the complexity of each algorithm is actually depicted thru examples, pseudocode, and followed by its mathematical analysis.The text, in general, is focused around the concept of objects, abstract data types, and core object orientation techniques, and the presented material is targeted as such.

Towards the end of the text, the authors give the readers a brief but concise overview what's to come.Topics such as complexity, the undecideability, nondeterminism and the surrounding problems such as the HALTing problem, the Traveling Salesman Problem, etc... are touched.The authors pose some very interesting questions for the readers in the context of the HALTing problem as it pertains to complier design.These problems in their general form are unsolvable, and the authors make a very good case on why we care about such problems and issues.

In addition to being a very easy text read, the authors have filled each chapter with sample problems, examples, and techniques.For the second year computer science student, or a professional interested in the field of algorithm design and complexity analysis, I highly recommend reading this text.

College level computer science textbook
"Algorithms and Data Structures: The Science of Computing" is designed as a second course computer science textbook for colleges.At this level most computer sciences classes tend to focus on programming and programming theory.While it does have some programming examples (all in Java), this book takes a more overall view and deals with the basics of algorithms and data structures.Why is this an important difference?I have seen a lot of bloated code over the years where a programmer writes a hundred or more lines of code to do something that a couple of lines could do if they only had a better understanding of algorithms.This course gives you the conceptual knowledge you need to be able to adapt to other computer languages and coding techniques as they are developed.

The book does make some assumptions about the reader.First, it assumes the reader has had an introductory course in an object-oriented programming language.As indicated earlier, all examples are in Java, but you should be able to follow along if you have had a course in any object-oriented language.Second, the book also assumes a good (but not necessarily college level) background in mathematics.

This is a foundational course in the design of algorithms, and data structures and mathematical theory to predict and verify, as well as empirical analysis to test the results."Algorithms and Data Structures: The Science of Computing" is a recommended book as a second course in a computer sciences degree as well as a foundational course for those who are trying to develop a broad basis of computer knowledge at home. ... Read more

Product Description
This monograph studies two classical computational problems: counting the elements of a finite set of combinatorial structures, and generating them at random from some probability distribution. Apart from their intrinsic interest, these problems arise naturally in many branches of mathematics and the natural sciences.

The author aims to classify the computational difficulty of these problems for various naturally occurring structures: the emphasis is on positive results that demonstrate the existence of efficient algorithms. At the heart of the monograph is a single algorithmic paradigm; simulate a Markov chain whose states are combinatorial structures. A major portion of the monograph is devoted to developing new mathematical tools for the analysis of algorithms of this kind. Among the applications presented are the first provably efficient algorithms for several important counting and generation problems. Further applications are summarized in an appendix.

This book will be of interest to researchers and graduate students in theoretical computer science, probability and statistics and theoretical physicists with an interest in Monte Carlo methods. It is a timely contribution to a fast moving field, with the immediacy and freshness of a new discovery. ... Read more

Product Description
The second book in a three volume set, this book provides a complete introduction to this topic. It presents a readable and coherent summary of the major paradigms and basic theory of semi numerical algorithms, providing a comprehensive interface between computer programming and numerical analysis.Amazon.com Review
Volume 2 of Donald Knuth's classic series The Art ofComputer Programming covers seminumerical algorithms, with topicsranging from random number generators to floating point operations andother optimized arithmetic algorithms. Truly comprehensive andmeticulously written, this book (and series) is that rarest of allcreatures--a work of authoritative scholarship in classical computerscience, but one that can be read and used profitably by virtually allworking programmers.

The book begins with fundamental questionsregarding random numbers and how to use algorithms to generatethem. Subsequent chapters demonstrate efficient computation ofsingle-precision and double-precision arithmetic calculations andmodular arithmetic. The text then presents prime factorization (whichcan be used in cryptography, for instance) and algorithms forcalculating fractions. This volume ends with algorithms for polynomialarithmetic and manipulation of power-series topics, which will benefitthose with some knowledge of calculus.

Throughout this beautifullypresented edition, Knuth incorporates hundreds of useful exercises fortrying out the algorithms. These range from simple problems to largerresearch project topics. (The book provides answers, whereappropriate, at the end of the book.) The result is a text that'ssuitable for college or graduate-level computer science courses orindividual study by programmers. Volume 2 is an indispensable part ofany working programmer's library. ... Read more

Customer Reviews (5)

Numbers: random generations and arithmetic
Volume 2 of "The Art of Computer Programming" is about random numbers and also about relearning one of the three Rs from grade school, viz. arithmetic. Each topic gets one chapter.

When you generate random numbers in Excel, or VBA, or Perl, or C using functions packaged with the software, you are really using a deterministic algorithm that is not random at all; the results do however look random and so we call them "pseudorandom".

Chapter 3 contains four main sections. First a section devoted to the linear congruence method (Xn+1=(aXn + c) mod m) of generating a pseudorandom sequence; with subsections on how to choose good values for a, c, and m. Second we get a section about how to test sequences to find if they are acceptably random or not. Third we find a section on other methods, expanding on linear congruence. Finally in a particularly fascinating section, DK provides a rigorous definition of randomness.

I haven't looked much at chapter 4 yet, on arithmetic. In it Knuth covers positional arithmetic, floating point arithmetic, multiplication and division at the machine level, prime numbers and efficient ways of investigating the primeness of very large numbers.

Again, DK is thorough and methodical. Again this is not a for dummies book. Again it is about theorems, algorithms, mechanical processes, and timeless truths. Again the exercises are a fascinating blend of the practical (investigate the random generating functions on the computers in your office) to the mathematical (he asks readers to formally prove many of the theorems he cites). And yes, again Knuth uses MIX, that wonderfully archaic fictional 60s machine language. But that should not stop readers; I use Perl.

Vincent Poirier, Tokyo

This book is a classic!
I recently modified a program I wrote so that it would do operations on polynomials with multi-precision coefficients. For this, I turned to Knuth. This 3-volume set is a great starting point for learning how to implement mathematical calculations on a machine.

Don't listen to the "Reader" from CA. This person obviously has a bone to pick with Knuth. Maybe (s)he failed one of his classes. Maybe (s)he should write his/her own book on the subject.

Legendary book
This book is the bible of coputer programming

It contains algorithms on pseudo-random sequences,algotithms on aritmetic operations on number, matrices ect.

The only drawback of this book is that all algprothms arewriteen in MIX - some kind of assembler, that make them hard to read.

Fascinating
Of course this is a classic programming text, but the book is fascinating from a mathematical point as well.The discussion of random number generation is worth the price alone.Also neat is the discussion of why numbers with lower initial digits are 'more common' in practice than those with higher initial digits, a topic I've never seen treated elsewhere.

State of the art reference for computer scientists
This book offers a stringent treatment of random number generators and algorithms not found anywhere else.It is particularly valuable for those that deal with encryption and the analysis of cyphers. The exercises add admirably to the text.References to other books in the field are extensive. The book is written in a non-wordy, but still very readable style, making it accessible to serious computer scientists at all levels.A mathematical background is necessary. ... Read more

Product Description

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.

To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published t regular intervals. Each fascicle will encompass a section or more of wholly new or evised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.

Customer Reviews (57)

great service!
I ordered these books, and they came within 2 days (I didn't pay for special mailing or handling), and were in perfect condition even thought they were supposedly "used."

Really wanted to enjoy this, but couldn't
I love reading technical books, in a wide variety of fields.I typically read technical books cover to cover, as if they were novels.I always enjoy learning a new algorithm or technique.

When I first saw this set in a bookstore (years ago), I thought it would be a great addition to my library.However, when I thumbed through it, I didn't seem to enjoy it as much as I'd hoped.It seemed to be a bit too theoretical, and not enough practical examples for my taste.

Recently, I decided to give it another chance on Amazon, thinking that I would better understand the theory after having more experience.Unfortunately, my first reaction stood-- as much as I tried to read it, I just couldn't find a section that I could enjoy or relate to.

In particular, the MIX code is a bit hard to read / follow.Personally, I would prefer a less precise but higher level pseudo-code.(Having to mentally translate the assembly code detracts from the examples.)In addition, I have a harder time relating to some of the examples, such as optimizing the merging of data from multiple tape drives.

There is no question that Knuth is a legend in Computer Science, and this is a very well written, highly regarded work in that field.I'm sure many people enjoy these books.However, this set just isn't something I personally was able to enjoy as much as I'd hoped to.

Great classic
I am an undergraduate computer science student. I picked up the Art of Computer Programming due to the authors credibility in the computer science community. I must say this series lives up to the hype of the author, it really does go deep into the art of programming. Complaints that may arise from readers of this series is that the algorithms are not directly transferable to practical situations; in other words, this is not a programming cook book with algorithms written in a high level language -- such as C++ -- rather, algorithms are written in a lower level theoretical assembly language. If you are bright and are a decent programmer, you should not have a hard time transferring the algorithms presented into a high level language regardless, so don't let that prevent you from buying the series. Remember you are learning an art and you will not be able to paint gorgeous landscapes at first, but as you train your hand, you will be able to create ascetic code that make change the world like the likes of Knuth and such.

The thing I most enjoy from this series is that I know I am reading the work of a real computer scientist. As a student of the subject, it definitely gives me a sense of how real computer scientists think and express themselves. Even his guideline for reading the series is structured in a pseudo algorithmic fashion, complete with a flow chart! Buy this book if you really want to be a top notch computer scientist... it would help having a couple years of college level computer science training before reading the series, because you can follow the topics with greater haste and clarity.

Enjoy reading the series!

- Andrew J. Ribeiro

Best Computer Science Books ever read
These are the best books in Computer Science that I have ever read. They are selected by the American Scientist as one of the twelve physical-science monographs of the twentieth century. Dr. Knuth pays attention to the very detail is easily seen by browsing the index of each book, where every auther of the reference in the book is given an English name and his/her name in his/her own language. I personally have never seen this happen in any of the books that I have ever read.

However, I also would suggest that this series are not for the faint of heart as the books get quite involved very quickly. And I believe that because Dr. Knuth is a mathematican, he probably cares about the beauty and correctness of the theories more than anything else. Therefore, for people looking for easy and readily usable examples, these books are entirely useless.

Computer Science
The Art of Programming, by Donald Knuth, is a comprehensive, multi-volume work discussing various programming algorithms and their analysis. The work was voted by American Scientist as one of the twelve best scientific monographs of the twentieth century. The author famously offered a reward of two dollars and fifty cents for anyone who found and reported an error in the text. The work features exercises of multiple difficulty levels, from basic warm up exercises to ongoing research problems, allowing the reader to work up his skill and familiarity with the material. ... Read more

Product Description

Algorithms and Programming is primarily intended for use in a first-year undergraduate course in programming. It is structured in a problem-solution format that requires the student to think through the programming process, thus developing an understanding of the underlying theory. The book is easily readable by a student taking a basic introductory course in computer science as well as useful for a graduate-level course in the analysis of algorithms and/or compiler construction.

Each self-contained chapter presents classical and well-known problems supplemented by clear and in-depth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms and much more. Students and teachers will find this both an excellent text for learning programming and a source of problems for a variety of courses.

Customer Reviews (1)

The best book for programming contests preparation I've ever read
That book doesn't contain pure algorithms theory (like Kormen's or Skiena's book), but problems (and most of them are with solutions). Every chapter starts with the simple problem, followed by some discussions of possible solutions, and after more and more challenging tasks ends with pretty tricky problems.
The book (in my opinion) is really very practical (well, it contains some theory, but not very formal) and is invaluable for those who are preparing to the programming contests or Google/Microsoft-like interviews. ... Read more

Product Description

Systematically teaches key paradigmic algorithm design methods

Provides a deep insight into randomization

Product Description
This dissertation introduces a new design for a computer-aided algorithmic music composition system. Rather than exploring specific algorithms, this study focuses on system and component design. The design introduced here is demonstrated through its implementation in athenaCL, a modular, polyphonic, poly-paradigm algorithmic music composition system in a cross-platform interactive command-line environment. The athenaCL system offers an open-source, object-oriented composition tool written in Python. The system can be scripted and embedded, and includes integrated instrument libraries, post-tonal and microtonal pitch modeling tools, multiple-format graphical outputs, and musical output in Csound, MIDI, audio file, XML, and text formats.Software design analysis is framed within a broad historical and intertextual study of the themes, approaches, and systems of computer-aided algorithmic composition (CAAC). A detailed history of the earliest experiments, as well as analysis of the foundational CAAC systems, is provided. Common problems and interpretations of CAAC are then presented in a historical and intertextual context, drawn from the writings and systems of numerous composers and developers. Toward the goal of developing techniques of comparative software analysis, a survey of system design archetypes, based on seven descriptors of CAAC systems, is presented. With this foundation, athenaCL system components are analyzed in detail. System components are divided into abstractions of musical materials, abstractions of musical procedures, and system architecture. For each component, object models, Python examples, and diagrams are provided. Further, each component is given context in terms of its compositional implications and relation to alternative and related models from the history of CAAC. ... Read more

Product Description
Ideal for graduate and senior undergraduate courses in computer arithmetic and advanced digital design, Computer Arithmetic: Algorithms and Hardware Designs, Second Edition, provides a balanced, comprehensive treatment of computer arithmetic. It covers topics in arithmetic unit design and circuit implementation that complement the architectural and algorithmic speedup techniques used in high-performance computer architecture and parallel processing. Using a unified and consistent framework, the text begins with number representation and proceeds through basic arithmetic operations, floating-point arithmetic, and function evaluation methods. Later chapters cover broad design and implementation topics-including techniques for high-throughput, low-power, fault-tolerant, and reconfigurable arithmetic. An appendix provides a historical view of the field and speculates on its future.

An indispensable resource for instruction, professional development, and research, Computer Arithmetic: Algorithms and Hardware Designs, Second Edition, combines broad coverage of the underlying theories of computer arithmetic with numerous examples of practical designs, worked-out examples, and a large collection of meaningful problems. This second edition includes a new chapter on reconfigurable arithmetic, in order to address the fact that arithmetic functions are increasingly being implemented on field-programmable gate arrays (FPGAs) and FPGA-like configurable devices. Updated and thoroughly revised, the book offers new and expanded coverage of saturating adders and multipliers, truncated multipliers, fused multiply-add units, overlapped quotient digit selection, bipartite and multipartite tables, reversible logic, dot notation, modular arithmetic, Montgomery modular reduction, division by constants, IEEE floating-point standard formats, and interval arithmetic.

Features:

* Divided into 28 lecture-size chapters
* Emphasizes both the underlying theories of computer arithmetic and actual hardware designs
* Carefully links computer arithmetic to other subfields of computer engineering
* Includes 717 end-of-chapter problems ranging in complexity from simple exercises to mini-projects
* Incorporates many examples of practical designs
* Uses consistent standardized notation throughout
* Instructor's manual includes solutions to text problems
* An author-maintained website http://www.ece.ucsb.edu/~parhami/text_comp_arit.htm contains instructor resources, including complete lecture slides ... Read more

Customer Reviews (7)

Good Book
I received the book within 3 days of the order. It was in an excellent shape. The book itself is in a great shape and explains the material beautifully.

this book is not for people who want to learn anything.
I just finished a course that used this book and I was so disgusted with the book that I felt a review was necessary. It seems that this book was written for people who already have a background in computer algorithms. The examples, where rarely provided, leave out basic information necessary to comprehend the material. The author uses notation and figures without explaning how to read them. I learned almost nothing form this book and would not suggest it to anyone. In fact, if this author has written any other books, I would stay away from them as well.

Very superficial look at computer arithmetic
Although the author does a good job at explaining arithmetic in the areas of RNS and SD arithmetic, the other topics are done very superficially.The book is a good reference, but you can find better books on understanding computer arithmetic.

The WORST book there is!
I think 2 stars rating for this book are more than it deserves.
I've bought many technical books and learned them on my own but
I've never seen a book that is so bad. Having this as class text
book and coupling with a not so good instructor, you really gets
it coming. PLEASE, STAY AWAY FROM THIS BOOK!
there many good books on this subject out there, don't torture
yourself and waste money on this terrible book. The bottom line is, the
author tries to make subjects more complicated than they
really are.

An excellent book for the ASIC architect.
I found this book to be extremely helpful in my every-day work.No where else have I found such a concise and accurate description of hardware-friendly number systems and arithmetic algorithms.It's the first place I go when I have a an arithmetic-intensive algorithm to architect.Simply put, my designs got better after I got this book. ... Read more