Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, Second Edition
AbeBooks Member Since 1996
AbeBooks Member Since 1996
About this Item
Title: Data Structures and Algorithms Made Easy in ...
Publisher: CreateSpace Independent Publishing Platform
About this title
Peeling Data Structures and Algorithms [re-printed on 19-August-2016]: Table of Contents: goo.gl/hMYJGqSample Chapter: goo.gl/DqVs8pSource Code: goo.gl/e3imfVVideos: goo.gl/BcHq74
A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy in Java: 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 in Java: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in 2011, and it is coded in Java language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in C/C++. 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 ennumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities.
Objective of this book is to present the ideas for solving data-structure and algorithmic problems. I request to go through the first chapter as it describes when do we (situations) get different complexities like O(logn), O(n^2), O(loglogn), O(nlogn), O(2^n) etc.. Once you understand them, remaining chapters looks easy as we refer these complexities at every place.
"About this title" may belong to another edition of this title.
For assistance with billing questions, please refer to our help page in abebooks. If you cannot find the answers you are seeking or have questions about your order you can contact us by emailing firstname.lastname@example.org. Responses to emails will be provided as soon as possible. For further information - (250) 361-4447
Shipping prices are based on books weighing 2.2 LB, or 1 KG. Canadian and U.S. orders sent with Automated Package Tracking and delivery confirmation, where available. If your book order is heavy or oversized, we may contact you regarding any extra shipping costs. Thank you! - Russell Books
accepted by seller