Data Structures and Algorithms For GATE
Narasimha Karumanchi
Createspace Independent Publishing Platform
2011
pokkari
Success key books for: Programming puzzles for interviewsCampus PreparationDegree/Masters Course PreparationInstructor'sBig 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 moreReference Manual for working peopleWhat is unique? Main objective is not to give you the theorems and proofs about DS and Algorithms. I have followed a pattern of improving the problem solutions with different complexities (for each problem, you observe multiple solutions with different improved complexities). Basically, its 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. Target Audience? These books are very much useful for interview preparation, exam preparation, campus preparations. Language? All code was written in C. I am planning to release the same in Java and as of now there is no time bound for this: ) All the above details can also be seen at: CareerMonk.com Note Before taking decision, I strongly recommend you to go through the sample chapters provided in site. That gives you an idea about the pattern of problems in the book. If you feel this will help others, please spread this mail. The main objective of this book is to make people aware of importance of data structures and algorithms. As a job seeker if you read the referenced books completely with good understanding, I am sure you will challenge the interviewers and that is the main objective. If you read as an instructor, you will give better lectures with easy go approach and a result your students will feel proud for selecting Computer Science/Information Technology as their degree. These books are very much useful for the students of Engineering and Masters during their academic preparations. All the chapters of this book contain theory and their related problems as many as possible. There are a total of approximately 700+ algorithmic problems and all of them are with solutions. And finally if you read as a student preparing for competition exams or any other exam for Computer Science/Information Technology], then the content of this book covers all the required topics in full detail. While writing the book, an intense care has been taken to ensure that the content should help students who are preparing for these kinds of exams. In all 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 problems.
