Picture 1 of 1

Stock photo

Foundations of Algorithms - Picture 1 of 1

Foundations of Algorithms by Richard Neapolitan (2014, Trade Paperback)

Brenham Book Company (751)

92.7% positive feedback

Price:

$68.53

+ $4.25 shipping

Estimated delivery Thu, Sep 4 - Wed, Sep 10

Returns:

30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

Foundations of Algorithms

About this product

Product Identifiers

PublisherJones & Bartlett Learning, LLC

ISBN-101284049191

ISBN-139781284049190

eBay Product ID (ePID)177596385

Product Key Features

Number of Pages676 Pages

Publication NameFoundations of Algorithms

LanguageEnglish

Publication Year2014

SubjectMachine Theory, Security / Networking, Algebra / General, Logic

FeaturesRevised

TypeTextbook

Subject AreaMathematics, Computers

AuthorRichard Neapolitan

FormatTrade Paperback

Dimensions

Item Height1.5 in

Item Weight41.1 Oz

Item Length9.3 in

Item Width7.6 in

Additional Product Features

Edition Number5

Dewey Edition22

IllustratedYes

Dewey Decimal518/.1

Edition DescriptionRevised edition

Table Of ContentChapter1 Algorithms: Efficiency, Analysis, and Order Chapter2 Divide-and-Conquer Chapter3 Dynamic Programming Chapter4 The Greedy Approach Chapter5 Backtracking Chapter6 Branch-and-Bound Chapter7 Introduction to Computational Complexity: The Sorting Problem Chapter8 More Computational Complexity: The Searching Problem Chapter9 Computational Complexity and Intractability: An Introduction to the Theory of NP Chapter10 Genetic Algorithms Chapter11 Number-Theoretic Algorithms Chapter12 Introduction to Parallel Algorithms

SynopsisFoundations 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 Lecture Slides, Foundations of Algorithms is an essential text for undergraduate and graduate courses in the design and analysis of algorithms. The only text of its kind with a chapter on genetic algorithms Use of C++ and Java pseudocode to help students better understand complex algorithms No calculus background required Numerous clear and student-friendly examples throughout the text Fully updated exercises and examples throughout Improved instructor resources, including complete solutions, an Instructor's Manual, and Lecture Slides Intended for a one semester upper-level undergraduate or graduate course in the design and analysis of algorithms © 2015 676 pages, 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 Lecture Slides, Foundations of Algorithms is an essential text for undergraduate and graduate courses in the design and analysis of algorithms. The only text of its kind with a chapter on genetic algorithms Use of C++ and Java pseudocode to help students better understand complex algorithms No calculus background required Numerous clear and student-friendly examples throughout the text Fully updated exercises and examples throughout Improved instructor resources, including complete solutions, an Instructor's Manual, and Lecture Slides Intended for a one semester upper-level undergraduate or graduate course in the design and analysis of algorithms (c) 2015 676 pages, 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. Key features include: -The only text of its kind with a chapter on genetic algorithms -Use of C++ and Java pseudocode to help students better understand complex algorithms -No calculus background required -Numerous clear and student-friendly examples throughout the text -Fully updated exercises and examples throughout -Improved instructor resources, including complete solutions, an Instructor's Manual, and PowerPoint lecture outlines

LC Classification NumberQA9.58.N43 2015