Op werkdagen voor 23:00 besteld, morgen in huis Gratis verzending vanaf €20

The Art of Computer Programming Volume 4 - Fascicle 4: Generating All Trees

History of combinatorial generation

Paperback Engels 2006 9780321335708
Verwachte levertijd ongeveer 7 werkdagen

Samenvatting

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 4:
This latest fascicle covers the generation of all trees, a basic topic that has surprisingly rich ties to the first three volumes of 'The Art of Computer Programming'. In thoroughly discussing this well-known subject, while providing 124 new exercises, Knuth continues to build a firm foundation for programming. To that same end, this fascicle also covers the history of combinatorial generation. Spanning many centuries, across many parts of the world, Knuth tells a fascinating story of interest and relevance to every artful programmer, much of it never before told. The story even includes a touch of suspense: two problems that no one has yet been able to solve.

Specificaties

ISBN13:9780321335708
Taal:Engels
Bindwijze:paperback
Aantal pagina's:120
Druk:1
Verschijningsdatum:1-1-2006
Hoofdrubriek:IT-management / ICT

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Geef uw waardering

Zeer goed Goed Voldoende Matig Slecht

Over Donald Knuth

Donald E. Knuth was born on January 10, 1938 in Milwaukee, Wisconsin. He studied mathematics as an undergraduate at Case Institute of Technology, where he also wrote software at the Computing Center. The Case faculty took the unprecedented step of awarding him a Master's degree together with the B.S. he received in 1960. After graduate studies at California Institute of Technology, he received a Ph.D. in Mathematics in 1963 and then remained on the mathematics faculty. Throughout this period he continued to be involved with software development, serving as consultant to Burroughs Corporation from 1960-1968 and as editor of Programming Languages for ACM publications from 1964-1967. He joined Stanford University as Professor of Computer Science in 1968, and was appointed to Stanford's first endowed chair in computer science nine years later. As a university professor he introduced a variety of new courses into the curriculum, notably Data Structures and Concrete Mathematics. In 1993 he became Professor Emeritus of The Art of Computer Programming. He has supervised the dissertations of 28 students. Knuth began in 1962 to prepare textbooks about programming techniques, and this work evolved into a projected seven-volume series entitled The Art of Computer Programming. Volumes 1-3 first appeared in 1968, 1969, and 1973. Having revised these three in 1997, he is now working full time on the remaining volumes. Approximately one million copies have already been printed, including translations into six languages.

Andere boeken door Donald Knuth

Inhoudsopgave

7. Combinatorial searching
7.2. Generating All Possibilities
7.2.1. Generating basic combinatorial patterns
7.2.1.1. Generating all n-tuples
7.2.1.2. Generating all permutations
7.2.1.3. generating all combinations
7.2.1.4. Generating all partitions
7.2.1.5. Generating all set partitions
7.2.1.6. Generating all trees
7.2.1.7. History and further references

Answers to exercises
Index and glossary

Managementboek Top 100

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        The Art of Computer Programming Volume 4 - Fascicle 4: Generating All Trees