Art of computer programming.Vol 1,Fundamental algorithms
副标题：无
分类号：
ISBN：9787115232595
微信扫一扫,移动浏览光盘
简介
《计算机程序设计艺术》系列被公认为计算机科学领域的权威之作，
深入阐述了程序设计理论，对计算机领域的发展有着极为深远的影响。本
书是该系列的第1卷，讲解基本算法，其中包含了其他各卷都需用到的基本
内容。本卷从基本概念开始，然后讲述信息结构，并辅以大量的习题及答
案。
本书适合从事计算机科学、计算数学等各方面工作的人员阅读，也适
合高等院校相关专业的师生作为教学参考书，对于想深入理解计算机算法
的读者，是一份必不可少的珍品。
目录
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
1.3.1 Description of MIX
1.3.2 The NIX Assembly Language
1.3.3 Applications to Permutations
1.4 Some Fundamental Programming Techniques
1.4.1 Subroutines
1.4.2 Coroutines
1.4.3 Interpretive Routines
1.4.3.1 A NIX 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
2.6 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
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
1.3.1 Description of MIX
1.3.2 The NIX Assembly Language
1.3.3 Applications to Permutations
1.4 Some Fundamental Programming Techniques
1.4.1 Subroutines
1.4.2 Coroutines
1.4.3 Interpretive Routines
1.4.3.1 A NIX 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
2.6 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
Art of computer programming.Vol 1,Fundamental algorithms
- 名称
- 类型
- 大小
光盘服务联系方式: 020-38250260 客服QQ：4006604884
云图客服：
用户发送的提问，这种方式就需要有位在线客服来回答用户的问题，这种 就属于对话式的,问题是这种提问是否需要用户登录才能提问
Video Player
×
Audio Player
×
pdf Player
×
