Salient Features of Book Provides insight into what drives the recruitment process and what an interviewer looks for while interviewing an engineering student. Covers concepts, problems and interview questions for each topic. Covers latest buzzwords like cloud computing, vitalization, big data and many more. All the concepts are discussed in a lucid, easy to understand manner. A reader without any basic knowledge in computers can comfortably follow this book. Coders / Programmers are in demand, but to land the job, you must demonstrate knowledge of those things expected by today’s employers. This guide sets you up for success. Not only does it provide the most commonly asked interview questions and answers, but it also offers insight into the interview process in today’s marketplace. This book is a comprehensive guide for experienced and first-time programmers alike. The book is specifically designed for freshers, who despite being brilliant at the technical aspects of the interview, tend to fail when it comes to soft skills and HR interviews. The book provides readers with a relevant blueprint when it comes to planning for pre-interview preparation. It provides candidates with guidelines on the preparation of their resumes and the format that should be followed. 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. Elements of computer networking Data structures and algorithms made easy Data structures and algorithms made easy in Java Data structures and algorithms made easy for GATE Peeling design patterns IT Interview questions 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.
Buy the book It Interview Questions: A Primer for the It Job Interviews (Concepts, Problems and Interview Questions) from Ideakart.com.
Month: March 2019
Peeling Design Patterns: For Beginners and Interviews
Peeling Design Patterns For Beginners And Interviews presents the subject of Design Patterns in a very easy to understand manner. It can come in handy as a reference material for working professionals, graduate and postgraduate students. Summary Of The Book Peeling Design Patterns For Beginners And Interviews introduces in a simple yet effective manner, the concepts of Software Design Patterns to even those who do not have a prior knowledge of Software Design. This book provides the reader with typical questions that can appear in a job interview. It is also a useful study guide for computer science students. The book is divided into nine chapters. All codes that appear in this book are written in Java. The first three chapters deal with the basics and cover topics related to UML and an introduction to Design Patterns. The next three chapters are about Creational, Structural and Behavioral Patterns. Towards the end of the book is a full glossary for easy retrieval of information, tips, miscellaneous concepts and interview questions related to Design. A reading of Peeling Design Patterns For Beginners and Interviews promises all those working professionals the ability to come up with improvised designs and participate actively in discussions related to Design Patterns at their workplaces. The book is also filled with real-time examples for a reader to fully grasp the concepts pertaining to Software Design Patterns. The book is written in a simple and easy manner with clear explanations. About The Authors Narasimha Karumanchi is an author and the co-founder of careermonk.com. A few of his other books are Data Structures And Algorithms Made Easy In Java, Coding Interview Questions and Data Structures and Algorithms Made Easy. Karumanchi hails from Andhra Pradesh, India. He is a holder of a B.Tech. degree in Computer Science from JNT University and M.Tech. from IIT-Mumbai. His career has spanned stints at Amazon Corporation, IBM Labs, Microsoft and Mentor Graphics. His areas of interest have been Data Structures and Algorithms, which he has also taught in various colleges and training institutes. M. Sreenivasa Rao is an Author, the Director of the School of IT, and the Professor of SIT Computer Science at the Jawaharlal Nehru Technological University, Hyderabad. His articles and papers have been published in leading journals across the world. He holds a B.Tech degree and two M.Tech degrees, as well as a Ph.D. He has nearly 30 years of teaching experience.
Buy the book Peeling Design Patterns: For Beginners and Interviews from Ideakart.com.
Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles
Data Structures And Algorithms Made Easy In Java is a comprehensive and wide-ranging guide on data structures. – Imported Edition Summary Of The Book Data Structures And Algorithms Made Easy In Java is a guide which helps you understand data structures better. Data structures are ways in which data is stored and organised on a computer so as to make it more resourceful. There are different kinds of data structures available for different tasks, with some being highly specific and others used for certain applications. They help in effectively managing large quantities of data with the help of algorithms which, in the fields of mathematics and computer science, is a systematic procedure towards solving any numerical problem. The book covers many topics concerning competitive examinations and includes numerous puzzles and probable interview questions to help the reader prepare better. Each question also comes with multiple solutions of varying complexities so as to enable the reader to deal with a variety of questions. Furthermore, all codes in the book have been written using the Java script. It is a complete preparation guide for likely job aspirants for companies like Oracle, Microsoft, Amazon, Facebook and for people appearing for competitive examinations. Data Structures And Algorithms Made Easy In Java has a comprehensive introduction and various informative chapters such as Linked Lists, Stacks, Queues, Sorting, Searching, Symbol Tables, Dynamic Programming, Complexity Classes and Miscellaneous Concepts. Salient Features of Book All code written in Java Data structure puzzles to improve thinking Enumeration of possible solutions for each problem Covers all topics for competitive exams Covers interview questions on data structures and algorithms Reference Manual for working people Campus Preparation Degree/Masters Course Preparation Big Job Hunters: Microsoft, Google, Amazon, Yahoo, Oracle, Facebook & many more. About the Author Narasimha Karumanchi is the author of many popular books on data structures and algorithms and a software developer. Some of his books are Data Structures and Algorithms Made Easy: 700 Data Structure and Algorithmic Puzzles, Data Structures and Algorithms For GATE: Solutions To All previous GATE Questions Since 1991, Peeling Design Patterns and Coding Interview Questions. Karumanchi was born in Kambhampadu, Guntur, Andhra Pradesh. He graduated with a B.Tech. degree in computer science from JNT University and with an M.Tech. degree in the same discipline from IIT Bombay. He has previously worked with IBM Labs, Hyderabad, Mentor Graphics and Microsoft. He is presently working as a senior software developer at Amazon Corporation, India. He is the founder of CareerMonk and also designs algorithms for Stockmonks.com. Karumanchi has also taught at many training centres and colleges. Narasimha 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.
Buy the book Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles from Ideakart.com.
Data Structures and Algorithms for GATE: Solutions to All Previous GATE Questions Since 1991
The book provides detailed solutions for data structure and algorithm related questions in previous years GATE Papers. Summary Of The Book Algorithms and data structures are fundamental concepts in computer science, programming and related courses. A good understanding of these concepts are required in the workplace as well as for higher studies. For a person aiming to gain entry into postgraduate courses in IT related fields, this knowledge is of utmost importance. For students who have finished their bachelor degree in computer science, this might not be a problem. They might have a good understanding of these concepts. Still, when appearing for an exam like GATE, they will need to tackle challenging questions on these topics. Data Structures And Algorithms For GATE: Solutions To All Previous Gate Questions Since 1991 helps them by concentrating on the concepts and codes that are directly relevant to competitive exams and interview situations. The book covers theorems and proofs for data structure and algorithm related concepts. It provides different solutions, in varying levels of complexities for the same problems. This will help the students understand many possible solutions to a specific problem. The book concentrates more on problem solving than on the basic theory, for it is assumed that readers at this level understand enough of the theory to tackle various kinds of problems. This book will help readers prepare for competitive exams, for interviews, and even serve as basic reference material for higher studies. Instructors might also find this book useful, as it provides multiple solutions to various problems and discusses the solutions too. Data Structures And Algorithms For GATE: Solutions To All Previous Gate Questions Since 1991 will be especially helpful to GATE aspirants for it contains detailed solutions to questions from previous twenty years of GATE Papers. All the codes in Data Structures And Algorithms For GATE: Solutions To All Previous Gate Questions Since 1991 have been written in C. The book covers data structure topics like linked lists, stacks, queues and trees. It also covers recursions and backtracking. The book discusses various algorithm concepts like searching, sorting and graph algorithms. It goes into string algorithms, hashing techniques and symbol tables. The book also looks into interesting and complex algorithm concepts like dynamic programming, divide and conquer algorithm and greedy algorithms. About Narasimha Karumanchi Narasimha Karumanchi is an experienced software designer and developer. Other books by this author are Peeling Design Patterns: For Beginners And Interviews, Coding Interview Questions, and Data Structure Puzzles: Puzzle Your Mind For Data Structures. He specializes in covering programming and data structure concepts for competitive exams and interviews. Narasimha Karumanchi studied for his B.Tech in computer science at JNT University. He earned his M.Tech from IIT, Bombay. He has worked for Mentor Graphics, Microsoft, and IBM Labs. He also has teaching experience, having taught algorithm and data structures at colleges and training centers. Currently, he is Senior Software Developer at Amazon Corporation.
Buy the book Data Structures and Algorithms for GATE: Solutions to All Previous GATE Questions Since 1991 from Ideakart.com.
Data Structure and Algorithmic Thinking with Python
Narasimha Karumanchi’s Data Structure and Algorithmic Thinking with Python is designed to help programmers as well as test takers of competitive exams and those looking for jobs by making them more confident with data structures and smarter in finding different solutions to approaches to one problem. The various puzzles in the book builds a person’s analytical ability thus placing him in a better position of facing interviews. About CareerMonk Publications Based in Hyderabad, CareerMonk was founded in 2007 by Amazon Corporation India’s former senior software developer, Narasimha Karumanchi. The other authors in this publication include Prof Srinivasa Rao, and Prof. A Damodaram. Some of the other books by this publication includes IT Interview Questions by Narasimha Karumanchi, Elements of Computer Networking and Data Structures and Algorithms Made Easy in Java.
Buy the book Data Structure and Algorithmic Thinking with Python from Ideakart.com.
Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles
Peeling Data Structures and Algorithms:
Table of Contents: goo.gl/JFMgiU
Sample Chapter: goo.gl/n2Hk4i
Found Issue? goo.gl/forms/4Gt72YO81I
Videos: goo.gl/BcHq74
“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.
A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structures 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. 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:
- 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
Coding Interview Questions
Table of Contents: goo.gl/jRCskB
Sample Chapter: goo.gl/aB0drj
Found Issue? goo.gl/lzK72K
Videos: goo.gl/BcHq74
“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 Basics
- Introduction
- Recursion and Backtracking
- Linked Lists
- Stacks
- Queues
- Trees
- Priority Queue and Heaps
- 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
- Design Interview Questions
- Operating System Concepts
- Computer Networking Basics
- Database Concepts
- Brain Teasers
- NonTechnical Help
- Miscellaneous Concepts
Elements of Computer Networking: An Integrated Approach (Concepts, Problems and Interview Questions)
Computer networking is an integral and dynamically expanding component of information technology. To understand the evolving trends of networking, you need to be thorough with the basic concepts of computer networking. This book, Elements Of Computer Networking: An Integrated Approach (Concepts, Problems And Interview Questions) provides the resource for students of advanced graduate or undergraduate computer courses. The book places special emphasis on application-layer paradigms as well as application programming interfaces, thereby facilitating a real-time knowledge gaining process with protocols and networking concepts before going into protocol stack and more complex layers.
Elements Of Computer Networking: An Integrated Approach (Concepts, Problems And Interview Questions) is a collaborative effort of authors Narasimha Karumanchi, Dr A Damodaran and Dr Sreenivasa Rao M. The book is comprised of 17 chapters, which include Transport Layer, Application Layer, Data Link Layer, Medium Access Control Sublayer, Physical Layer and Network Security. The authors have designed the book so that it is easily grasped by students. The book has been the popular choice for students of advanced networking courses owing to the solid reputation of the authors. Published by CareerMonk Publications in 2014, the book is available in paperback format.
Key Features:
- The book is designed in an easy to read format keeping students in mind.
- The book contains interview questions procured from real interviews of different software companies.
- It also contains hundreds of solved problems.
The Ultimate C: Concepts, Programs and Interview Questions
The main objective of writing this book is that every student should be able to acquire necessary skills required to become a programmer. The logic of each and every problem is explained in a simple manner which helps the student to write better programs. This book discusses all concepts of C starting from fundamentals to advanced topics in a lucid manner. It covers hundreds of solved programs which are useful to the students for their examinations. It also covers the interview questions which help the students come up with flying colors in their career.
Salient Features:
- All the concepts are discussed in a lucid, easy to understand manner.
- A reader without any basic knowledge in computer s can comfortably follow this book.
- Helps to build logic in the students which becomes stepping stone for programming.
- Interview questions collected from the actual interviews of various Software companies will help the students to be successful in their campus interviews.
- Hundreds of solved programs help the students of Indian Universities do well in their examinations like B.C.A, B.Sc, M.Sc, M.C.A, B.E, B.Tech, M.Tech, etc.
- Works like a handy reference to the Software professionals in their programming.
- Starting at basic level, this book covers advanced topics like Pointers, Data structures, Searching and sorting techniques and Graphics.
Table of Contents:
- 1. Fundamental Concepts in C
2. Data types and operators
3. Control statements in C
4. Arrays
5. Functions
6. Characters and strings
7. Storage Classes
8. Pointers
9. Structures and Unions
10. File Concepts
11. Command Line Arguments
12. Macros and Enumerations
13. Data Structures in C
14. Searching, Sorting and Merging
15. Graphics and Animation
Apendix – I: List of Programs
Apendix – I :List of Interview Questions
Buy the book The Ultimate C: Concepts, Programs and Interview Questions from Ideakart.com.
Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer and Dynamic Programming
About the book:
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.
topicerrati 