Rated 5/5 based on 104
Awesome Book - by , @book.updated_at
5/ 5stars
This is an awesome book, we should definitely buy it.
Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles
Buy it at best price from here

Rs. 450

Buy Now
Free Shipping!

Book Specification

Binding Paperback
Language English
Number Of Pages 432
Author Narasimha Karumanchi
Publisher Careermonk Publications
Isbn-10 819324527X
Isbn-13 9788193245279
Dimension 21.59*2.49*27.94

Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles

Narasimha Karumanchi's 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:

  1. Introduction
  2. Recursion and Backtracking
  3. Linked Lists
  4. Stacks
  5. Queues
  6. Trees
  7. Priority Queue and Heaps
  8. Disjoint Sets ADT
  9. Graph Algorithms
  10. Sorting
  11. Searching
  12. Selection Algorithms [Medians]
  13. Symbol Tables
  14. Hashing
  15. String Algorithms
  16. Algorithms Design Techniques
  17. Greedy Algorithms
  18. Divide and Conquer Algorithms
  19. Dynamic Programming
  20. Complexity Classes
  21. Miscellaneous Concepts

Why you should read Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles by Narasimha Karumanchi

This book has been written by Narasimha Karumanchi, who has written books like Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer and Dynamic Programming,Data Structures and Algorithms for Gate: Solutions to All Previous Gate Questions Since 1991,Data Structures and Algorithms Made Easy,Elements of Computer Networking: An Integrated Approach (Concepts, Problems and Interview Questions),Coding Interview Questions. The books are written in Algorithms,Programming & Software Development,Networks & System Administration category. This book is read by people who are interested in reading books in category : Computer Science. So, if you want to explore books similar to This book, you must read and buy this book.

Other books by same author

Book Binding Language
Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer and Dynamic Programming Paperback English
Data Structures and Algorithms for Gate: Solutions to All Previous Gate Questions Since 1991 Paperback English
Data Structures and Algorithms Made Easy Paperback English
Elements of Computer Networking: An Integrated Approach (Concepts, Problems and Interview Questions) Paperback English
Coding Interview Questions Paperback English
Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles Paperback English
Data Structure and Algorithmic Thinking with Python Paperback English
Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles Paperback English
Data Structures and Algorithms Made Easy : Second Edition: Data Structure and Algorithmic Puzzles Paperback English
Coding Interview Questions Paperback English
Data Structures and Algorithms for GATE: Solutions to All Previous GATE Questions Since 1991 Paperback English
Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles Paperback English
Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles, Second Edition Paperback English
Peeling Design Patterns: For Beginners and Interviews Paperback English
It Interview Questions: A Primer for the It Job Interviews (Concepts, Problems and Interview Questions) Paperback English

How long would it take for you to read Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles

Depending on your reading style, this is how much time you would take to complete reading this book.

Reading Style Time To Finish The Book
Slow 86 hours
Average 43 hours
Good 28 hours
Excellent 14 hours
So if you are a Reader belonging in the Good category, and you read it daily for 1 hour, it will take you 28 days.
Note: A slow reader usually reads 100 words per minute, an average reader 200 words per minute, an average reader 300 words per minute and an excellent leader reads about 600-1000 words per minute, however the comprehension may vary.
Data Structure And Algorithms by Narasimha Karumanchi

This is an article about Data Structure and Algorithm narasimha karumanchi


  • Data Structures and Algorithms for Gate: Solutions to All Previous Gate Questions Since 1991

    Data Structures and Algorithms for Gate: Solutions to All Previous Gate Questions Since 1991

    - GATE Preparation Solutions to all previous GATE questions since 1991 Campus Preparation Degree/Masters Course Preparation Instructor's Reference Manual for Working People

  • Data Structure and Algorithmic Thinking with Python

    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.

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

    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.

  • Peeling Design Patterns: For Beginners and Interviews

    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.

  • It Interview Questions: A Primer for the It Job Interviews (Concepts, Problems and Interview Questions)

    It Interview Questions: A Primer for the It Job Interviews (Concepts, Problems and Interview Questions)

    - 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.

Searches in World for Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles

City Country Count
699
Mumbai India 3
Top Read Books

Top Reads

Bot