Description: Revised and updated, the Fourth Edition of Foundations of Algorithms continues to offer a well-balanced presentation of algorithm design, complexity of algorithms and computational complexity. Perfect for mainstream computer science students with a background in college algebra and discrete structures, this edition presents mathematical concepts using lucid explanations and a simpler notation than is found in most texts. The authors reinforce key algorithmic explanations with numerous concrete examples to help students grasp theoretical concepts. Key Features Now makes use of C ++ and Java pseudocode, helping students 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. Contains numerous examples throughout, ensuring that students have a clear grasp of the complex algorithms being discussed. A review of essential mathematical concepts is presented in three appendices.
Price: 15 USD
Location: Laurel, Maryland
End Time: 2024-08-15T18:42:49.000Z
Shipping Cost: N/A USD
Product Images
Item Specifics
All returns accepted: ReturnsNotAccepted
Publication Year: 2010
Type: Textbook
Format: Paperback
Language: English
Field of Study: Computer & IT
Publication Name: jones and bartlett learning
Author: Richard Neopolitan, Kumarss Naimipour
Features: 4th Edition
Subject: Adult & Further Education, Computer Science
