Introduction to algorithms (Record no. 760)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03063nam a22002537a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20211113112945.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 200918b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9788120340077 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 651.8 |
| Item number | COR |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Cormen, Thomas H. |
| 245 ## - TITLE STATEMENT | |
| Title | Introduction to algorithms |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 3rd |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Name of publisher, distributor, etc. | PHI Learning Pvt. Ltd. |
| Place of publication, distribution, etc. | New Delhi |
| Date of publication, distribution, etc. | 2020 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xix, 1292 p. |
| 365 ## - TRADE PRICE | |
| Price type code | INR |
| Price amount | 2195.00 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Preface<br/>I Foundations<br/>Introduction<br/><br/>1 The Role of Algorithms in Computing<br/>2 Getting Started<br/>3 Growth of Functions<br/>4 Divide-and-Conquer<br/>5 Probabilistic Analysis and Randomized Algorithms<br/><br/>II Sorting and Order Statistics<br/>Introduction<br/><br/>6 Heapsort<br/>7 Quicksort<br/>8 Sorting in Linear Time<br/>9 Medians and Order Statistics<br/><br/>III Data Structures<br/>Introduction<br/><br/>10 Elementary Data Structures<br/>11 Hash Tables<br/>12 Binary Search Trees<br/>13 Red-Black Trees<br/>14 Augmenting Data Structures<br/><br/>IV Advanced Design and Analysis Techniques<br/>Introduction<br/><br/>15 Dynamic Programming<br/>16 Greedy Algorithms<br/>17 Amortized Analysis<br/><br/>V Advanced Data Structures<br/>Introduction<br/>18 B-Trees<br/>19 Fibonacci Heaps<br/>20 Van Emde Boas Trees<br/>21 Data Structures for Disjoint Sets<br/><br/>VI Graph Algorithms<br/>Introduction<br/><br/>22 Elementary Graph Algorithms<br/>23 Minimum Spanning Trees<br/>24 Single-Source Shortest Paths<br/>25 All-Pairs Shortest Paths<br/>26 Maximum Flow<br/><br/>VII Selected Topics<br/>Introduction<br/><br/>27 Multithreaded Algorithms<br/>28 Matrix Operations<br/>29 Linear Programming<br/>30 Polynomials and the FFT<br/>31 Number-Theoretic Algorithms<br/>32 String Matching<br/>33 Computational Geometry<br/>34 NP-Completeness<br/>35 Approximation Algorithms<br/><br/>VIII Appendix: Mathematical Background<br/>Introduction<br/>A Summations<br/>B Sets, Etc.<br/>C Counting and Probability<br/>D Matrices |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Description:<br/><br/>This internationally acclaimed textbook provides a comprehensive introduction to the modern study of computer algorithms. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and presents an algorithm, a design technique, an application area, or a related topic. The algorithms are described and designed in a manner to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.<br/><br/>The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called “Divide-and-Conquer”). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added in this edition. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer programming |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Rivest, Ronald L. |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Leiserson, Charles Eric |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | Book |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Bill No | Bill Date | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Total Checkouts | Full call number | Accession Number | Date last seen | Date checked out | Copy number | Cost, replacement price | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | Operations Management & Quantitative Techniques | 20-21/8078 | 31-08-2020 | Indian Institute of Management LRC | Indian Institute of Management LRC | General Stacks | 09/18/2020 | Bharat Book Distributors | 1644.06 | 1 | 651.8 COR | 000908 | 03/12/2021 | 03/01/2021 | 1 | 2195.00 | 09/18/2020 | Book |