Narasimha Karumanchi

"Peeling Design Patterns: For Beginners and Interviews" by Narasimha Karumanchi and Prof. Sreenivasa Rao Meda is a book that presents design patterns in simple and straightforward manner with a clear-cut explanation. This book will provide an introduction to the basics and covers many real-time design interview questions. It comes handy as an interview and exam guide for computer scientists.Salient Features of Book: Readers without any background in software design will be able to understand it easily and completely.Presents the concepts of design patterns in simple and straightforward manner with a clear-cut explanation. After reading the book, readers will be in a position to come up with better designs than before and participate in design discussions which happen in their daily office work. The book provides enough real-time examples so that readers get better understanding of the design patterns and also useful for the interviews. We mean, the book covers design interview questions. Table of Contents: IntroductionUML BasicsDesign Patterns IntroductionCreational PatternsStructural PatternsBehavioral PatternsGlossary and TipsDesign Interview QuestionsMiscellaneous Concepts

Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming Algorithm Design Techniques is a detailed, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. What's Inside Enumeration of possible solutions for the problems. Performance trade-offs (time and space complexities) between the algorithms. Covers interview questions on data structures and algorithms. All the concepts are discussed in a lucid, easy to understand manner. Interview questions collected from the actual interviews of various software companies will help the students to be successful in their campus interviews. Python-based code samples were given the book.

Coding Interview Questions is a book that presents interview questions in simple and straightforward manner with a clear-cut explanation. This book will provide an introduction to the basics. It comes handy as an interview and exam guide for computer scientists.Topics Covered: Programming BasicsIntroductionRecursion and BacktrackingLinked ListsStacksQueuesTreesPriority Queue and HeapsGraph AlgorithmsSortingSearchingSelection Algorithms Medians]Symbol TablesHashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Design Interview Questions Operating System Concepts Computer Networking Basics Database Concepts Brain Teasers NonTechnical Help Miscellaneous Concepts

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.

"Data Structures And Algorithms Made Easy: Data Structures and 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++, it comes handy as an interview and exam guide for computer scientists. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.Topics Covered: IntroductionRecursion and BacktrackingLinked ListsStacksQueuesTreesPriority Queue and HeapsDisjoint Sets ADTGraph AlgorithmsSorting Searching Selection Algorithms Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Miscellaneous Concepts

"Data Structures And Algorithms Made Easy: Data Structures and 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++, it comes handy as an interview and exam guide for computer scientists. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.Topics Covered: IntroductionRecursion and BacktrackingLinked ListsStacksQueuesTreesPriority Queue and HeapsDisjoint Sets ADTGraph AlgorithmsSorting Searching Selection Algorithms Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Miscellaneous Concepts

Product DescriptionSuccess 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 peopleFrom the AuthorWhat 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, GATE preparation, campus preparations. Specially for GATE, I included some extra chapters. 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 like Graduate Aptitude Test for Engineering, DRDO 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.