50 Algorithms Every Programmer Should Know
Tackle computer science challenges with classic to modern algorithms in machine learning, software design, data systems, and cryptography
$152.24
- Paperback
538 pages
- Release Date
28 April 2023
Summary
Delve into the realm of generative AI and large language models (LLMs) while exploring modern deep learning techniques, including LSTMs, GRUs, RNNs with new chapters included in this 50% new edition overhaul
Key Features
- Familiarize yourself with advanced deep learning architectures
- Explore newer topics, such as handling hidden bias in data and algorithm explainability
- Get to grips with different programming algorithms and choose the ri…
Book Details
| ISBN-13: | 9781803247762 |
|---|---|
| ISBN-10: | 1803247762 |
| Author: | Imran Ahmad, Somaieh Nikpoor |
| Publisher: | Packt Publishing Limited |
| Imprint: | Packt Publishing Limited |
| Format: | Paperback |
| Number of Pages: | 538 |
| Edition: | 2nd |
| Release Date: | 28 April 2023 |
| Weight: | 1.02kg |
| Dimensions: | 235mm x 191mm |
You Can Find This Book In
About The Author
Imran Ahmad
Imran Ahmad has been a part of cutting-edge research about algorithms and machine learning for many years. He completed his PhD in 2010, in which he proposed a new linear programming-based algorithm that can be used to optimally assign resources in a large-scale cloud computing environment. In 2017, Imran developed a real-time analytics framework named StreamSensing. He has since authored multiple research papers that use StreamSensing to process multimedia data for various machine learning algorithms. Imran is currently working at Advanced Analytics Solution Center (A2SC) at the Canadian Federal Government as a data scientist. He is using machine learning algorithms for critical use cases. Imran is a visiting professor at Carleton University, Ottawa. He has also been teaching for Google and Learning Tree for the last few years.
Returns
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.