Items related to Fundamentals of Computer Algorithms

Fundamentals of Computer Algorithms - Softcover

 
9786202517126: Fundamentals of Computer Algorithms

Synopsis

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.

"synopsis" may belong to another edition of this title.

Search results for Fundamentals of Computer Algorithms

Stock Image

Barbuddhe, Vishwajit; Zanjat, Shraddha N.; Karmore, Bhavana S.
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
New Softcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # 26387462285

Contact seller

Buy New

US$ 62.23
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Barbuddhe, Vishwajit; Zanjat, Shraddha N.; Karmore, Bhavana S.
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
New Softcover
Print on Demand

Seller: Majestic Books, Hounslow, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Print on Demand. Seller Inventory # 393186130

Contact seller

Buy New

US$ 64.20
Convert currency
Shipping: US$ 8.63
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Seller Image

Vishwajit Barbuddhe
ISBN 10: 6202517123 ISBN 13: 9786202517126
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 64 pp. Englisch. Seller Inventory # 9786202517126

Contact seller

Buy New

US$ 47.64
Convert currency
Shipping: US$ 26.66
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Barbuddhe, Vishwajit; Zanjat, Shraddha N.; Karmore, Bhavana S.
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
New Softcover
Print on Demand

Seller: Biblios, Frankfurt am main, HESSE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. PRINT ON DEMAND. Seller Inventory # 18387462279

Contact seller

Buy New

US$ 70.36
Convert currency
Shipping: US$ 11.53
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Seller Image

Vishwajit Barbuddhe
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
New Taschenbuch
Print on Demand

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9786202517126

Contact seller

Buy New

US$ 48.83
Convert currency
Shipping: US$ 33.11
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Vishwajit Barbuddhe|Shraddha N. Zanjat|Bhavana S. Karmore
Published by LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6202517123 ISBN 13: 9786202517126
New Softcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Barbuddhe VishwajitProf. V. K. Barbudhe is working as Professor at Jagadambha College of Engg & Technology for UG & PG Dept. Years of experience 11+. He published more than 50+ papers in international journals. Worked as an internati. Seller Inventory # 385945503

Contact seller

Buy New

US$ 40.90
Convert currency
Shipping: US$ 56.79
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Vishwajit Barbuddhe
ISBN 10: 6202517123 ISBN 13: 9786202517126
New Taschenbuch

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. Neuware -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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 64 pp. Englisch. Seller Inventory # 9786202517126

Contact seller

Buy New

US$ 47.64
Convert currency
Shipping: US$ 63.76
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket