Name: Art of Computer Programming, The: Fundamental Algorithms, Volume 1
Brand: Pearson
SKU: 2421181
Price: 552 HKD
Availability: InStock
Rating: 4.38 (1880 reviews)

The Art of Computer Programming,

Fundamental Algorithms, Volume 1

By Knuth, Donald Ervin

Rating

1,880 Ratings by Goodreads

Already own it? Write a review

Format

Hardback, 672 pages

Published

United Kingdom, 7 July 1997

A word from Don Knuth:

For the past 20 years I've been making copious notes in my personal copies of The Art of Computer Programming, whenever I've noticed how those books could be made better. Finally the time is ripe to typeset those books from scratch, using the tools of digital typography that I worked on during the 1980s. The new editions incorporate literally thousands of improvements, including hundreds of instructive new exercises and answers to exercises. I think most readers will enjoy these new things as much as I did when I first learned them. I've been especially careful to include any new historical details that have come to my attention, and to provide up-to-date information about all the research problems stated in previous editions. Computer Science has been changing and growing at a fantastic rate, yet I believe nearly everything in The Art of Computer Programming is crucial information that will never become obsolete.

This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.

Visit Knuth's Home Page

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. 0201896834T02272003

Our Price

HK$552

Elsewhere

HK$614.52

Save HK$62.52 (10%)

Ships from UK Estimated delivery date: 27th May - 3rd Jun from UK

Free Shipping Worldwide

Buy together with The Art of Computer Programming, Volume 1, Fascicle 1, at a great price!

Buy Together

HK$741

Elsewhere Price

HK$779.15

You Save HK$38.15 (5%)

Product Description

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. 0201896834T02272003

EAN

9780201896831

ISBN

0201896834

Writer

Knuth, Donald Ervin

Publisher

Pearson

Other Information

illustrations

Dimensions

24.5 x 16.9 x 3.6 centimeters (0.75 kg)

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. 0201896834T02272003

About the Author

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

Table of Contents

About the Author