| 000 | 03009cam a2200289zu 4500 | ||
|---|---|---|---|
| 001 | 88971662 | ||
| 003 | FRCYB88971662 | ||
| 005 | 20251020124041.0 | ||
| 006 | m o d | ||
| 007 | cr un | ||
| 008 | 251020s2025 fr | o|||||0|0|||eng d | ||
| 020 | _a9789365899603 | ||
| 035 | _aFRCYB88971662 | ||
| 040 |
_aFR-PaCSA _ben _c _erda |
||
| 100 | 1 | _aBhandari, Prof. (Dr.) Rahul | |
| 245 | 0 | 1 |
_aMastering Algorithms _bA systematic approach to data structures and problem-solving techniques (English Edition) _c['Bhandari, Prof. (Dr.) Rahul', 'Prakash Suthar, Prof. Om'] |
| 264 | 1 |
_bBPB Publications _c2025 |
|
| 300 | _a p. | ||
| 336 |
_btxt _2rdacontent |
||
| 337 |
_bc _2rdamdedia |
||
| 338 |
_bc _2rdacarrier |
||
| 650 | 0 | _a | |
| 700 | 0 | _aBhandari, Prof. (Dr.) Rahul | |
| 700 | 0 | _aPrakash Suthar, Prof. Om | |
| 856 | 4 | 0 |
_2Cyberlibris _uhttps://international.scholarvox.com/netsen/book/88971662 _qtext/html _a |
| 520 | _aDescriptionAlgorithms are the foundational language of computing, driving everything from efficient search engines to complex machine learning. Acquiring them is essential for any developer or computer scientist seeking to build high-performance, scalable software.The book explores the fundamental data structures like arrays, stacks, queues, linked lists, hashing, and various trees, as well as binomial and Fibonacci heaps. With this foundation, you will explore a wide range of sorting and searching algorithms, from simple methods to more advanced techniques like radix sort and exponential search. You will gain a deep understanding of general methods and applications of divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound, each explained with classic examples.By the end of this book, you will possess the knowledge and skills needed to tackle challenges head-on, whether in academia or the ever-evolving landscape of technology. You will be prepared for the challenges of building robust software in any professional setting.What you will learn? Analyze algorithm and program performance metrics.? Master fundamental data structures for efficiency.? Understand sorting algorithms like quick sort, merge sort.? Explore searching techniques like binary search.? Apply divide and conquer for problem-solving.? Design greedy algorithms for optimization tasks.? Implement graph algorithms for network analysis.Who this book is forThis book is for students, programmers, and coders who have a foundational understanding of programming. Readers should be comfortable with basic syntax and logic to fully engage with the algorithmic concepts and their implementations.Table of Contents1. Algorithm and Program Performance2. Review of Data Structures3. Sorting Algorithms4. Searching Algorithms5. Divide and Conquer6. Greedy Algorithms7. Dynamic Programming8. Backtracking9. Branch and Bound10. Graph Algorithms11. Computational Complexity12. Other Advanced AlgorithmsAPPENDIX: Most Frequently Asked Questions | ||
| 999 |
_c1556198 _d1556198 |
||