Data Structures and Algorithms with Python: With an Introduction to Multiprocessing

by Kent D. Lee, Steve Hubbard

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 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.

Genres: Computer Science, Programming, Algorithms, Nonfiction

414 pages, Paperback

First published January 12, 2015

Reviews

[M. · Rating 4 out of 5]

A decent dive into the world of data structures in Python; The author made a good job in breaking down difficult concepts using simple examples and funny language.
It was a breeze to read, but it needs some real touch-ups regarding the topics covered...