,

Art of Computer Programming, The

Fundamental Algorithms, Volume 1

Gebonden Engels 1997 9780201896831
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.

—Byte, September 1995

I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.

—Charles Long

If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.

—Bill Gates

It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.

—Jonathan Laventhol

This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures—the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.

Specificaties

ISBN13:9780201896831
Taal:Engels
Bindwijze:Gebonden

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

<br> <br> 1. Basic Concepts. <br> <p> </p> <div style="margin-left: 0.2in;"> Algorithms. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Mathematical Preliminaries. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Mathematical Induction. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Numbers, Powers, and Logarithms. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Sums and Products. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Integer Functions and Elementary Number Theory. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Permutations and Factorials. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Binomial Coefficients. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Harmonic Numbers. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Fibonacci Numbers. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Generating Functions. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Analysis of an Algorithm. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Asymptotic Representations. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> MIX. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Description of MIX. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> The MIX Assembly Language. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Applications to Permutations. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Some Fundamental Programming Techniques. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Subroutines. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Coroutines. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Interpretive Routines. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Input and Output. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> History and Bibliography. </div> <p></p> <br> <br> 2. Information Structures. <br> <p> </p> <div style="margin-left: 0.2in;"> Introduction. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Linear Lists. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Stacks, Queues, and Deques. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Sequential Allocation. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Linked Allocation. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Circular Lists. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Doubly Linked Lists. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Arrays and Orthogonal Lists. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Traversing Binary Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Binary Tree Representation of Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Other Representations of Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Basic Mathematical Properties of Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Lists and Garbage Collection. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Multilinked Structures. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Dynamic Storage Allocation. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> History and Bibliography. </div> <p></p> <br> <br> Answers to Exercises. <br> <br> <br> Appendix A. Tables of Numerical Quantities. <br> <p> </p> <div style="margin-left: 0.2in;"> 1. Fundamental Constants (decimal). </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> 2. Fundamental Constants (octal). </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. </div> <p></p> <br> <br> Appendix B. Index to Notations. <br> <br> <br> Index and Glossary. 0201896834T02272003 <br>

Managementboek Top 100

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        Art of Computer Programming, The