{"product_id":"algorithms-von-sushil-c-dimri-preeti-malik-und-mangey-ram","title":"Algorithms","description":"\n                                \n                \u003cp\u003eAlgorithms 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. \u003c\/p\u003e\n                                 \n                \n                \u003cp\u003eFrom the Table of Contents: \u003c\/p\u003e\n                                \n                \u003cstrong\u003e\u003c\/strong\u003e\n                                 \n                \n                \u003cp\u003eChapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. \u003c\/p\u003e\n                                \n                \u003cstrong\u003e\u003c\/strong\u003e\n                                 \n                \n                \u003cp\u003eChapter 2: Different Sorting Techniques and their analysis. \u003c\/p\u003e\n                                \n                \u003cstrong\u003e\u003c\/strong\u003e\n                                 \n                \n                \u003cp\u003eChapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. \u003c\/p\u003e\n                                \n                \u003cstrong\u003e\u003c\/strong\u003e\n                                 \n                \n                \u003cp\u003eChapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. \u003c\/p\u003e\n                                \n                \u003cstrong\u003e\u003c\/strong\u003e\n                                 \n                \n                \u003cp\u003eChapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. \u003c\/p\u003e\n                                \n                \u003cstrong\u003e\u003c\/strong\u003e\n                                 \n                \n                \u003cp\u003eChapter 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. \u003c\/p\u003e\n                            \n            \u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783110693416\"\u003e\u003ch3\u003eDesign and Analysis\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783110693416","offer_id":54527328256325,"sku":"9783110693416","price":69.95,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/c8e1fa16-a3a5-4b16-865b-15ff0f01c010.jpg?v=1780720300","url":"https:\/\/shop.autorenwelt.de\/products\/algorithms-von-sushil-c-dimri-preeti-malik-und-mangey-ram","provider":"Autorenwelt Shop","version":"1.0","type":"link"}