BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Data Structure and Algorithmic Thinking with Python

Data Structure and Algorithmic Thinking with Python

Data Structure and Algorithmic Thinking with Python Paperback / softback - 2015

by Narasimha Karumanchi

Add to wish list
  • New
  • Paperback
New

Description

Paperback / softback. New.
Ask the seller a question Add to wish list
A$91.77
A$19.20 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)

Details

About The Saint Bookstore Merseyside, United Kingdom

Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for Data Structure and Algorithmic Thinking with Python

From the publisher

It is the Python version of "Data Structures and Algorithms Made Easy". Table of Contents: goo.gl/VLEUca Sample Chapter: goo.gl/8AEcYk Source Code: goo.gl/L8Xxdt The sample chapter should give you a very good idea of the quality and style of our book. In particular, be sure you are comfortable with the level and with our Python coding style. This book focuses on giving solutions for complex problems in data structures and algorithm. It even provides multiple solutions for a single problem, thus familiarizing readers with different possible approaches to the same problem. "Data Structure and Algorithmic Thinking with Python" is designed to give a jump-start to programmers, job hunters and those who are appearing for exams. All the code in this book are written in Python. It contains many programming puzzles that not only encourage analytical thinking, but also prepares readers for interviews. This book, with its focused and practical approach, can help readers quickly pick up the concepts and techniques for developing efficient and effective solutions to problems. Topics covered include: Organization of Chapters Introduction Recursion and Backtracking Linked Lists Stacks Queues Trees Priority Queues and Heaps Disjoint Sets ADT Graph Algorithms Sorting Searching Selection Algorithms [Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Hacks on Bit-wise Programming Other Programming Questions
tracking-