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 Structures and Algorithmic Puzzles

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

Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles Paperback - 2016

by Karumanchi, Narasimha

Add to wish list
  • Used
  • very good
  • Paperback
Used - Very good

Description

CareerMonk Publications, 2016-08-28. 5th ed. paperback. Very Good. 8x0x11. This Book is in Very Good condition - LIGHT CREASE ON FRONT COVER, OTHERWISE A VERY NICE CLEAN BOOK. See our picture for exact item you will receive. All items ship within 24 hours. Packaging is 100% Recyclable. Most items purchased from Charitable organizations. A portion of each sale is also donated to a monthly charity, check your package for this month's charity. Reuse-Recycle-Rebook!
Ask the seller a question Add to wish list
A$33.02
A$7.16 Delivery within USA
Standard delivery: 4 to 9 days
More delivery options
Ships from Rebooksellers (Florida, United States)
Biblio Top Seller
The BIBLIO Guarantee

Details

About Rebooksellers Florida, United States

Specialising in: Collectible Fiction, Current Fiction, Self Help, Textbooks
Biblio member since 2013

We are a small independent bookseller selling many types of books with a passion for first editions. All of our inventory is purchased from charitable organizations and thanks to your purchases we can continue to support them.

Terms of Sale:

30 day return guarantee, with full refund if an item arrives misdescribed.

Browse books from Rebooksellers

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

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

Peeling Data Structures and Algorithms:

Table of Contents: goo.gl/JFMgiU
Sample Chapter: goo.gl/n2Hk4i
Found Issue? goo.gl/forms/4Gt72YO81I
Videos: goo.gl/BcHq74

"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.

A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. 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

Please wait a moment while we load the requested page.

tracking-