注冊 | 登錄讀書好,好讀書,讀好書!
讀書網-DuShu.com
當前位置: 首頁出版圖書科學技術計算機/網絡軟件與程序設計其他編程語言/工具計算機程序設計藝術:英文版(第1卷 基本算法)

計算機程序設計藝術:英文版(第1卷 基本算法)

計算機程序設計藝術:英文版(第1卷 基本算法)

定 價:¥248.00

作 者: (美)Donald E. Knuth著
出版社: 清華大學出版社
叢編項: 英文影印版
標 簽: 暫缺

ISBN: 9787302058144 出版時間: 2002-09-01 包裝: 精裝
開本: 23cm 頁數: 2248 字數:  

內容簡介

  《計算機程序設計藝術(中文版)(1-3卷精裝全套)》《計算機程序設計藝術》專題該套圖書共3卷,內容如下:卷1為基礎運算法則,該書以基本的編程概念和技術為開始,然后講述信息結構:計算機內信息的表示法,數據元素間的結構關系以及處理它們的有效方法。主要應用于模擬、數字方法、符號計算、軟件和系統(tǒng)設計。許多簡單和重要的運算法則和技術已添加到前一版本中,精確的初步計算部分已經修改,以適應當前趨勢。第2卷對半數值算法領域做了全面介紹,分“隨機數”和“算術”兩章。本卷總結了主要算法范例及這些算法的基本理論,廣泛剖析了計算機程序設計與數值分析間的相互聯系。第3版中特別值得注意的是Knuth對隨機數生成程序的重新處理和對形式冪級數計算的討論。卷3為分揀和搜索,這是本書的第1個修訂版,它是對計算機分揀和搜索的一流技術的最全面的研究,它擴展了卷1中數據結構的處理方法,將大小數據庫以及內存和外部存儲都包含在內。本書包括對計算機方法仔細檢查的選擇方案,和其效率的大量分析。本書該版的獨特之處在于優(yōu)化了的分揀,以及對通用散列法和排列法的新的理論論述。

作者簡介

  Donald.E.Knuth(唐納德.E.克努特,中文名高德納)是算法和程序設計技術的先驅者,是計算機排版系統(tǒng)TEX和METAFONT的發(fā)明者,他因這些成就和大量創(chuàng)造性的影響深遠的著作(19部書和160篇論文)而譽滿全球。作為斯坦福大學計算機程序設計藝術的榮譽退休教授,他當前正全神貫注于完成其關于計算機科學的史詩性的七卷集。這一偉大工程在1962年他還是加利福尼亞理工學院的研究生時就開始了。Knuth教授獲得了許多獎項和榮譽,包括美國計算機協會圖靈獎(ACMTuringAward),美國前總統(tǒng)卡特授予的科學金獎(MedalofScience),美國數學學會斯蒂爾獎(AMSSteelePrize),以及1996年11月由于發(fā)明先進技術而榮獲的備受推崇的京都獎(KyotoPrize)。Knuth教授現與其妻Jill生活于斯坦福校園內。訪問Knuth教授的個人主頁,可以獲得有關本書及本系列其他未出版圖書的更多信息:www-cs-faculty.stanford.edu/~knuth

圖書目錄

Chapter 1 Basic Concepts
1.1. Algorithms
1.2. Mathematical Preliminaries
1.2.1. Mathematical Induction
1.2.2. Numbers, Powers, and Logarithms
1.2.3. Sums and Products
1.2.4. Integer Functions and Elementary Number Theory
1.2.5. Permutations and Factorials
1.2.6. Binomial Coefficients
1.2.7. Harmonic Numbers
1.2.8. Fibonacci Numbers
1.2.9. Generating Functions
1.2.10. Analysis of an Algorithm
*1.2.11. Asymptotic Representations
*1.2.11.1. The O-notation
*1.2.11.2. Euler's summation formula
*1.2.11.3. Some asymptotic calculations
1.3. MIX 124
1.3.1. Description of MIX
1.3.2. The MIX Assembly Language
1.3.3. Applications to Permutations
1.4. Some Fundamental Programming Techniques
1.4.1. Subroutines
1.4.2. Goroutines
1.4.3. Interpretive Routines
1.4.3.1. A MIX simulator
*1.4.3.2. Trace routines
1.4.4. Input and Output
1.4.5. History and Bibliography

Chapter 2 Information Structures
2.1. Introduction
2.2. Linear Lists
2.2.1. Stacks, Queues, and Deques
2.2.2. Sequential Allocation
2.2.3. Linked Allocation
2.2.4. Circular Lists
2.2.5. Doubly Linked Lists
2 2.6. Arrays and Orthogonal Lists
2.3. Trees
2.3.1. Traversing Binary Trees
2.3.2. Binary Tree Representation of Trees
2.3.3. Other Representations of Trees
2.3.4. Basic Mathematical Properties of Trees
2.3.4.1. Free trees
2.3.4.2. Oriented trees
*2.3.4.3. The "infinity lemma"
*2.3.4.4. Enumeration of trees
2.3.4.5. Path length
*2.3.4.6. History and bibliography
2.3.5. Lists and Garbage Collection
2.4. Multilinked Structures
2.5. 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
Excerpt

Chapter 3 Random Numbers.
Introduction.
Generating Uniform Random Numbers.
The Linear Congruential Method.
Other Methods.
Statistical Tests.
General Test Procedures for Studying Random Data.
Empirical Tests.
Theoretical Tests.
The Spectral Test.
Other Types of Random Quantities.
Numerical Distributions.
Random Sampling and Shuffling.
What Is a Random Sequence?
Summary.

Chapter 4 Arithmetic.
Positional Number Systems.
Floating Point Arithmetic.
Single-Precision Calculations.
Accuracy of Floating Point Arithmetic.
Double-Precision Calculations.
Distribution of Floating Point Numbers.
Multiple Precision Arithmetic.
The Classical Algorithms.
Modular Arithmetic.
How Fast Can We Multiply?.
Radix Conversion.
Rational Arithmetic.
Fractions.
The Greatest Common Divisor.
Analysis of Euclid's Algorithm.
Factoring into Primes.
Polynomial Arithmetic.
Division of Polynomials.
Factorization of Polynomials.
Evaluation of Powers.
Evaluation of Polynomials.
Manipulation of Power Series.
Answers to Exercises.

Appendix A: Tables of Numerical Quantities.
Fundamental Constants (decimal).
Fundamental Constants (octal).
Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.

Appendix B: Index to Notations.
Index and Glossary.

Chapter 5 Sorting.
Combinatorial Properties of Permutations.
Inversions.
Permutations of a Multiset.
Runs.
Tableaux and Involutions.
Internal sorting.
Sorting by Insertion.
Sorting by Exchanging.
Sorting by Selection.
Sorting by Merging.
Sorting by Distribution.
Optimum Sorting.
Minimum-Comparison Sorting.
Minimum-Comparison Merging.
Minimum-Comparison Selection.
Networks for Sorting.
External Sorting.
Multiway Merging and Replacement Selection.
The Polyphase Merge.
The Cascade Merge.
Reading Tape Backwards.
The Oscillating Sort.
Practical Considerations for Tape Merging.
External Radix Sorting.
Two-Tape Sorting.
Disks and Drums.
Summary, History, and Bibliography.

Chapter 6 Searching.
Sequential Searching.
Searching by Comparison of Keys.
Searching an Ordered Table.
Binary Tree Searching.
Balanced Trees.
Multiway Trees.
Digital Searching.
Hashing.
Retrieval on Secondary Keys.
Answers to Exercises.

Appendix A: Tables of Numerical Quantities.
Fundamental Constants (decimal).
Fundamental Constants (octal).
Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.

Appendix B:Index to Notations.
Index and Glossary.


本目錄推薦

掃描二維碼
Copyright ? 讀書網 www.dappsexplained.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號 鄂公網安備 42010302001612號