Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Beschreibung

1. Basic Concepts.
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.


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. [...]T[...]

1. Basic Concepts.
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.


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. [...]T[...]
Details
Erscheinungsjahr: 2019
Fachbereich: Programmiersprachen
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Inhalt: Gebunden
ISBN-13: 9780201896831
ISBN-10: 0201896834
UPC: 785342896831
EAN: 0785342896831
Sprache: Englisch
Einband: Gebunden
Autor: Knuth, Donald
Auflage: 3rd edition
Hersteller: Pearson Education
Verantwortliche Person für die EU: Pearson Education, St.-Martin-Str. 82, D-81541 München, salesde@pearson.com
Maße: 246 x 169 x 40 mm
Von/Mit: Donald Knuth
Erscheinungsdatum: 30.07.1997
Gewicht: 1,141 kg
Artikel-ID: 107148695

Ähnliche Produkte