Zustand: Brand New. Ships SAME or NEXT business day. We Ship to APO/FPO addr. Choose EXPEDITED shipping and receive in 2-5 business days within the United States. See our member profile for customer support contact info. We have an easy return policy.
EUR 37,69
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: New. 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.
Zustand: As New. Unread book in perfect condition.
Zustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 50,95
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 210.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 53,32
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 63,82
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 210.
EUR 54,91
Anzahl: 10 verfügbar
In den WarenkorbPF. Zustand: New.
Sprache: Englisch
Verlag: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. pp. 210.
EUR 50,94
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. Zustand: New. 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.
Zustand: New. 1st edition NO-PA16APR2015-KAP.
EUR 104,91
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 210 pages. 9.45x6.69x0.47 inches. In Stock.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 113,68
Anzahl: 1 verfügbar
In den WarenkorbZustand: New.
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.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New.
EUR 50,94
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: New. 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.
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.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New.
Taschenbuch. Zustand: Neu. Algorithms | Design and Analysis | Sushil C. Dimri (u. a.) | Taschenbuch | De Gruyter Textbook | X | Englisch | 2021 | De Gruyter | EAN 9783110693416 | Verantwortliche Person für die EU: Walter de Gruyter GmbH, De Gruyter GmbH, Genthiner Str. 13, 10785 Berlin, productsafety[at]degruyterbrill[dot]com | Anbieter: preigu.
Hardback. Zustand: New. Algorithms are ubiquitous in the contemporary technological world, and they ultimately consist of finite sequences of instructions used to accomplish tasks with necessary input values. This book analyses the top performing algorithms in areas as diverse as Big Data, Artificial Intelligence, Optimization Techniques and Cloud and Cyber Security Systems in order to explore their power and limitations.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 129,36
Anzahl: 3 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 155,62
Anzahl: 3 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
EUR 138,46
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: New. Algorithms are ubiquitous in the contemporary technological world, and they ultimately consist of finite sequences of instructions used to accomplish tasks with necessary input values. This book analyses the top performing algorithms in areas as diverse as Big Data, Artificial Intelligence, Optimization Techniques and Cloud and Cyber Security Systems in order to explore their power and limitations.
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms are ubiquitous in the contemporary technological world, and they ultimately consist of finite sequences of instructions used to accomplish tasks with necessary input values. This book analyses the top performing algorithms in areas as diverse as Big Data, Artificial Intelligence, Optimization Techniques and Cloud & Cyber Security Systems in order to explore their power and limitations.
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 197,26
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 150 pages. 9.45x6.69x9.61 inches. In Stock.
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Sprache: Englisch
Verlag: De Gruyter, De Gruyter Apr 2025, 2025
ISBN 10: 3110693410 ISBN 13: 9783110693416
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 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. 178 pp. Englisch.