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

Skip to content

Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles

Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles

Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles
Stock photo: cover may vary

Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles Paperback - 2011 - 2nd Edition

by Narasimha Karumanchi

Add to wish list
  • Used
  • Paperback
Used: Good

Description

Dover Publications, 2011-05-05. paperback. Used: Good. 8.50x1.01x11.00. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$35.12
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles

From the publisher

"Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.
Topics Covered:

  1. Introduction
  2. Recursion and Backtracking
  3. Linked Lists
  4. Stacks
  5. Queues
  6. Trees
  7. Priority Queue and Heaps
  8. Disjoint Sets ADT
  9. Graph Algorithms
  10. Sorting
  11. Searching
  12. Selection Algorithms [Medians]
  13. Symbol Tables
  14. Hashing
  15. String Algorithms
  16. Algorithms Design Techniques
  17. Greedy Algorithms
  18. Divide and Conquer Algorithms
  19. Dynamic Programming
  20. Complexity Classes
  21. Miscellaneous Concepts

About the author

Narasimha Karumanchi is the Senior Software Developer at Amazon Corporation, India. Most recently he worked for IBM Labs, Hyderabad and prior to that he served for Mentor Graphics and Microsoft, Hyderabad. He received his B-TECH. in Computer Science from JNT University and his M-Tech. in Computer Science from IIT Bombay. He has experience in teaching data structures and algorithms at various training centers and colleges. He was born and bought up in Kambhampadu, Macherla (Palnadu), Guntur, Andhra Pradesh.
tracking-