Image de Google Jackets
Vue normale Vue MARC vue ISBD

Mastering Algorithms A systematic approach to data structures and problem-solving techniques (English Edition) ['Bhandari, Prof. (Dr.) Rahul', 'Prakash Suthar, Prof. Om']

Par : Contributeur(s) : Type de matériel : TexteTexteÉditeur : BPB Publications 2025Description : pType de contenu :
Type de média :
Type de support :
ISBN :
  • 9789365899603
Sujet(s) :
Ressources en ligne : Abrégé : DescriptionAlgorithms 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
Tags de cette bibliothèque : Pas de tags pour ce titre. Connectez-vous pour ajouter des tags.
Evaluations
    Classement moyen : 0.0 (0 votes)
Nous n'avons pas d'exemplaire de ce document

DescriptionAlgorithms 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

PLUDOC

PLUDOC est la plateforme unique et centralisée de gestion des bibliothèques physiques et numériques de Guinée administré par le CEDUST. Elle est la plus grande base de données de ressources documentaires pour les Étudiants, Enseignants chercheurs et Chercheurs de Guinée.

Adresse

627 919 101/664 919 101

25 boulevard du commerce
Kaloum, Conakry, Guinée

Réseaux sociaux

Powered by Netsen Group @ 2025