| 000 -LEADER |
|---|
| fixed length control field |
02502cam a2200205 i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| ISBN |
9780367228897 hardcover |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
518.1 |
| Item number |
St8597 2022 |
| 100 1# - MAIN ENTRY--AUTHOR NAME |
|---|
| Personal name |
Stinson, Douglas R. (Douglas Robert), 1956- author |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Techniques for designing and analyzing algorithms / Douglas R. Stinson. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
First edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication |
Boca Raton, FL : |
| Name of publisher |
CRC Press, |
| Year of publication |
©2022. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Number of Pages |
xiv, 430 pages : |
| Other physical details |
illustrations ; 27 cm. |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Chapman & Hall/CRC cryptography and network security series, |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Chapman & Hall/CRC cryptography and network security. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Includes bibliographical references and index. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Introduction and mathematical background -- Algorithm analysis and reductions -- Data structures -- Divide-and-conquer algorithms -- Greedy algorithms -- Dynamic programming algorithms -- Graph algorithms -- Backtracking algorithms -- Intractability and undecidability. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
"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. 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. 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. Features The first three chapters provide a mathematical review, basic algorithm analysis, and data structures. Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included. Proofs of correctness of algorithms are included when appropriate. The book presents a suitable amount of mathematical rigor. 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"-- |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Algorithms -- Textbooks. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Books |
CSU-Carig