Description
Price: ₹1,043.00
(as of Apr 23, 2024 18:19:09 UTC – Details)
Introduction to the Design and Analysis of Algorithms
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students’ interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
Employs an innovative and more comprehensive taxonomy of algorithm design techniques
Covers mathematical analysis of both no recursive and recursive algorithms, as well as empirical analysis and algorithm visualization
Discusses limitations of algorithms and ways to overcome them
Treats algorithms as problem-solving tools and develops algorithmic thinking by using puzzles and games
Contains over 600 exercises with hints for students and detailed solutions for instructors
New exercises and engaging puzzles
Table of Contents
1 Introduction
2 Fundamentals of the Analysis of Algorithm Efficiency
3 Brute Force and Exhaustive Search
4 Decrease-and-Conquer
5 Divide-and-Conquer
6 Transform-and-Conquer
7 Space and Time Trade-Offs
8 Dynamic Programming
9 Greedy Technique
10 Iterative Improvement
11 Limitations of Algorithm Power
12 Coping with the Limitations of Algorithm Power.
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students’ interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
Employs an innovative and more comprehensive taxonomy of algorithm design techniques
Covers mathematical analysis of both no recursive and recursive algorithms, as well as empirical analysis and algorithm visualization
Discusses limitations of algorithms and ways to overcome them
Treats algorithms as problem-solving tools and develops algorithmic thinking by using puzzles and games
Contains over 600 exercises with hints for students and detailed solutions for instructors
New exercises and engaging puzzles
Table of Contents
1 Introduction
2 Fundamentals of the Analysis of Algorithm Efficiency
3 Brute Force and Exhaustive Search
4 Decrease-and-Conquer
5 Divide-and-Conquer
6 Transform-and-Conquer
7 Space and Time Trade-Offs
8 Dynamic Programming
9 Greedy Technique
10 Iterative Improvement
11 Limitations of Algorithm Power
12 Coping with the Limitations of Algorithm Power.
Mechanical Measurements, 6e (Old Edition)
This much-anticipated revision to the definitive mechanical measurements text continues to set the standard. Emphasizing precision and clarity, the authors cover fundamental issues common to all areas of measurement in Part One, then present individual chapters on applied areas of measurement in Part Two. The text’s modular format makes it accessible to undergraduate students of most engineering disciplines, particularly mechanical engineering, aerospace engineering and engineering technology.
ASIN : B09D3J6XV6
