Fr. 190.00

Algorithm Design: A Methodological Approach 150 Problems and - Detailed Solution

English · Hardback

Shipping usually within 3 to 5 weeks

Description

Read more










A best-seller in its French edition, this book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed at.

List of contents

Table of Contents
Preface


  1. Mathematics and Computer Science: Some Useful Notions

  2. Complexity of an Algorithm

  3. Specifications, Invariants, Iteration

  4. Reduce and Conquer, Recursion

  5. Generate and Test

  6. Branch and Bound

  7. Greedy Algorithms

  8. Divide and Conquer

  9. Dynamic Programming
Notations
List of Problems
Bibliography
Index

About the author

Patrick Bosc, Marc Guyomard, and Laurent Miclet are former professors at Enssat, Engineering school of University of Rennes, France and senior researchers at IRISA. They have taught Data Structures, Algorithmic, Databases, Formal methods, Language theory, Compiling, etc. for numerous years at the Bachelor and Master levels.

Summary

A best-seller in its French edition, this book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed at.

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.