3 Review(s)

The Algorithm Design Manual is the second edition of the classic book that deals with algorithm designs and their efficiency. Summary Of The Book A set of steps that leads to the desired result is known as an algorithm. Algorithms are well defined procedures that form an essential part of all computer programs. The structured steps of an algorithm first process the data and then lead to the desired result. So, an algorithm that produces the desired result in the least possible steps is considered to be the best algorithm design. The Algorithm Design Manual is a comprehensive manual on designing algorithms. It provides the basic concepts of designing algorithms as well as resources where the designer can look for an existing algorithm design. Designed for students as well as computer professionals, this book provides access to combinatorial algorithms technology. It is well organized into two sections: Techniques and Resources. The first section explores the fundamental basics of already available designs. It is a guide to the techniques employed for algorithm designs and provides an analysis of computer algorithms. It discusses algorithm related concepts such as backtracking, heuristics, data structures, dynamic programming, and depth-first search. The second section of the book provides extensive coverage of resources. Here the students get to know how to locate existing algorithm designs according to specific problems. It consists of a full-fledged catalog comprising various resources for algorithm, implementation, and a comprehensive bibliography. There are a large number of algorithms that can be used to design any sort of application. An algorithm designer needs to be aware of how to use these repositories and this book provides that knowledge. The second edition of The Algorithm Design Manual comes loaded with additional tutorial material and exercises as compared to the previous edition. This updated and revised edition can serve not just as a textbook for students but also as a reference guide for researchers and programmers. There are various new additions in the second edition such as a catalog of 75 common algorithmic problems. It offers new case studies that give examples from the real world. The other topics covered here are sorting and searching, weighted graph algorithms, and graph traversal. It provides complete online support for lectures and the website component is completely improved to include lecture slides. Moreover, the author has provided up-to-date links for the best algorithm implementations available in Java, C, and C++. The Algorithm Design Manual is used as a textbook at undergraduate level and as a reference text to prepare for job interviews in IT industry. About Steven S. Skiena Steven S. Skiena is a professor at Stony Brook University and is a co-founder of General Sentiment. Skiena has authored numerous books on subjects related to mathematics, programming, and algorithms. Some of his other published books are Programming Challenges: The Programming Contest Training Manual, Calculated Bets: Computers, Gambling, and Mathematical Modeling to Win, and Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Born in 1961, Skiena studied at the University of Illinois at Urbana-Champaign. His favorite research topic is algorithm design. He was involved in the conception of the Apple iPad. Besides being a distinguished faculty of Computer Science at Stony Brook University, he has also co-founded a company called General Sentiment that is a news analytics and social media company.