EUR 33,43
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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 47,23
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 48,36
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 50,68
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Condizione: 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.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Lingua: Inglese
Editore: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 210.
Lingua: Inglese
Editore: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Da: Majestic Books, Hounslow, Regno Unito
EUR 61,57
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 210.
EUR 50,89
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 52,08
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 54,71
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 56,96
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Lingua: Inglese
Editore: Walter de Gruyter, Incorporated, 2021
ISBN 10: 3110693410 ISBN 13: 9783110693416
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 63,61
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 210.
EUR 50,90
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Da: UK BOOKS STORE, London, LONDO, Regno Unito
EUR 117,16
Quantità: 3 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Brand New! Fast Delivery "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 4-6 Working days .and we do have flat rate for up to 2LB. Extra shipping charges will be requested This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Da: moluna, Greven, Germania
EUR 56,40
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.