{"product_id":"data-structures-and-algorithms-for-gate-solutions-to-all-previous-gate-questions-since-1991-9781468152975","title":"Data Structures and Algorithms For GATE: Solutions to all previous GATE questions since 1991","description":"\u003cstrong\u003e\u003c\/strong\u003e\u003cp\u003e\u003cstrong\u003eSuccess key books for: \u003c\/strong\u003e\u003c\/p\u003e\u003cul\u003e\n\u003cli\u003eProgramming puzzles for interviews\u003c\/li\u003e\n\u003cli\u003eCampus Preparation\u003c\/li\u003e\n\u003cli\u003eDegree\/Masters Course Preparation\u003c\/li\u003e\n\u003cli\u003eInstructor's\u003c\/li\u003e\n\u003cli\u003eBig 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\u003c\/li\u003e\n\u003cli\u003eReference Manual for working people\u003c\/li\u003e\n\u003c\/ul\u003e\u003cp\u003e\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eWhat is unique?\u003c\/strong\u003e \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003eMain 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. \u003cp\u003e\u003c\/p\u003e\u003cstrong\u003eTarget Audience?\u003c\/strong\u003e \u003cp\u003e\u003c\/p\u003eThese books are very much useful for interview preparation, exam preparation, campus preparations. \u003cp\u003e\u003c\/p\u003e\u003cstrong\u003eLanguage?\u003c\/strong\u003e \u003cp\u003e\u003c\/p\u003eAll code was written in \u003cem\u003eC\u003c\/em\u003e. I am planning to release the same in Java and as of now there is no time bound for this: )\u003cbr\u003e\u003cstrong\u003e \u003c\/strong\u003e\u003cbr\u003eAll the above details can also be seen at: CareerMonk.com \u003cp\u003e\u003c\/p\u003e\u003cstrong\u003eNote\u003c\/strong\u003e 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. \u003cp\u003e\u003c\/p\u003eThe main objective of this book is to make people aware of importance of data structures and algorithms. \u003cp\u003e\u003c\/p\u003eAs a \u003cem\u003ejob seeker\u003c\/em\u003e if you read the referenced books completely with good understanding, I am sure you will \u003cem\u003echallenge the interviewers\u003c\/em\u003e and that is the main objective. \u003cp\u003e\u003c\/p\u003eIf you read as an \u003cem\u003einstructor\u003c\/em\u003e, 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. \u003cp\u003e\u003c\/p\u003eThese books are very much useful for the students of \u003cem\u003eEngineering\u003c\/em\u003e and \u003cem\u003eMasters\u003c\/em\u003e 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. \u003cp\u003e\u003c\/p\u003eAnd finally if you read as a \u003cem\u003estudent\u003c\/em\u003e 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. \u003cp\u003e\u003c\/p\u003eIn 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.\u003cbr\u003e\u003cbr\u003e\u003cb\u003eAuthor:\u003c\/b\u003e Narasimha Karumanchi\u003cbr\u003e\u003cb\u003ePublisher:\u003c\/b\u003e Createspace Independent Publishing Platform\u003cbr\u003e\u003cb\u003ePublished:\u003c\/b\u003e 12\/30\/2011\u003cbr\u003e\u003cb\u003ePages:\u003c\/b\u003e 394\u003cbr\u003e\u003cb\u003eBinding Type:\u003c\/b\u003e Paperback\u003cbr\u003e\u003cb\u003eWeight:\u003c\/b\u003e 2.01lbs\u003cbr\u003e\u003cb\u003eSize:\u003c\/b\u003e 11.02h x 8.50w x 0.81d\u003cbr\u003e\u003cb\u003eISBN:\u003c\/b\u003e 9781468152975\u003cbr\u003e\u003cp\u003e\u003cb\u003eAbout the Author\u003c\/b\u003e\u003cbr\u003eNarasimha Karumanchi is the Senior Software Developer at Amazon Corporation, India. Most recently he worked for IBM Labs, Hyderabad and prior to that he served for Mentor Graphics and Microsoft, Hyderabad. He received his B-TECH. in Computer Science from JNT University and his M-Tech. in Computer Science from IIT Bombay. He has experience in teaching data structures and algorithms at various training centers and colleges. He was born and bought up in Kambhampadu, Macherla (Palnadu), Guntur, Andhra Pradesh.\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e\u003ci\u003eThis title is not returnable\u003c\/i\u003e\u003cbr\u003e\u003c\/p\u003e","brand":"Createspace Independent Publishing Platform","offers":[{"title":"Paperback","offer_id":45096906391667,"sku":"9781468152975","price":49.95,"currency_code":"EUR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0555\/9255\/0515\/files\/img_6618ad2b-8f19-417a-bf11-98a7006df06e.jpg?v=1781289865","url":"https:\/\/bookstorenmore.com\/en-de\/products\/data-structures-and-algorithms-for-gate-solutions-to-all-previous-gate-questions-since-1991-9781468152975","provider":"Bookstore N More","version":"1.0","type":"link"}