+612 9045 4394
Hardcover
Published: 30th August 1999
ISBN: 9789810237400
Number Of Pages: 544
Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) solution of the formulated problem. One can solve a problem on its own using ad hoc techniques or follow those techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions and the context appropriate for each of them. This book advocates the study of algorithm design techniques by presenting most of the useful algorithm design techniques and illustrating them through numerous examples.
| Preface | |
| Basic Concepts and Introduction to Algorithms | |
| Basic Concepts in Algorithmic Analysis | |
| Mathematical Preliminaries | |
| Data Structures | |
| Heaps and the Disjoint Sets Data Structures | |
| Techniques Based on Recursion | |
| Induction | |
| Divide and Conquer | |
| Dynamic Programming | |
| First-Cut Techniques | |
| The Greedy Approach | |
| Graph Traversal | |
| Table of Contents provided by Blackwell. All Rights Reserved. |
ISBN: 9789810237400
ISBN-10: 9810237405
Series: Lecture Notes Series on Computing
Audience:
Tertiary; University or College
Format:
Hardcover
Language:
English
Number Of Pages: 544
Published: 30th August 1999
Country of Publication: SG
Dimensions (cm): 22.58 x 16.43
x 3.35
Weight (kg): 0.87
