Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, Second Edition

Video Link: youtube.com/watch?v=l_GRquIrVyg

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.

Peeling Data Structures and Algorithms for (Java, Second Edition):

• Programming puzzles for interviews
• Campus Preparation
• Degree/Masters Course Preparation
• Instructor's
• Big job hunters: Microsoft, Google, Apple, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Face book, McAfee and many more
• Reference Manual for working people

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.

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 Java. If you are using C/C++, please search for "Data Structures and Algorithms Made Easy".

Also, check out sample chapters and the blog at: CareerMonk.com

Author: Narasimha Karumanchi
Publisher: Careermonk Publications
Published: 12/16/2011
Pages: 414
Binding Type: Paperback
Weight: 2.10lbs
Size: 11.02h x 8.50w x 0.85d
ISBN13: 9788192107554
ISBN10: 8192107558
BISAC Categories:
- Computers | Software Development & Engineering | General
- Business & Economics | Careers | Job Hunting
- Computers | Computer Science

About the Author
Narasimha Karumanchi is the founder of CareerMonk and author of few books on data structures, algorithms, and design patterns. He was a software developer who has been both interviewer and interviewee over his long career. Most recently he worked for Amazon Corporation, IBM labs, Mentor Graphics, and Microsoft. He filed patents which are under processing.

He authored the following books which got translated to international languages: Chinese, Japanese, Korea and Taiwan. Also, around 58 international universities were using these books as reference for academic courses.

Data Structures and Algorithms Made Easy
Data Structures and Algorithms Made Easy in Java
Elements of Computer Networking
Data Structures and Algorithms Made Easy for GATE
Peeling Design Patterns
Coding Interview Questions

Narasimha held M.Tech. in computer science from IIT, Bombay, after finishing his B.Tech. from JNT university. He has also taught data structures and algorithms at various training institutes and colleges. Prof. M. Sreenivasa Rao, is the current Director School of IT and also Professor of SIT Computer Science. He performs both his roles with ease. He is indeed a widely read and active person in the academic front. His articles and publications were published all over the world. Dr. A. Damodaram joined as faculty of Computer Science & Engineering at JNTU, Hyderabad in the year 1989. In two decades of dedicated service, he performed distinguished services to the University as a Professor, Head of the Department, Vice Principal, Director of UGC - Academic Staff College, Director, School of Continuing & Distance Education and presently Director, University Academic Audit Cell.