Fundamentals of Computer Algorithms
| AUTHOR | Karmore, Bhavana S.; Zanjat, Shraddha N.; Barbuddhe, Vishwajit |
| PUBLISHER | LAP Lambert Academic Publishing (03/25/2020) |
| PRODUCT TYPE | Paperback (Paperback) |
Description
The book contains: Algorithms and Complexity: Asymptotic notations, orders, worst-case and average-case, amortized complexity. Basic Techniques: divide & conquer, dynamic programming, greedy method, backtracking. Branch and bound, randomization. Data Structures: heaps, search trees, union-find problems. Applications: sorting & searching, combinatorial problems. Optimization problems, computational geometric problems, string matching. Graph Algorithms: BFS and DFS, connected components. Spanning trees, shortest paths, MAX-flow. NP - completeness, Approximation algorithms.
Show More
Product Format
Product Details
ISBN-13:
9786202517126
ISBN-10:
6202517123
Binding:
Paperback or Softback (Trade Paperback (Us))
Content Language:
English
More Product Details
Page Count:
64
Carton Quantity:
110
Product Dimensions:
6.00 x 0.15 x 9.00 inches
Weight:
0.23 pound(s)
Country of Origin:
US
Subject Information
BISAC Categories
Computers | General
Descriptions, Reviews, Etc.
publisher marketing
The book contains: Algorithms and Complexity: Asymptotic notations, orders, worst-case and average-case, amortized complexity. Basic Techniques: divide & conquer, dynamic programming, greedy method, backtracking. Branch and bound, randomization. Data Structures: heaps, search trees, union-find problems. Applications: sorting & searching, combinatorial problems. Optimization problems, computational geometric problems, string matching. Graph Algorithms: BFS and DFS, connected components. Spanning trees, shortest paths, MAX-flow. NP - completeness, Approximation algorithms.
Show More
Your Price
$51.17