LEADER 02940nam 2200493 450 001 9910554252103321 005 20231110230111.0 010 $a3-11-069360-7 024 7 $a10.1515/9783110693607 035 $a(CKB)4100000011768962 035 $a(DE-B1597)545598 035 $a(OCoLC)1241451913 035 $a(DE-B1597)9783110693607 035 $a(MiAaPQ)EBC6510014 035 $a(Au-PeEL)EBL6510014 035 $a(EXLCZ)994100000011768962 100 $a20211005d2021 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms $edesign and analysis /$fSushil C. Dimri, Preeti Malik, Mangey Ram 210 1$aBerlin ;$aBoston :$cDe Gruyter,$d[2021] 210 4$dİ2021 215 $a1 online resource (X, 168 p.) 225 0 $aDe Gruyter Textbook 311 $a3-11-069341-0 327 $tFrontmatter -- $tPreface -- $tContents -- $tChapter 1 Introduction -- $tChapter 2 Sorting techniques -- $tChapter 3 Algorithm design techniques -- $tChapter 4 Advanced graph algorithm -- $tChapter 5 Number theory, classification of problems, and random algorithms -- $tChapter 6 Tree and heaps -- $tChapter 7 Lab session -- $tFurther reading -- $tIndex 330 $aAlgorithms 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, Brach 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. 410 3$aDe Gruyter Textbook 606 $aComputer algorithms 615 0$aComputer algorithms. 676 $a005.1 700 $aDimri$b Sushil C.$01217346 702 $aMalik$b Preeti 702 $aRam$b Mangey 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910554252103321 996 $aAlgorithms$92815415 997 $aUNINA