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

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

• Used Book in Good Condition

<div><div><b>Peeling </b>Data Structures and Algorithms<b> </b><b>for interviews </b><b>[re-printed on 19-November-2015]</b><b>: </b></div><div><div><div><b>Table of Contents</b>: goo.gl/UeLODK</div><div><b></b></div><div><b>Sample Chapter</b>: goo.gl/remIdp</div><div><b>Found Issue? </b>goo.gl/forms/4Gt72YO81I</div><div><b>Videos</b>: goo.gl/BcHq74</div><div></div></div></div><br /><div>"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.</div></div><div></div><div><br />A handy guide of sorts for any computer science professional, <i>Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles</i> 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. <br /><br />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.<br /><br />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.</div><br /><b>What is unique?</b><br />   <br />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.<br /><br /><b>Topics Covered:</b><br /><ul><li>Introduction</li><li>Recursion and Backtracking</li><li>Linked Lists</li><li>Stacks</li><li>Queues</li><li>Trees</li><li>Priority Queue and Heaps</li><li>Disjoint Sets ADT</li><li>Graph Algorithms</li><li>Sorting   </li><li>Searching   </li><li>Selection Algorithms [Medians]   </li><li>Symbol Tables   </li><li>Hashing   </li><li>String Algorithms   </li><li>Algorithms Design Techniques   </li><li>Greedy Algorithms   </li><li>Divide and Conquer Algorithms   </li><li>Dynamic Programming   </li><li>Complexity Classes   </li><li>Miscellaneous Concepts   </li></ul><b>Target Audience?</b><br />   <br />These books prepare readers for interviews, exams, and campus work. <br /><br /><b>Language?</b><br /><br />All code was written in C/C++. If you are using Java, please search for "Data Structures and Algorithms Made Easy in Java".<br /><b></b><br />Also, check out sample chapters and the blog at: CareerMonk.com