Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles - Softcover

Karumanchi, Narasimha

Softcover

ISBN 10: 1466304162 ISBN 13: 9781466304161

Publisher: CreateSpace Independent Publishing Platform, 2011

Synopsis

Success key books for: Programming puzzles for interviews Campus Preparation Degree/Masters Course Preparation Instructor’s GATE Preparation Big job hunters: Microsoft, Google, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Webaroo, De-Shaw, Success Factors, Face book, McAfee and many more Reference Manual for working people

About this title

From the Author

This book assumes you have some basic knowledge about computer science. Main objective of the book is not to provide you all the interview questions. I have followed a pattern of improving the problem solutions with different complexities (for each problem, you observe multiple solutions with different improved complexities in data structure and algorithmic problems).  Basically, it is an enumeration of possible solutions. With this approach, even if we get a new question it gives us a way to think about all possible solutions. For all other topics, it will act as refreshment. This book is very much useful for interview preparation, competitive exams preparation and campus preparations. 
 
As a job seeker if you read complete book with good understanding, I am sure you will challenge the interviewers and that is the objective of this book. 
 
This book is very much useful for the students of Engineering Degree and Masters during their academic preparations. All the chapters of this book contain theory and their related problems as many as possible. If you read as a student preparing for competition exams for Computer Science/Information Technology], the content of this book covers all the required topics in full details. While writing the book, an intense care has been taken to help students who are preparing for these kinds of exams. 
In most the chapters you will see more importance given to problems and analyzing them instead of concentrating more on theory. For each chapter, first you will see the basic required theory and then followed by problems. 
 
For many of the problems, multiple solutions are provided with different complexities. We start with brute force solution and slowly move towards the best solution possible for that problem. For each problem we will try to understand how much time the algorithm is taking and how much memory the algorithm is taking.

From the Back Cover

CareerMonk.com

Edition details

• Publisher: CreateSpace Independent Publishing Platform
• Publication date: 2011
• ISBN 10: 1466304162
• ISBN 13: 9781466304161
• Binding: Paperback
• Language: English
• Number of pages: 391