Title
Algorithm Design: Foundations, Analysis, and Internet Examples,Used
Processing time: 1-3 days
US Orders Ships in: 3-5 days
International Orders Ships in: 8-12 days
Return Policy: 15-days return on defective items
Payment Option
Are you looking for something different in your Algorithms text? Are you looking for an Algorithms text that offers theoretical analysis techniques as well as design patterns and experimental methods for the engineering of algorithms? Michael Goodrich and Roberto Tamassia, authors of the successful, Data Structures and Algorithms in Java, 2/e, have written Algorithm Design, a text designed to provide a comprehensive introduction to the design, implementation and analysis of computer algorithms and data structures from a modern perspective.Written for an undergraduate, juniorsenior algorithms course this text offers several implementation case studies and uses Internet applications to motivate many topics such as hashing, sorting and searching.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: How many pages does this book have? A: This book has seven hundred twenty pages. It covers a comprehensive introduction to algorithm design and analysis.
- Q: What is the binding type of this book? A: The binding type is paperback. This makes it flexible and easy to handle during reading.
- Q: What are the dimensions of this book? A: The book measures seven point five two inches in length, one point zero four inches in width, and nine point one nine inches in height. These dimensions make it suitable for carrying and reading.
- Q: Who are the authors of this book? A: The authors are Michael Goodrich and Roberto Tamassia. They are known for their expertise in data structures and algorithms.
- Q: What topics are covered in this book? A: The book covers theoretical analysis techniques, design patterns, and experimental methods. It also uses Internet applications to motivate topics like hashing, sorting, and searching.
- Q: Is this book suitable for beginners? A: Yes, the book is suitable for undergraduates in junior-senior algorithms courses. It provides a foundational understanding of algorithms.
- Q: Can I use this book for self-study? A: Yes, this book is ideal for self-study. It includes several implementation case studies and clear explanations of complex concepts.
- Q: What is the target audience for this book? A: The target audience is undergraduate students studying algorithms. It is designed for those in junior and senior years.
- Q: Are there practical examples in this book? A: Yes, the book includes practical examples and case studies. These help illustrate the concepts and applications of algorithms.
- Q: How do I care for this book? A: To care for this book, keep it in a dry place and avoid exposing it to direct sunlight. This will help preserve its condition.
- Q: Can this book be used as a reference for professionals? A: Yes, professionals can use this book as a reference. It covers both theoretical and practical aspects of algorithm design.
- Q: Is this book safe for all readers? A: Yes, this book is safe for all readers. There are no adult themes or inappropriate content.
- Q: What if the book arrives damaged? A: If the book arrives damaged, you can contact customer service for a return or replacement. Be sure to keep the original packaging.
- Q: Does this book contain any exercises? A: Yes, the book includes exercises and problems at the end of each chapter. These are designed to reinforce learning.
- Q: What is the publication year of this book? A: The publication year is not specified in the details provided. However, it is a modern text on algorithms.
- Q: Is there a digital version available? A: The details do not specify if a digital version is available. You may need to check with the publisher for eBook options.