Introduction to Algorithms (Record no. 49048)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01843nam a2200217Ia 4500 |
| 005 - DATE & TIME | |
| control field | 20250129120142.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240411s9999||||xx |||||||||||||| ||und|| |
| 020 ## - ISBN | |
| Price | 350.00 |
| International Standard Book Number | 978-0262032933 |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | School of Computer Application Library |
| 082 ## - DDC NUMBER | |
| Classification number | 005.1 |
| Book Number | COR |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Thomas H. Cormen |
| 245 #0 - TITLE STATEMENT | |
| Title | Introduction to Algorithms |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd. Edn. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc | New Delhi |
| Name of publisher, distributor, etc | PHI Learning |
| Date of publication, distribution, etc | 2001 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Pages | 1180p. |
| 500 ## - GENERAL NOTE | |
| General note | There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness.<br/><br/>The book 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 can be used as a unit of study. The algorithms are described in English and in a pseudocode designed 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 first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning. |
| 700 ## - Added Entry Personal Name | |
| Added Entry Personal Name | Charles E. Leiserson |
| 700 ## - Added Entry Personal Name | |
| Added Entry Personal Name | Ronald L. Rivest |
| 700 ## - Added Entry Personal Name | |
| Added Entry Personal Name | Clifford Stein |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Books |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Location (home branch) | Sublocation or collection (holding branch) | Date acquired | Koha issues (times borrowed) | Koha full call number | Accession No. | Koha date last seen | Koha item type | Cost, normal purchase price |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | School of Computer Application Library | School of Computer Application Library | 08.01.2010 | 1 | 005.1 COR | SCA12852 | 04.11.2024 | Books | 350.00 |