About this book
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, 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 not necessarily with Python.
Topics and features:
- Includes both introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective courses provided in the preface
- Provides learning goals, review questions and programming exercises in each chapter, as well as numerous illustrative examples
- 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
- Reviews the use of hashing in sets and maps, along with an examination of binary search trees and tree traversals, and material on depth first search of graphs
- Discusses topics suitable for an advanced course, such as membership structures, heaps, 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.
- DOI https://doi.org/10.1007/978-3-319-13072-9
- Copyright Information Springer International Publishing Switzerland 2015
- Publisher Name Springer, Cham
- eBook Packages Computer Science
- Print ISBN 978-3-319-13071-2
- Online ISBN 978-3-319-13072-9
- Series Print ISSN 1863-7310
- Series Online ISSN 2197-1781
- Buy this book on publisher's site