Algorithm Design: A Methodological Approach - 150 problems and detailed solutions
Kiadás sorszáma: 1
Kiadó: Chapman and Hall
Megjelenés dátuma: 2023. január 31.
Normál ár:
Kiadói listaár:
GBP 48.99
GBP 48.99
Az Ön ára:
21 296 (20 282 Ft + 5% áfa )
Kedvezmény(ek): 10% (kb. 2 366 Ft)
A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.
Kattintson ide a feliratkozáshoz
Kattintson ide a feliratkozáshoz
Beszerezhetőség:
Becsült beszerzési idő: A Prosperónál jelenleg nincsen raktáron, de a kiadónál igen. Beszerzés kb. 3-5 hét..
A Prosperónál jelenleg nincsen raktáron.
Nem tudnak pontosabbat?
A Prosperónál jelenleg nincsen raktáron.
A termék adatai:
ISBN13: | 9781032369396 |
ISBN10: | 1032369396 |
Kötéstípus: | Puhakötés |
Terjedelem: | 820 oldal |
Méret: | 254x178 mm |
Súly: | 1460 g |
Nyelv: | angol |
Illusztrációk: | 260 Illustrations, black & white; 260 Line drawings, black & white; 197 Tables, black & white |
584 |
Témakör:
Rövid leírás:
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.
Hosszú leírás:
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.
Tartalomjegyzék:
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