An edition of Design and Analysis of Algorithms (2018)

Design and Analysis of Algorithms

for Engineering Studies, First Edition

by and

  • 0 Ratings
  • 1 Want to read
  • 0 Currently reading
  • 0 Have read
Cover of: Design and Analysis of Algorithms by
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
  • 0 Ratings
  • 1 Want to read
  • 0 Currently reading
  • 0 Have read
Notes

Check nearby libraries

Buy this book

Last edited by Shangaranarayanee N P
October 27, 2018 | History
Edit
An edition of Design and Analysis of Algorithms (2018)

Design and Analysis of Algorithms

for Engineering Studies, First Edition

by and

  • 0 Ratings
  • 1 Want to read
  • 0 Currently reading
  • 0 Have read

This book “Design and Analysis of Algorithms”, covering various algorithm and analyzing the real word problems. It delivers various types of algorithm and its problem solving techniques. It stretches an outline on analyzing the algorithm and identifying the efficiency based on the time and space complexity. It contributes an idea over analyzing the real world problems to representing the data of the problem and applying the next level algorithm to achieve the goal of the problem.

Publish Date
Publisher
A.R. Publications, Chennai
Language
English
Pages
350

Check nearby libraries

Buy this book

Showing 1 featured edition. View all 1 editions?

Edition Availability
Cover of: Design and Analysis of Algorithms
Design and Analysis of Algorithms: for Engineering Studies, First Edition
November 2018, A.R. Publications, Chennai
Hardcover in English
  • Not in Library
Libraries near you: WorldCat

Add another edition?

Book Details

Table of Contents

UNIT I
INTRODUCTION
1.1. Notion of an Algorithm
1.2. Fundamentals of Algorithmic Problem Solving
1.3. Important Problem Types
1.4. Fundamentals of the Analysis of Algorithmic Efficiency
1.5. Mathematical analysis
1.6. Empirical analysis
1.7. Visualization
UNIT II
BRUTE FORCE AND DIVIDE-AND-CONQUER
2.1 Brute Force
2.2 Closest-Pair and Convex-Hull Problems
2.3 Exhaustive Search
2.4 Divide and Conquer Methodology
2.5 Multiplication of Large Integers
2.6 Closest-Pair and Convex - Hull Problems
UNIT III
DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE
3.1. Dynamic programming
3.2. Floyd‘salgorithm
3.3. Multi stage graph
3.4. Optimal Binary Search Trees
3.5. Knapsack Problem and Memory functions
3.6. Greedy Technique
3.7. Container loading problem
3.8. 0/1 Knapsack problem
3.9. Optimal Merge pattern
3.10. Huffman Trees
UNIT IV
ITERATIVE IMPROVEMENT
4.1 Simplex Method
4.2 Maximum-Flow Problem
4.3 Maximum Matching in Bipartite Graphs
4.4 Stable marriage Problem
UNIT V
COPING WITH THE LIMITATIONS OF ALGORITHM POWER
5.1. Lower - Bound Arguments
5.2. P, NP NP- Complete and NP Hard Problems
5.3. Backtracking
5.4. Branch and Bound
5.5. Approximation Algorithms for NP-Hard Problems

Edition Notes

Published in
Chennai, India

The Physical Object

Format
Hardcover
Number of pages
350
Dimensions
24.5 x 18 x 2 centimeters
Weight
2 kilos

ID Numbers

Open Library
OL26514340M
ISBN 13
9789387255135

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
October 27, 2018 Edited by Shangaranarayanee N P Edited without comment.
October 27, 2018 Edited by Shangaranarayanee N P Update covers
October 27, 2018 Edited by Shangaranarayanee N P Added new cover
October 27, 2018 Created by Shangaranarayanee N P Added new book.