The Art of Computer Programming - Fundamental Algorithms; Vol.1
By: Knuth, Donald E
Language: English Publisher: United States of America -- Pearson -- 1997Edition: 3rd edDescription: xix, 652pISBN: 9780201896831Subject(s): Computer programming | Computer algorithmsDDC classification: 005.1 KNU/A
| Item type | Current location | Collection | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Book
|
Central Library General Stack (Nila Campus) | 005.1 KNU/A | Available | 07587 | ||
|
Book
|
Central Library General Stack (Nila Campus) | 005.1 KNU/A | Available | 07588 | ||
|
Book
|
Central Library General Stack (Nila Campus) | 005.1 KNU/A | Available | 07586 | ||
Reference
|
Central Library Reference (Sahyadri Campus) | Reference | 005.1 KNU/A | Not for loan | 07513 |
Table of contents:
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.