Mastering Algorithms with Python : A Practical Approach to Problem Solving and Python Implementation

個数:

Mastering Algorithms with Python : A Practical Approach to Problem Solving and Python Implementation

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 277 p.
  • 言語 ENG
  • 商品コード 9798868817984

Description

Gain a solid understanding of algorithms and improve your problem-solving abilities using Python code. With practical examples and clear explanations, this book bridges the gap between dense academic texts and overly simple industry guides.

Focusing on the logic behind essential algorithms such as Breadth First Search (BFS), Depth First Search (DFS), Divide-and-Conquer, Greedy Methods, and Dynamic Programming, the book provides ample examples, from easy to more advanced. By connecting these concepts to real-world examples, such as chess strategies and the Seam Carving, the book helps readers better grasp and apply algorithms. Each chapter also includes fully implemented Python code, making it a practical reference.

Mastering Algorithms with Python is ideal for IT professionals looking to enhance their skills and approach algorithms with clarity and confidence.

What You Will Learn

·       Understand foundational algorithms such as BFS, DFS, Divide-and-Conquer, Greedy Methods, Dynamic Programming through practical examples

·       Implement algorithms in Python with step-by-step guidance and fully functional code for future reference

·       Build a solid foundation in advanced concepts such as Minimum Spanning Trees, Fast Fourier Transform, and Monte Carlo Tree Search

·       Quickly review Python essentials, including data types, flow control, generators, decorators, and classes to enhance your algorithmic understanding

Who This Book Is For

Software developers, data scientists, machine learning professionals and any curious learners about computer algorithms.

Chapter 1: Recursion.- Chapter 2: Divide and Conquer.- Chapter 3: Greedy Algorithm.- Chapter 4: Dynamic Programming.- Chapter 5: RSA Cryptosystem.- Chapter 6: Monte Carlo.- Chapter 7: A Tale of Ten Cities.- Chapter 8: Chess.- Appendix: A Quick Review of Python.- Appendix B: Environment Setup and Package Installation.- Appendix C: References.

Chenyang Shi is a Data Science manager at a leading consulting firm, specializing in applying machine learning and data science to enhance marketing and commercialization forecasting for major pharmaceutical clients. He earned his Ph.D. from Department of Applied Physics and Applied Mathematics at Columbia University (2015) and a Master s in Computer Science with a focus on Machine Learning from Georgia Institute of Technology (2020). With over a decade of Python programming experience, Chenyang is the lead author of two peer-reviewed software programs, JRgui (published at ACS Omega) and xINTERPDF (Journal of Applied Crystallography), comprising over 7,500 lines of Python code.


最近チェックした商品