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.
Sprache
Produkt-Hinweis
Broschur/Paperback
Klebebindung
Maße
Höhe: 220 mm
Breite: 150 mm
Dicke: 4 mm
Gewicht
ISBN-13
978-620-2-51712-6 (9786202517126)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
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.
