Algorithms : Design and Analysis / Mangey Ram, Preeti Malik, Sushil C. Dimri.
By: Dimri, Sushil C [author.]
.
Contributor(s): Malik, Preeti [author.] | Ram, Mangey [author.].
Material type: 
BookSeries: De Gruyter Textbook.Publisher: Berlin ; Boston : De Gruyter, [2021]Copyright date: 2021Description: 1 online resource (X, 168 p.).Content type: text Media type: computer Carrier type: online resourceISBN: 9783110693607.Subject(s): Algorithmen | Datenstrukturen | Künstliche Intelligenz | Maschinelles Lernen | COMPUTERS / Programming / Algorithms | Algorithms | Computational Theory | Computing | Theoretical Computer ScienceAdditional physical formats: No title; No titleOnline resources: Click here to access online | Click here to access online | Cover Issued also in print.Summary: 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.
restricted access online access with authorization star
http://purl.org/coar/access_right/c_16ec
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.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Jan 2024)
There are no comments for this item.