計算機程序設(shè)計藝術(shù)（第1卷）

內(nèi)容概要

第1卷首先介紹編程的基本概念和技術(shù)，然后詳細講解信息結(jié)構(gòu)方面的內(nèi)容，包括信息在計算機內(nèi)部的表示方法、數(shù)據(jù)元素之間的結(jié)構(gòu)關(guān)系，以及有效的信息處理方法。此外，書中還描述了編程在模擬、數(shù)值方法、符號計算、軟件與系統(tǒng)設(shè)計等方面的初級應(yīng)用。新版本增加了數(shù)十項簡單但重要的算法和技術(shù)，并根據(jù)當前研究發(fā)展趨勢在數(shù)學(xué)預(yù)備知識方面做了大量修改。

作者簡介

　　Donald.E.Knuth（唐納德.E.克努特，中文名高德納）是算法和程序設(shè)計技術(shù)的先驅(qū)者，是計算機排版系統(tǒng)TEX和METAFONT的發(fā)明者，他因這些成就和大量創(chuàng)造性的影響深遠的著作（19部書和160篇論文）而譽滿全球。作為斯坦福大學(xué)計算機程序設(shè)計藝術(shù)的榮譽退休教授，他當前正全神貫注于完成其關(guān)于計算機科學(xué)的史詩性的七卷集。這一偉大工程在1962年他還是加利福尼亞理工學(xué)院的研究生時就開始了。Knuth教授獲得了許多獎項和榮譽，包括美國計算機協(xié)會圖靈獎（ACM Turing Award），美國前總統(tǒng)卡特授予的科學(xué)金獎（Medal of Science），美國數(shù)學(xué)學(xué)會斯蒂爾獎（AMS Steele Prize），以及1996年11月由于發(fā)明先進技術(shù)而榮獲的備受推崇的京都獎（Kyoto Prize）。Knuth教授現(xiàn)與其妻Jill生活于斯坦福校園內(nèi)。

書籍目錄

Chapter 1 Basic Concepts1.1. Algorithms1.2. Mathematical Preliminaries1.2.1. Mathematical Induction1.2.2. Numbers, Powers, and Logarithms1.2.3. Sums and Products1.2.4. Integer Functions and Elementary Number Theory1.2.5. Permutations and Factorials1.2.6. Binomial Coefficients1.2.7. Harmonic Numbers1.2.8. Fibonacci Numbers1.2.9. Generating Functions1.2.10. Analysis of an Algorithm*1.2.11. Asymptotic Representations*1.2.11.1. The O-notation*1.2.11.2. Eulers summation formula*1.2.11.3. Some asymptotic calculations1.3. MIX 1241.3.1. Description of MIX1.3.2. The MIX Assembly Language1.3.3. Applications to Permutations1.4. Some Fundamental Programming Techniques1.4.1. Subroutines1.4.2. Goroutines1.4.3. Interpretive Routines1.4.3.1. A MIX simulator*1.4.3.2. Trace routines1.4.4. Input and Output1.4.5. History and BibliographyChapter 2 Information Structures2.1. Introduction2.2. Linear Lists2.2.1. Stacks, Queues, and Deques2.2.2. Sequential Allocation2.2.3. Linked Allocation2.2.4. Circular Lists2.2.5. Doubly Linked Lists2 2.6. Arrays and Orthogonal Lists2.3. Trees2.3.1. Traversing Binary Trees2.3.2. Binary Tree Representation of Trees2.3.3. Other Representations of Trees2.3.4. Basic Mathematical Properties of Trees2.3.4.1. Free trees2.3.4.2. Oriented trees*2.3.4.3. The "infinity lemma"*2.3.4.4. Enumeration of trees2.3.4.5. Path length*2.3.4.6. History and bibliography2.3.5. Lists and Garbage Collection2.4. Multilinked Structures2.5. Dynamic Storage AllocationHistory and BibliographyAnswers to ExercisesAppendix A Tables of Numerical Quantities1. Fundamental Constants (decimal)2. Fundamental Constants (octal)3. Harmonic Numbers, Bernoulli Numbers, Fibonacci NumbersAppendix B Index to NotationsIndex and GlossaryExcerptChapter 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 Euclids 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.

編輯推薦

　　為反映計算機領(lǐng)域的最新發(fā)展，Kuh二十多年來第一次將三卷書全部做了修訂。他的修訂主要集中在自上一版以來得到眾人認可的新知識，已經(jīng)解決的問題，以及有所變化的問題。為保持《計算機程序設(shè)計藝術(shù)(第1卷)(第3版)》的權(quán)威性，在必要的地方對計算機領(lǐng)域先驅(qū)工作的歷史信息做了更新為維護作者苦心孤詣追求至善至美的盛譽，新版本對讀者發(fā)現(xiàn)的少量技術(shù)性錯誤做了更正為增加《計算機程序設(shè)計藝術(shù)(第1卷)(第3版)》的挑戰(zhàn)性，作者還添加了數(shù)百道習題。本套書由3卷組成。

圖書封面

圖書標簽Tags

無

評論、評分、閱讀與下載

---

    計算機程序設(shè)計藝術(shù)（第1卷） PDF格式下載

---