Algorithms : : Design and Analysis / / Mangey Ram, Preeti Malik, Sushil C. Dimri.
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 m...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter DG Ebook Package English 2021 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2021] ©2021 |
Year of Publication: | 2021 |
Language: | English |
Series: | De Gruyter Textbook
|
Online Access: | |
Physical Description: | 1 online resource (X, 168 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Other title: | Frontmatter -- Preface -- Contents -- Chapter 1 Introduction -- Chapter 2 Sorting techniques -- Chapter 3 Algorithm design techniques -- Chapter 4 Advanced graph algorithm -- Chapter 5 Number theory, classification of problems, and random algorithms -- Chapter 6 Tree and heaps -- Chapter 7 Lab session -- Further reading -- Index |
---|---|
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. |
Format: | Mode of access: Internet via World Wide Web. |
ISBN: | 9783110693607 9783110750720 9783110750706 9783110659061 9783110754001 9783110753776 9783110754070 9783110753837 |
DOI: | 10.1515/9783110693607 |
Access: | restricted access |
Hierarchical level: | Monograph |
Statement of Responsibility: | Mangey Ram, Preeti Malik, Sushil C. Dimri. |