Sprache: Englisch
Verlag: UBS Publishers' Distributors, 2008
ISBN 10: 8174766103 ISBN 13: 9788174766106
Anbieter: Ageless Pages, Cottonwood, AZ, USA
Trade Paperback. Zustand: Very Good. Slight edgewear. Munshi Premchand's stories have a moral dimension. Behind the interplay of greed, lust, ambition and sadism, there is a latent moral message that goodness and truth shall ultimately prevail.
Anbieter: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Deutschland
Broschiert. Zustand: Gut. 219 Seiten; Das Buch ist ordentlich erhalten und kann altersbedingte Gebrauchsspuren aufweisen. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 345.
Anbieter: WeBuyBooks, Rossendale, LANCS, Vereinigtes Königreich
EUR 30,20
Anzahl: 1 verfügbar
In den WarenkorbZustand: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind.
EUR 14,42
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 1st edition. 78 pages. 8.00x5.00x0.20 inches. In Stock.
Zustand: As New. Unread book in perfect condition.
Zustand: New.
EUR 54,46
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.
Paperback. 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.
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 50,78
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Zustand: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
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.
Sprache: Englisch
Verlag: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 64,79
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 210.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 56,07
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
EUR 55,16
Anzahl: 10 verfügbar
In den WarenkorbPF. Zustand: New.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 58,83
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
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 52,91
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.
EUR 84,66
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 210 pages. 9.45x6.69x0.47 inches. In Stock.
EUR 69,95
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPaperback. 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.
Anbieter: UK BOOKS STORE, London, LONDO, Vereinigtes Königreich
EUR 120,69
Anzahl: 3 verfügbar
In den WarenkorbPaperback. Zustand: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
EUR 50,79
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.