
Fundamentals of Algorithmics
United States Edition
Pearson (Publisher)
Published on 19. December 1995
Book
Hardback
544 pages
978-0-13-335068-5 (ISBN)
Article exhausted; check for reprint
Description
This is an introductory-level algorithm text which includes worked examples and detailed proofs, presenting algorithms by type rather than proof. The book begins with a compact, but complete introduction to some necessary maths, and also includes a long introduction to proofs by contradiction and mathematical induction to fill the gaps that many undergraduates have in their knowledge. It then goes on to provide a thorough introduction to the analysis of algorithms, and uses coherent notation and solving recurrences. It also includes a chapter on probabilistic algorithms, and an introduction to parallel algorithms. This work is intended for use on undergraduate courses in Algorithms or Design and Analysis of Algorithms.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 100 mm
Width: 100 mm
Thickness: 100 mm
Weight
100 gr
ISBN-13
978-0-13-335068-5 (9780133350685)
Schweitzer Classification
Other editions
New editions
Book
09/1995
Pearson
€188.16
Article is exhausted; no reprint
Content
1. Preliminaries.
2. Elementary Algorithmicss.
3. Asymptotic Notation.
4. Analysis of Algorithms.
5. Some Data Structures.
6. Greedy Algorithms.
7. Divide-And-Conquer.
8. Dynamic Programming.
9. Exploring Graphs.
10. Probabilistic Algorithms.
11. Parallel Algorithms.
12. Computational Complexity.
13. Heuristic and Approximate Algorithms.
References.
Index.
2. Elementary Algorithmicss.
3. Asymptotic Notation.
4. Analysis of Algorithms.
5. Some Data Structures.
6. Greedy Algorithms.
7. Divide-And-Conquer.
8. Dynamic Programming.
9. Exploring Graphs.
10. Probabilistic Algorithms.
11. Parallel Algorithms.
12. Computational Complexity.
13. Heuristic and Approximate Algorithms.
References.
Index.