- Inbunden (Hardback)
- Antal sidor
- Addison Wesley
- Übers 44 Abb
- Fundamental Algorithms
- 243 x 165 x 40 mm
- Antal komponenter
- 3 v. :
- 1160 g
Du kanske gillar
The Art of Computer Programming
Volume 1: Fundamental Algorithms
Fri frakt inom Sverige för privatpersoner.
Laddas ned direkt599
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.
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.
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.
This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structuresthe 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.
Passar bra ihop
De som köpt den här boken har ofta också köpt The Art Computer Programming, Volume 4, Fascicl... av Donald E Knuth (häftad).Köp båda 2 för 1148 kr
Fler böcker av Donald E Knuth
Bloggat om The Art of Computer Programming
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.
Algorithms.Mathematical Preliminaries.Mathematical Induction.Numbers, Powers, and Logarithms.Sums and Products.Integer Functions and Elementary Number Theory.Permutations and Factorials.Binomial Coefficients.Harmonic Numbers.Fibonacci Numbers.Generating Functions.Analysis of an Algorithm.Asymptotic Representations.MIX.Description of MIX.The MIX Assembly Language.Applications to Permutations.Some Fundamental Programming Techniques.Subroutines.Coroutines.Interpretive Routines.Input and Output.History and Bibliography.
1. Basic Concepts.
2. Information Structures.
Introduction.Linear Lists.Stacks, Queues, and Deques.Sequential Allocation.Linked Allocation.Circular Lists.Doubly Linked Lists.Arrays and Orthogonal Lists.Trees.Traversing Binary Trees.Binary Tree Representation of Trees.Other Representations of Trees.Basic Mathematical Properties of Trees.Lists and Garbage Collection.Multilinked Structures.Dynamic Storage Allocation.History and Bibliography.
Answers to Exercises.
Appendix A. Tables of Numerical Quantities.
1. Fundamental Constants (decimal).2. Fundamental Constants (octal).3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.
Appendix B. Index to Notations.
Index and Glossary. 0201896834T02272003