Techniques for Designing and Analyzing Algorithms (Record no. 34602)
[ view plain ]
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
|---|---|
| ISBN | 9780367228897 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 518.1 |
| Author Mark | STI-T |
| 100 ## - MAIN ENTRY--AUTHOR | |
| Author Name | Stinson, Douglas R. |
| 245 ## - TITLE STATEMENT | |
| Title | Techniques for Designing and Analyzing Algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of Publication | Parkway New York |
| Name of publisher, distributor, etc. | Douglas R. Stinson |
| Date of publication, distribution, etc. | 2022 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Pages | 430p. |
| 490 ## - SERIES STATEMENT | |
| Series Statement | (Chapman & Hall/CRC Cryptography and Network Security Series) |
| 500 ## - GENERAL NOTE | |
| General note | Design and analysis of algorithms can be a difficult subject for students due to its sometimes-abstract nature and its use of a wide variety of mathematical tools. Here the author, an experienced and successful textbook writer, makes the subject as straightforward as possible in an up-to-date textbook incorporating various new developments appropriate for an introductory course.<br/><br/>This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented.<br/><br/>In addition, the text includes useful introductory material on mathematical background including order notation, algorithm analysis and reductions, and basic data structures. This will serve as a useful review and reference for students who have covered this material in a previous course.<br/><br/>Features<br/><br/>The first three chapters provide a mathematical review, basic algorithm analysis, and data structures<br/>Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included<br/>Proofs of correctness of algorithms are included when appropriate<br/>The book presents a suitable amount of mathematical rigor<br/>After reading and understanding the material in this book, students will be able to apply the basic design principles to various real-world problems that they may encounter in their future professional careers. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Include Index. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Book |
| Withdrawn status | Not for loan | Collection code | Permanent Location | Current Location | Shelving Location | Date acquired | Source of acquisition | Price | Inventory number | Full Call Number | Accession No./Barcode | Date last seen | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Mathematics | Air University Kharian Campus Library | Air University Kharian Campus Library | Mathematics | 02/17/2025 | Ali Book Service | 2130.00 | AU-KH 0356 | 518.1 STI-T | AUKHP0445 | 03/13/2025 | Book |