Product details:
ISBN13: | 9781032369396 |
ISBN10: | 1032369396 |
Binding: | Paperback |
No. of pages: | 820 pages |
Size: | 254x178 mm |
Weight: | 1460 g |
Language: | English |
Illustrations: | 260 Illustrations, black & white; 260 Line drawings, black & white; 197 Tables, black & white |
575 |
Category:
Applied mathematics
Theory of computing, computing in general
System organization
Computer programming in general
Software development
High-level programming
Programming in general
Applied mathematics (charity campaign)
Theory of computing, computing in general (charity campaign)
System organization (charity campaign)
Computer programming in general (charity campaign)
Software development (charity campaign)
High-level programming (charity campaign)
Programming in general (charity campaign)
Algorithm Design: A Methodological Approach - 150 problems and detailed solutions
Edition number: 1
Publisher: Chapman and Hall
Date of Publication: 31 January 2023
Normal price:
Publisher's listprice:
GBP 48.99
GBP 48.99
Your price:
18 929 (18 028 HUF + 5% VAT )
discount is: 20% (approx 4 732 HUF off)
Discount is valid until: 30 June 2024
The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
Click here to subscribe.
Click here to subscribe.
Availability:
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Can't you provide more accurate information?
Not in stock at Prospero.
Short description:
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.
Long description:
A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutions.
Table of Contents:
Table of Contents
Preface
- Mathematics and Computer Science: Some Useful Notions
- Complexity of an Algorithm
- Specifications, Invariants, Iteration
- Reduce and Conquer, Recursion
- Generate and Test
- Branch and Bound
- Greedy Algorithms
- Divide and Conquer
- Dynamic Programming
Notations
List of Problems
Bibliography
Index