Data Structure and Algorithmic Thinking with Python

Data Structure and Algorithmic Thinking with Python by Narasimha Karumanchi

Quick Overview

Written By: Narasimha Karumanchi
Publisher: Careermonk Publications

Binding: Paperback
Language: English
EAN: 9788192107592
Feature: Physical Condition: No Defects
ISBN: 8192107590
Language: Please check ur local laws , apart from it one thing is for sure that it cannot be returned .... book is very good for engineering students having data structure and algorithm as one of their course .... Plz embrace the offer if u r facing doubts in the area , it will surely help u out ..... Thank you
MPN: black & white illustrations
Number Of Items: 1
Number Of Pages: 472
Part Number: black & white illustrations
Publication Date: 2015-01-29
Manufacturer: Careermonk Publications

Availability: Usually dispatched within 24 hours

Price Details
  • List Price: INR 600.00
  • Amazon Price:
  • INR 482.00
  • You Save: INR 118.00 ( 20% )

Product Features

Physical Condition: No Defects

Table of Contents:

Sample Chapter:

Source Code:


Found issue?

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:

  • Organization of chapters
  • Introduction
  • Recursion and Backtracking
  • Linked Lists
  • Stacks
  • Queues
  • Trees
  • Priority Queue 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
  • Miscellaneous Concepts

Featured Books

Introduction to Algorithms by Thomas H. Cormen Rating Star
Internationally acclaimed textbook

Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers.

For GATE civil engineering exam

Previous years GATE questions in order to help students get an idea of the format, as well as plan their practice in a similar fashion