K.D. Lee, S.

Hubbard
Data Structures and Algorithms with Python
Series: Undergraduate Topics in Computer Science

▶ Includes broad coverage of both introductory and advanced data

structures topics, supported by examples
▶ Guides the reader through the concepts of computational
complexity, from the basics to amortized complexity
▶ Makes learning fun, using the development of graphical user
interface programs to illustrate concepts

This clearly structured and easy to read 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 also introduced,
2015, XV, 363 p. 147 illus., 139 illus. in color. demonstrating what can and cannot be computed efficiently so that the programmer can
make informed judgements about the algorithms they use. The text assumes some basic
experience in computer programming and familiarity in an object-oriented language, but
Printed book not necessarily with Python.
Softcover  
▶ 44,99 € | £40.99 | $59.99
Topics and features:
 
▶ *48,14 € (D) | 49,49 € (A) | CHF 60.06
• Includes both introductory and advanced data structures and algorithms topics, with
suggested chapter sequences for those respective courses provided in the preface
eBook • Provides learning goals, review questions and programming exercises in each chapter,
Available from your library or as well as numerous illustrative examples
▶ springer.com/shop • Offers downloadable programs and supplementary files at an associated website, with
instructor materials available from the author
• Presents a primer on Python for those coming from a different language background
MyCopy • Reviews the use of hashing in sets and maps, along with an examination of binary
Printed eBook for just search trees and tree traversals, and material on depth first search of graphs
▶ € | $ 24.99 • Discusses topics suitable for an advanced course, such as membership structures, heaps,
▶ springer.com/mycopy balanced binary search trees, B-trees and heuristic search
Students of computer science will find this clear and concise textbook to be 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.

Order online at springer.com ▶ or for the Americas call (toll free) 1-800-SPRINGER ▶ or email us at:
customerservice@springer.com. ▶ For outside the Americas call +49 (0) 6221-345-4301 ▶ or email us at:
customerservice@springer.com.
The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for
Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices
exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted.