PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
EUR 55,51
Anzahl: 2 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Sprache: Englisch
Verlag: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 62,45
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 210.
Zustand: New. 2021. Paperback. . . . . . Books ship from the US and Ireland.
EUR 51,37
Anzahl: 2 verfügbar
In den WarenkorbZustand: NEW.
Zustand: New. Dr. Mangey Ram received the Ph.D. degree major in Mathematics and minor in Computer Science from G. B. Pant University of Agriculture and Technology, Pantnagar, India. He has been a Faculty Member for around ten years and has taught several core courses.
Sprache: Englisch
Verlag: De Gruyter, De Gruyter Mär 2021, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. Neuware -Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects.Walter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 178 pp. Englisch.
Sprache: Englisch
Verlag: De Gruyter, Mercury Learning And Information, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.