Design and analysis of algorithms / (Record no. 8952)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01434nam a2200241Ia 4500 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | NULRC |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20250520100607.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 250520s9999 xx 000 0 und d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9788120345751 |
040 ## - CATALOGING SOURCE | |
Transcribing agency | NULRC |
050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA 76.9.A43 .M64 2012 |
100 ## - MAIN ENTRY--PERSONAL NAME | |
Personal name | Mohan, I. Chandra. |
Relator term | author |
245 #0 - TITLE STATEMENT | |
Title | Design and analysis of algorithms / |
Statement of responsibility, etc. | I. Chandra Mohan. |
250 ## - EDITION STATEMENT | |
Edition statement | Second edition. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Place of publication, distribution, etc. | New Delhi, India : |
Name of publisher, distributor, etc. | PHI Learning Private Limited, |
Date of publication, distribution, etc. | c2012 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | xiii, 186 pages : |
Other physical details | illustrations ; |
Dimensions | 24 cm. |
365 ## - TRADE PRICE | |
Price amount | USD27.33 |
504 ## - BIBLIOGRAPHY, ETC. NOTE | |
Bibliography, etc. note | Includes index. |
505 ## - FORMATTED CONTENTS NOTE | |
Formatted contents note | 1, Fundamentals -- 2. Divide-and-Conquer Methods -- 3. The Greedy Method -- 4. Set Manipulation Algorithms -- 5. Dynamic Programming -- 6. Search and Traversal Techniques -- 7. Backtracking Methods -- 8. Branch-and-Bound Methods -- 9. Algebraic Simplification and Transformation -- 10. Lower Boundary Theory and NP-Hard and NP-Complete Problems -- References -- Index. |
520 ## - SUMMARY, ETC. | |
Summary, etc. | This book, on Design and Analysis of Algorithms, in its second edition, presents a detailed coverage of the time complexity of algorithms. In this edition, a number of chapters have been modified and updated with new materials. It discusses the various design factors that make one algorithm more efficient than others, and explains how to devise the new algorithms or modify the existing ones. |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | COMPUTER ALGORITHMS |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | Library of Congress Classification |
Koha item type | Books |
Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Total checkouts | Full call number | Barcode | Date last seen | Copy number | Price effective from | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Library of Congress Classification | Computer Science | LRC - Main | National University - Manila | General Circulation | 12/12/2013 | Purchased - Amazon | 27.33 | GC QA 76.9.A43 .M64 2012 | NULIB000006711 | 05/20/2025 | c.1 | 05/20/2025 | Books |