MARC details
| 000 -LEADER |
|---|
| fixed length control field |
01959nam a2200241Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520102819.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 |
9781634870214 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 76.9 .A76 2015 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Arora, Amrinder |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Analysis and design of algorithms / |
| Statement of responsibility, etc. |
Amrinder Arora |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Second edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
[San Diego, California] : |
| Name of publisher, distributor, etc. |
Cognella Academic Publishing, |
| Date of publication, distribution, etc. |
c2015 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xvii, 140 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
26 cm. |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD75.05 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Section I: The Basics -- Section II: Algorithm Design Techniques -- Section III: Intrinsic Hardiness of Problems -- Section IV: Conclusions and Auxiliary Materials. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Analysis and Design of Algorithms provides a structured view of algorithm design techniques in a concise, easy-to-read manner. The book was written with an express purpose of being easy — to understand, read, and carry. It presents a pioneering approach in the teaching of algorithms, based on learning algorithm design techniques, and not merely solving a collection of problems. This allows students to master one design technique at a time and apply it to a rich variety of problems. Analysis and Design of Algorithms covers the algorithmic design techniques of divide and conquer, greedy, dynamic programming, branch and bound, and graph traversal. For each of these techniques, there are templates and guidelines on when to use and not to use each technique. Many sections contain innovative mnemonics to aid the readers in remembering the templates and key takeaways. Additionally, the book covers NP-completeness and the inherent hardness of problems. The third edition includes a new section on polynomial multiplication, as well as additional exercise problems, and an updated appendix. |
| 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 |
