Jump to ratings and reviews
Rate this book

Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles, Sixteenth Edition 2014 . - DSA With C++ & Java

Rate this book
Most widely sold book Of Data Structure and Algorithms - Anyone can learn now. 



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

Usingthe C/C++ programming language, World Famous Author
Harry highlights three important aspects of data structures and
algorithms. First, the book places special emphasis on the connection
between data structures and their algorithms, including an analysis of the
algorithms' complexity. 



Second, the book presents data structures in the context of object-oriented program design, stressing the principle of information hiding in its treatment of encapsulation and decomposition.

Finally, the book closely examines data structure implementation. Overall, this practical and theoretical book prepares students with a solid foundation in data structures for future courses and work in design implementation, testing, or maintenance of virtually any software system. 


Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor.  Data Structures and Algorithms Made Easy : Data Structure and Algorithmic Puzzles,  uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. 



Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming.


The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. This edition became a widely used text inuniversities worldwide as well as the standard reference for professionals. The sixteenth edition featured new chapters on the role of algorithms,

probabilistic analysis and randomized algorithms, and linear programming. 


This edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. 


It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. 


Most widely sold book Of Data Structure and Algorithms - Anyone can learn now. "  Data Structures and Algorithms Made Easy : Data Structure 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++.



The book 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. 


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  
============

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

238 pages, Kindle Edition

First published July 27, 2013

8 people want to read

About the author

Harry Hariom Choudhary

32 books3 followers
Harry, Hariom Chaudhary is an 26 year old young Famous Indian computer Programming Author and scientifically Hacking professional (Hacker) has a unique experience in the field of computers Programming, Hacking and Cyber Security.

He has helped Indian USA, European governments and some multinational software companies of around the globe to secure their networks and securities. He has authored several books on Various Computers Programming Languages and computer security & Hacking.

Harry, is Technically Graduate and, MSC-IT, MBA-IT Master, Harry is the leading authority on C Programming and C++ Programming as well as on Core Java & Data Structure and Algorithms. His acclaimed C and C++ & Java books. He has over 6 years of experience as a software methodologist. His teaching and research interests are in the areas of artificial intelligence, programming languages, practical complexity problems, heuristic search methods, deductive algorithms, and educational and social issues. He originated error analysis in heuristic search methods and deductive algorithms.

Harry describes himself as an Ethical Hacker, Harry Also Known as (Captain Harry Chief Hacker) In cyber space ranked under top three extremely intelligent Indian Hacker according to Famous Hacking Book “Hacking Beginner's Guide 2014, Hackers: Heroes
of the Computer Revolution.”

Recently, Harry turned his passion from technology to Action Crime Novelist. Currently he is writing a Trilogy novel series (Illegal Mind & The Hacker) Based on Extremely Intelligent Hacker. Upcoming Novel’s first series is “Blood Tears.” Confirmed
release in 2014.

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
0 (0%)
4 stars
1 (100%)
3 stars
0 (0%)
2 stars
0 (0%)
1 star
0 (0%)
No one has reviewed this book yet.

Can't find what you're looking for?

Get help and learn more about the design.