Fundamentals of Computer Algorithms - Barbuddhe, Vishwajit;Zanjat, Shraddha N.;Karmore, Bhavana S.
28,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
14 °P sammeln
  • Broschiertes Buch

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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
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.
Autorenporträt
Prof. Vishwajit Barbuddhe is currently working as Assistant Professor in Jagadambha College of Engineering & Tech., Yavatmal, having 11 Years of Teaching experience. He has published 45 research paper in International Journals & presented 6 research paper in International Conference. His area of interest is Digital Image Processing & networking.