Fundamentals of Python: Data Structures / Edition 1

by Kenneth Lambert

Overview

Whether you are a computer programming student, hobbyist or professional, Lambert's FUNDAMENTALS OF PYTHON : DATA STRUCTURES, 2E offers the perfect introduction to object-oriented design and data structures using the popular Python programming language. The level of instruction is ideal if you've had at least one semester of programming experience in an object-oriented language, such as Java , C++ or Python . Step-by-step explanations and focused exercises clearly explain the design of collection classes with polymorphism and inheritance and multiple implementations of collection interfaces. This edition also addresses the analysis of the space/time tradeoffs of different collection implementations and, specifically, array-based implementations and link-based implementations. You learn to work with collections, including sets, lists, stacks, queues, trees, dictionaries and graphs. Prepare for success with FUNDAMENTALS OF PYTHON : DATA STRUCTURES, 2E.

Product Details

ISBN-13:	2901285752005
Publisher:	Cengage Learning
Publication date:	10/31/2013
Pages:	496
Product dimensions:	7.20(w) x 9.00(h) x 1.30(d)

About the Author

Kenneth A. Lambert is a Professor of Computer Science at Washington and Lee University. He has taught courses in almost every subject area related to computer science and has published several popular textbooks related to introductory programming and data structures in C++, Java and Python . He is the co-creator of the BreezySwing framework and is the creator of the breezypythongui framework.

Table of Contents

1. Basic Python Programming. 2. An Overview of Collections. 3. Searching, Sorting, and Complexity Analysis. 4. Arrays and Linked Structures. 5. Interfaces, Implementations, and Polymorphism. 6. Inheritance and Abstract Classes. 7. Stacks. 8. Queues. 9. Lists. 10. Trees. 11. Sets and Dictionaries. 12. Graphs.

Editorial Reviews

The code segments are nicely written and commented, and the explanations are clear and simple. Excellent explanation of big-O, particularly O(n log n) for quicksort. Introduces the idea of an interface, with a simple but very suitable data structure, a bag. Walks through the creation of the interface, and then two implementations of it. This is a great way to emphasize the difference between interface and implementation, and to build on the previous chapter and explore how implementation affects running time. Very readable, the chapter provides clear, step-by-step tour of the topics.

Coding examples are great with the explanations. Good exercises that are within the chapter. A good check on understanding the information.The exercises and programming projects are well thought out.

From the Publisher