Introduction to the design and analysis of algorithms / (Record no. 8988)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01699nam a2200241Ia 4500 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | NULRC |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20250520100608.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 | 9780132316811 |
040 ## - CATALOGING SOURCE | |
Transcribing agency | NULRC |
050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA 76.9.A43 .L48 2012 |
100 ## - MAIN ENTRY--PERSONAL NAME | |
Personal name | Levitin, Anany. |
Relator term | author |
245 #0 - TITLE STATEMENT | |
Title | Introduction to the design and analysis of algorithms / |
Statement of responsibility, etc. | Anany Levitin. |
250 ## - EDITION STATEMENT | |
Edition statement | Third edition. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Place of publication, distribution, etc. | Boston, Massachusetts : |
Name of publisher, distributor, etc. | Pearson, |
Date of publication, distribution, etc. | c2012 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | xxiv, 565 pages : |
Other physical details | illustrations ; |
Dimensions | 23 cm. |
365 ## - TRADE PRICE | |
Price amount | USD103.26 |
504 ## - BIBLIOGRAPHY, ETC. NOTE | |
Bibliography, etc. note | Includes bibliographical references and index. |
505 ## - FORMATTED CONTENTS NOTE | |
Formatted contents note | Fundamentals of the analysis of algorithm efficiency -- Brute force and exhaustive search -- Decrease-and-conquer -- Divide-and-conquer -- Transform-and-conquer -- Space and time trade-offs -- Dynamic programming -- Greedy technique -- Iterative improvement -- Limitations of algorithm power -- Coping with the limitations of algorithm power. |
520 ## - SUMMARY, ETC. | |
Summary, etc. | Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual. |
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 | 01/28/2014 | Purchased - Amazon | 103.26 | GC QA 76.9.A43 .L48 2012 | NULIB000006747 | 05/20/2025 | c.1 | 05/20/2025 | Books |