Foundations of Algorithms Using C++ Pseudocode

ISBN-10: 0763723878

ISBN-13: 9780763723873

Edition: 3rd 2004 (Revised)

List price: $141.95
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description:

Foundations of Algorithms Using C++ Pseudocode, Third Editionnbsp;offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity. The volumenbsp;is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices.nbsp;Thenbsp;authors alsonbsp;reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts. After Foundations of Algorithms using C++ Pseudocode, Third Edition introduces students to algorithms and analysis of algorithms innbsp;Chapter 1, the authors have developed separate chapters on the divide-and-conquer approach, dynamic programming, greedy algorithms, backtracking algorithms, and branch-and-bound algorithms. Immediately after, the author'snbsp;explore analysis of problems, and in particular, a chapter on analyzing the sorting problem followed by one on analyzing the searching problem. Following this progression, the authors introduce the theory of NP in a rigorous but yet intuitive, lucid fashion. It is at this point that the book then takes a shift in pedagogy and presents a chapter that is concerned with solving a certain type of problem rather than algorithms that share a common technique. Specifically, numerical algorithms are discussed, as well as the inclusion ofnbsp;the new polynomial-time algorithm for determining whether a number is prime. Finally, the authors provide anbsp;final chapter concerning parallel algorithms and applications to cryptography.
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $141.95
Edition: 3rd
Copyright year: 2004
Publisher: Jones & Bartlett Learning, LLC
Publication date: 7/29/2003
Binding: Hardcover
Pages: 617
Size: 7.75" wide x 9.50" long x 1.00" tall
Weight: 2.486
Language: English

Richard E. Neapolitan is professor and Chair of Computer Science at Northeastern Illinois University. He has previously written four books including the seminal 1990 Bayesian network text Probabilistic Reasoning in Expert Systems. More recently, he wrote the 2004 text Learning Bayesian Networks, the textbook Foundations of Algorithms, which has been translated to three languages and is one of the most widely-used algorithms texts world-wide, and the 2007 text Probabilistic Methods for Financial and Marketing Informatics (Morgan Kaufmann Publishers).

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×