Picture 1 of 1
Gallery
Picture 1 of 1
Have one to sell?
Foundations of Algorithms, Neapolitan, Richard, Very Good Book
US $37.38
ApproximatelyRM 158.28
Condition:
“The book shows moderate/heavy wear from normal use. This book is in Acceptable Condition. All items ”... Read moreabout condition
Very Good
A book that has been read but is in excellent condition. No obvious damage to the cover, with the dust jacket included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free Economy Shipping.
Located in: Clarksville, Tennessee, United States
Delivery:
Estimated between Sat, 2 Aug and Fri, 8 Aug to 94104
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:257034104310
Item specifics
- Condition
- Very Good
- Seller Notes
- Book Title
- Foundations of Algorithms
- ISBN
- 9781284049190
About this product
Product Identifiers
Publisher
Jones & Bartlett Learning, LLC
ISBN-10
1284049191
ISBN-13
9781284049190
eBay Product ID (ePID)
177596385
Product Key Features
Number of Pages
676 Pages
Publication Name
Foundations of Algorithms
Language
English
Publication Year
2014
Subject
Machine Theory, Security / Networking, Algebra / General, Logic
Features
Revised
Type
Textbook
Subject Area
Mathematics, Computers
Format
Trade Paperback
Dimensions
Item Height
1.5 in
Item Weight
41.1 Oz
Item Length
9.3 in
Item Width
7.6 in
Additional Product Features
Edition Number
5
Dewey Edition
22
Illustrated
Yes
Dewey Decimal
518/.1
Edition Description
Revised edition
Table Of Content
Chapter1 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
Synopsis
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 © 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 Number
QA9.58.N43 2015
Item description from the seller
Seller feedback (2,245)
- u***1 (49)- Feedback left by buyer.Past monthVerified purchaseGood transaction, good guideline information.
- 7***e (450)- Feedback left by buyer.Past monthVerified purchasegreat condition ,new , really love the bible .
- 0***t (118)- Feedback left by buyer.Past monthVerified purchaseGreat quality in great condition fast shipping. A+ seller
More to explore :
- Richard Scarry Fiction & Books,
- Richard Scarry Books for Children,
- Richard Scarry Board Books Books,
- Richard Scarry Hardcover Books,
- Richard Scarry Fiction Picture Books Books,
- Fiction Books & Richard Evans Fiction,
- Nonfiction Books Fiction & Richard Simmons,
- Richard Scarry Antiquarian & Collectible Books,
- Richard Scarry Paperbacks Books Nonfiction,
- Richard Scarry Paperbacks Books in Spanish