Techniques for Designing and Algorithms by Douglas R. Stinso (.PDF)
File Size: 37.4 MB
Techniques for Designing and Analyzing Algorithms (Cryptography and Network Security Series) by Douglas R. Stinso
Requirements: .PDF reader, 37.4 MB | True PDF
Overview: 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.
Genre: Non-Fiction > Tech & Devices
Free Download links: