00000nam a22000008i 4500 UP-1685675941131444504 Buklod 20231012141100.0 m q z ta 231012s2022 flua r b|001 0|eng 9780367228897 (hbk) 21943517 BC-73873 New Century Books Php 5,845.50 Requested by the Department of Mathematics and Computer Science DLC BAG rda eng QA 9.58 S75 2022 Stinson, Douglas R. (Douglas Robert) 1956- author. Techniques for designing and analyzing algorithms Douglas R. Stinson. Boca Raton, FL CRC Press, an imprint of the Taylor & Francis Group 2022. xiv, 430 pages illustrations 26 cm text rdacontent unmediated rdamedia volume rdacarrier "A Chapman & Hall book" Includes bibliographical references and index. 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. "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"--Provided by publisher. Algorithms Textbooks. FO UPBAG UPBAG-MAIN QA 9.58 S75 2022 Book