9781118290279

Data Structures and Algorithms in Python

by ; ;
  • ISBN13:

    9781118290279

  • ISBN10:

    1118290275

  • Format: Hardcover
  • Copyright: 3/18/2013
  • Publisher: John Wiley & Sons Inc

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $16.80
    Check/Direct Deposit: $16.00
List Price: $187.45 Save up to $131.19
  • Rent Book $112.47
    Add to Cart Free Shipping

    TERM
    PRICE
    DUE

Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Summary

This textbook is based on the authors' market leading data structures books (in Java and C++) and offers a comprehensive, definitive introduction to data structures in Python by authoritative authors. Python has been growing rapidly as the language for CS1, (including increases of 88%, 45%, and 49% in the last three years, per TWM.) The lack of texts and lack of consensus in departments have prevented wide adoption in CS2 so far, however, this is changing as more schools see how well Python is working in CS1 and more texts become available.

Table of Contents

Chapter 1: Python Programming Basics

Chapter 2: Object-Oriented Design

Chapter 3: Analysis Tools and Recursion

Chapter 4: Stacks, Queues, and Deques

Chapter 5: Sequence Abstractions

Chapter 6: Tree Structures

Chapter 7: Priority Queues

Chapter 8: Maps and Dictionaries

Chapter 9: Search Tree Structures

Chapter 10: Sorting, Sets, and Selection

Chapter 11: Strings and Dynamic Programming

Chapter 12: Graph Algorithms

Chapter 13: Memory Management and B-trees

Appendix A: Useful Mathematical Facts

Rewards Program

Write a Review