Rating:
(54 reviews)
Author: Narasimha Karumanchi
ISBN : 819210754X
New from $21.49
Format: PDF, EPUB
Download file now Free Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles [Paperback] from 4shared, mediafire, hotfile, and mirror link
Peeling Data Structures and Algorithms for interviews [re-printed with corrections and new problems]:
"Data Structures And Algorithms Made Easy: Data Structure 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 Structure 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.
The book has around 21 chapters and covers 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, and other Miscellaneous Concepts.
Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in March, and it is coded in C/C++ language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in Java. In short, this book offers solutions to various complex data structures and algorithmic problems.
What is unique? Our main objective isn't to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities. In other words, we enumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities.
Topics Covered:- 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
Target Audience? These books prepare readers for interviews, exams, and campus work.
Language?All code was written in C/C++. If you are using Java, please search for "Data Structures and Algorithms Made Easy in Java".
Also, check out sample chapters and the blog at: CareerMonk.com
Direct download links available for Free Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles
- Paperback: 426 pages
- Publisher: CareerMonk Publications; 2 edition (December 29, 2011)
- Language: English
- ISBN-10: 819210754X
- ISBN-13: 978-8192107547
- Product Dimensions: 0.9 x 8.4 x 10.8 inches
- Shipping Weight: 2.7 pounds (View shipping rates and policies)
Free Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles
This book is ideal if you are on a tight schedule to appear for an interview. Each chapter brushes up the concepts in a concise way before throwing a barrage of in-market puzzles. This book can also be used as a nice exercise to test your ability to solve algorithmic puzzles before appearing for an interview/test.
The solutions are there for guidance, you can of course have your own way of doing things, but the authors solutions are pretty widely accepted ones (the gradual incremental-steps for some problems might seem an over kill)
Pros:
1) Good Bunch of questions at one place to save time
2) Good coverage of topics
3) Fairly acceptable approaches to problems
4) Good concise literature at the start of the chapter acts as an brushup on concept.
5) In-Vogue collection of questions .
Cons:
1) Literature needs some polishing
2) Quiet a few errors at places (just typos, ideas are right)
Word of Caution: this is not a conventional text book for in-depth analysis of DS and Algo.
By Subhasis
I'm a professional coder, and I bought this book on a curious whim. This book is great for two reasons:
1.)The cover design is laughably bad. From the questionable "Best Seller" badge to the cheesy vector art, it's so bad that after you see just how useful and thorough the actual content of the book is, the contrast between the content and the cover makes you laugh all over again.
2.)On to what matters: the content. Holy cow (no religious insensitivity intended). This book is where it's at. It's the single best reference for computer science concepts that I own. It's a 6-year computer-science university education condensed into 425 rich pages. Everything--and I mean everything--is here, and the concepts are presented in a language style that's precise and very easy to understand. The book lives up to its name, and it's well worth it for any programmer to buy this. I give it an enthusiastic five stars.
By D. Dorset