Hands-On Data Structures and Algorithms with Python 2nd Edition

□ I. THÔNG TIN SẢN PHẨM
□ Mã sản phẩm : STT1779
□ Nhà xuất bản : Packt Publishing
□ Tác giả : Dr. Basant Agarwal and Benjamin Baka
□ Ngôn ngữ : Tiếng Anh
□ ISBN : 9781788995573
□ Số trang : 398 trang
□ Hình thức : Bìa Mềm, RUỘT IN ĐEN TRẮNG, BÌA IN MẪU LASER GIẤY C300 CÓ CÁN
□ Loại : Sách gia công đóng gáy keo chắc chắn chất lượng cao
□ Giấy in : Giấy ngoại định lượng 70msg, viết vẽ và highlight thoải mái.
□ Chất lượng : Bản in rõ nét, giá rất tốt cho mọi người.

□ II. MÔ TẢ SẢN PHẨM
□ 1.Mô tả sản phẩm đầy đủ
Data structures and algorithms are the core building blocks of any software application, providing the systematic way of storing and organizing data so that it can be used efficiently. Choosing the right data structure is pivotal to optimizing the performance and scalability of applications. This second edition of "Hands-On Data Structures and Algorithms with Python" will expand your understanding of key structures, including stacks, queues, and lists, and also show you how to apply priority queues and heaps in real-world scenarios. The book begins with a comprehensive introduction to the fundamental concepts of Python and the essential role of data structures in the software development lifecycle. You will learn how to analyze and compare Python algorithms using Big O notation, understanding how to choose the best algorithm for a specific problem based on its running time and computational complexity. The text delves deep into the implementation of linear data structures such as arrays, linked lists, stacks, and queues, providing clear explanations, practical examples, and optimized code snippets for each. As you progress through the chapters, the book explores more complex and powerful data structures, such as trees and graphs. You will learn about binary search trees, AVL trees, and heaps, as well as various graph traversal algorithms like Breadth-First Search (BFS) and Depth-First Search (DFS). The later chapters focus on a wide array of sorting and searching algorithms, including bubble sort, selection sort, insertion sort, merge sort, and quicksort, along with their practical applications in data processing. This edition also covers advanced topics such as dynamic programming, string matching algorithms, and utilizing the latest features of Python 3.7. You will gain confidence in organizing your code in a manageable, consistent, and scalable way, which will significantly boost your productivity as a professional Python developer. By the end of this book, you will be proficient in manipulating the most important data structures and algorithms to more efficiently store, organize, and access data in your software applications.

□ 2. Tác giả
Dr. Basant Agarwal works as an Assistant Professor at the Indian Institute of Information Technology Kota. He holds a PhD and MTech from the Department of Computer Science and Engineering, Malaviya National Institute of Technology, Jaipur, India. Basant has over 10 years of experience in academia and research and was awarded the prestigious PostDoc Fellowship by the European Research Consortium for Informatics and Mathematics through the Alain Bensoussan Fellowship Programme. He has authored multiple books and published over 50 papers in reputed conferences and journals. Benjamin Baka is a full-stack software developer with over 10 years of experience in programming across various technologies, including C++, Java, Ruby, Python, and Qt. He is a graduate of Kwame Nkrumah University of Science and Technology and is currently a technology strategist and software engineer at mPedigree Network, where he focuses on using technology to combat counterfeiting. He has a deep interest in algorithms and elegant programming techniques.