Foundations Of Algorithms by Richard NeapolitanFoundations Of Algorithms by Richard Neapolitan

Foundations Of Algorithms

byRichard Neapolitan

Paperback | March 19, 2014

Pricing and Purchase Info


Earn 1,000 plum® points

Prices and offers may vary in store


Ships within 1-2 weeks

Ships free on orders over $25

Not available in stores


Foundations of Algorithms, Fifth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. Ideal for any computer science students with a background in college algebra and discrete structures, the text presents mathematical concepts using standard English and simple notation to maximize accessibility and user-friendliness. Concrete examples, appendices reviewing essential mathematical concepts, and a student-focused approach reinforce theoretical explanations and promote learning and retention. C++ and Java pseudocode help students better understand complex algorithms. A chapter on numerical algorithms includes a review of basic number theory, Euclid's Algorithm for finding the greatest common divisor, a review of modular arithmetic, an algorithm for solving modular linear equations, an algorithm for computing modular powers, and the new polynomial-time algorithm for determining whether a number is prime.The revised and updated Fifth Edition features an all-new chapter on genetic algorithms and genetic programming, including approximate solutions to the traveling salesperson problem, an algorithm for an artificial ant that navigates along a trail of food, and an application to financial trading. With fully updated exercises and examples throughout and improved instructor resources including complete solutions, an Instructor's Manual and PowerPoint lecture outlines, Foundations of Algorithms is an essential text for undergraduate and graduate courses in the design and analysis of algorithms.
Title:Foundations Of AlgorithmsFormat:PaperbackDimensions:676 pages, 9.25 × 7.5 × 1.38 inPublished:March 19, 2014Publisher:Jones & Bartlett LearningLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:1284049191

ISBN - 13:9781284049190

Look for similar items by category:

Table of Contents

Chapter 1: Algorithms: Efficiency, Analysis, and OrderChapter 2: Divide-and-ConquerChapter 3: Dynamic ProgrammingChapter 4: The Greedy ApproachChapter 5: BacktrackingChapter 6: Branch-and-BoundChapter 7: Introduction to Computational Complexity: The Sorting ProblemChapter 8: More Computational Complexity: The Searching ProblemChapter 9: Computational Complexity and Intractability: An Introduction to the Theory of NPChapter 10: Genetic Algorithms Chapter 11: Number-Theoretic AlgorithmsChapter 12: Introduction to Parallel Algorithms