Introduction to algorithms (Record no. 11147)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02449nam a2200229 a 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9788120313538 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 8120313534 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Item number | COR |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Cormen, Thomas H. : |
| 245 ## - TITLE STATEMENT | |
| Title | Introduction to algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Cambridge, Massachusetts : |
| Name of publisher | MIT Press, |
| Year of publication | 1990. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xvii, 1028 p. : |
| Other physical details | illustrations ; |
| 500 ## - GENERAL NOTE | |
| General note | Included Index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Growth of functions --<br/>Summations --<br/>Recurrences --<br/>Sets, etc. --<br/>Counting and probability --<br/>Heapsort --<br/>Quicksort --<br/>Sorting in linear time --<br/>Medians and order statistics --<br/>Elementary data structures --<br/>Hash tables --<br/>Binary search trees --<br/>Red-black trees --<br/>Augmenting data structures --<br/>Dynamic programming --<br/>Greedy algorithms --<br/>Amortized analysis --<br/>B-trees --<br/>Binomial heaps --<br/>Fibonacci heaps --<br/>Data structures for disjoint sets --<br/>Elementary graph algorithms --<br/>Minimum spanning trees --<br/>Single-source shortest paths --<br/>All-pairs shortest paths --<br/>Maximum flow --<br/>Sorting networks --<br/>Arithmetic circuits --<br/>Algorithms for parallel computers --<br/>Matrix operations --<br/>Polynomials and the FFT --<br/>Number-theoretic algorithms --<br/>String matching --<br/>Computational geometry --<br/>NP-completeness --<br/>Approximation algorithms. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference. Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will be accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics. Each chapter is relatively self-contained and can be used as a unit of study. Algorithms are presented in a pseudocode that can be easily read by anyone familiar with Fortran, C, or Pascal. Numerous pertinent examples, figures, exercises, and case-study problems emphasize both engineering and mathematical aspects of the subject. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer programming. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer algorithms. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Algorithms. |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Leiserson, Charles E. : |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Rivest, Ronald L. : |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Reference Books |
| Collection code | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Accession Number | Koha item type |
|---|---|---|---|---|---|---|---|---|---|
| Reference | Main Library | Main Library | Reference | 25/09/2002 | Purchased | 715.00 | 005.1 COR | 007429 | Reference Books |