04565nam a22006255i 4500 978-3-031-42209-6 DE-He213 20251030111401.0 cr nn 008mamaa 240124s2024 sz | s |||| 0|eng d 9783031422096 978-3-031-42209-6 10.1007/978-3-031-42209-6 doi QA76.9.D35 Q350-390 UMB bicssc GPF bicssc COM021000 bisacsh UMB thema GPF thema Lee, Kent D. author. aut http://id.loc.gov/vocabulary/relators/aut 69865 Data Structures and Algorithms with Python [electronic resource] : With an Introduction to Multiprocessing / by Kent D. Lee, Steve Hubbard. 2nd ed. 2024. Cham : Springer International Publishing : Imprint: Springer, 2024. XVI, 398 p. 156 illus., 144 illus. in color. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Undergraduate Topics in Computer Science, 2197-1781 1. Python Programming 101 -- 2. Computational Complexity -- 3. Recursion -- 4. Sequences -- 5. Sets and Maps -- 6. Trees -- 7. Graphs -- 8. Membership Structures -- 9. Heaps -- 10. Balanced Binary Search Trees -- 11. B-Trees -- 12. Heuristic Search. This textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently. Project-oriented and classroom-tested, the book presents a number of important algorithms—supported by motivating examples—that bring meaning to the problems faced by computer programmers. The idea of computational complexity is introduced, demonstrating what can and cannot be computed efficiently at scale, helping programmers make informed judgements about the algorithms they use. The easy-to-read text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python. Topics and features: Includes introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective courses Provides learning goals, review questions, and programming exercises in each chapter, as well as numerous examples Presents a primer on Python for those coming from a different language background Adds a new chapter on multiprocessing with Python using the DragonHPC multinode implementation of multiprocessing (includes a tutorial) Reviews the use of hashing in sets and maps, and examines binary search trees, tree traversals, and select graph algorithms Offers downloadable programs and supplementary files at an associated website to help students Students of computer science will find this clear and concise textbook invaluable for undergraduate courses on data structures and algorithms, at both introductory and advanced levels. The book is also suitable as a refresher guide for computer programmers starting new jobs working with Python. Dr. Kent D. Lee is a Professor Emeritus of Computer Science at Luther College, Decorah, Iowa, USA. He is the author of the successful Springer books, Python Programming Fundamentals, and Foundations of Programming Languages. Dr. Steve Hubbard is a Professor Emeritus of Mathematics and Computer Science at Luther College. Data structures (Computer science). 66708 Information theory. 57783 Algorithms. 58677 Python (Computer program language). 64608 Computer programming. Data Structures and Information Theory. 66709 Algorithms. 58677 Python. 47553 Programming Techniques. 65517 Hubbard, Steve. author. aut http://id.loc.gov/vocabulary/relators/aut 69866 SpringerLink (Online service) Springer Nature eBook Printed edition: 9783031422089 Printed edition: 9783031422102 Undergraduate Topics in Computer Science, 2197-1781 66494 https://doi.org/10.1007/978-3-031-42209-6 ZDB-2-SCS ZDB-2-SXCS 57292 57292