Computer Programming Art (first volume) basic algorithm 3rd edition PDF

: Network Disk Download

Content Introduction· · · · · ·

"Computer Programming Art" series of works have a profound impact on the field of computer. This series of projects, which began in 1962 and is planned to be published in 7 volumes, has now been published in 4 volumes. The American Scientist magazine used the book with Einstein's theory of relativity as the most important 12 physics books of the 20th century. Knuth is now devoting his life to the writing of this epic book. For the latest information about this book, please visit http://www-cs-faculty.stanford.edu/~knuth/taocp.html.

Author profile ...

Donald E. knuth,1938 was born January 10 in Milwaukee, Minnesota, a leading computer scientist, pioneer in algorithmic and procedural design technology, emeritus professor of computer science at Stanford University, inventor of the computer typesetting system Tex and Metafont font system, The youngest Turing Award winner. He has published and published several extensively influential books and papers in the field of computer science and mathematics.

He has received many awards and honors:

1971 The First American Computer Association (ACM) Grace Murray Hopper Award

Academician of the American Academy of Science and Arts, 1973

1974 Turing Award from the American Computer Association

1975 member of the National Academy of Sciences, Ford Award (Lester R. Ford Award), American Mathematical Association (MAA)

1979 American Science Award by President Carter

1981 elected as academician of the American Academy of Engineering

19 ...

(Expand All)

Catalog ... Chapter 1 Basic Concepts 1
1.1. Algorithms 1
1.2. Mathematical Preliminaries 10
1.2.1. Mathematical Induction 11
1.2.2. Numbers, Powers, and logarithms 21
1.2.3. Sums and Products 27
1.2.4. Integer Functions and Elementary number theory 39
1.2.5. Permutations and Factorials 45
1.2.6. Binomial coefficients 52
1.2.7. Harmonic Numbers 75
1.2.8. Fibonacci Numbers 79
1.2.9. Generating Functions 87
1.2.10. Analysis of an algorithm 96
*1.2.11. Asymptotic representations 107
*1.2.11.1. The o-notation. 107
* 1.2.11.2. Euler ' s summation Formula 111
* 1.2.11.3. Some Asymptotic Calculations 116
1.3. MIX 124
1.3.1. Description of MIX 124
1.3.2. The NIX Assembly Language 144
1.3.3. Applications to permutations 164
1.4. Some fundamental programming Techniques 180
1.4.1. Subroutines 180
1.4.2. Coroutines 193
1.4.3. Interpretive Routines 200
1.4.3.1. A NIX Simulator 202
"1.4.3.2. Trace Routines 212
1.4.4. Input and Output 215
1.4.5. History and Bibliography 229
Chapter 2 Information Structures 232
2.1. Introduction 232
2.2. Linear Lists 238
2.2.1. Stacks, Queues, and Deques 238
2.2.2. Sequential Allocation 244
2.2.3. Linked Allocation 254
2.2.4. Circular Lists 273
2.2.5. Doubly Linked Lists 280
2.2.6. Arrays and orthogonal Lists 298
2.3. Trees 308
2.3.1. Traversing Binary Trees 318
2.3.2. Binary Tree representation of Trees 334
2.3.3. Other representations of Trees 348
2.3.4. Basic mathematical Properties of Trees 362
2.3.4.1. Free Trees 363
2.3.4.2. Oriented Trees 372
*2.3.4.3. The "Infinity lemma" 382
*2.3.4.4. Enumeration of Trees 386
2.3.4.5. Path length 399
*2.3.4.6. History and Bibliography 406
2.3.5. Lists and Garbage Collection 408
2.4. multilinked Structures 424
2.5. Dynamic Storage Allocation 435
2.6. History and Bibliography 457
Answers to exercises 466
Appendix A Tables of Numerical quantities 619
1. Fundamental Constants (decimal) 619
2. Fundamental Constants (octal) 620
3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers 621
Appendix B Index to notations 623
Index and Glossary 628

: Network Disk Download

Computer Programming Art (first volume) basic algorithm 3rd edition PDF