Books+ Search Results

Data Structures and Algorithms with Python

Title
Data Structures and Algorithms with Python [electronic resource] / by Kent D. Lee, Steve Hubbard.
ISBN
9783319130729
Edition
1st ed. 2015.
Publication
Cham : Springer International Publishing : Imprint: Springer, 2015.
Physical Description
1 online resource (XV, 363 p.) 147 illus., 139 illus. in color.
Local Notes
Access is available to the Yale community.
Access and use
Access restricted by licensing agreement.
Summary
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.
Variant and related titles
Springer ENIN.
Other formats
Printed edition:
Printed edition:
Format
Books / Online
Language
English
Added to Catalog
August 11, 2023
Series
Undergraduate Topics in Computer Science,
Undergraduate Topics in Computer Science,
Contents
1: Python Programming 101
2: Computational Complexity
3: Recursion
Sequences
4: Sets and Maps
5: Trees
6: Graphs
7: Membership Structures
8: Heaps
9: Balanced Binary Search Trees
10: B-Trees
11: Heuristic Search
Appendix A: Integer Operators
Appendix B: Float Operators
Appendix C: String Operators and Methods
Appendix D: List Operators and Methods
Appendix E: Dictionary Operators and Methods
Appendix F: Turtle Methods
Appendix G: TurtleScreen Methods
Appendix H: Complete Programs.
Also listed under
Hubbard, Steve. author.
SpringerLink (Online service)
Citation

Available from:

Online
Loading holdings.
Unable to load. Retry?
Loading holdings...
Unable to load. Retry?