Data Structures and Algorithms Made Easy by Narasimha Karumanchi

Data Structures and Algorithms Made Easy by Narasimha Karumanchi

Regular price
Checking stock...
Regular price
Checking stock...
Proud to be B-Corp

Our business meets the highest standards of verified social and environmental performance, public transparency and legal accountability to balance profit and purpose. In short, we care about people and the planet.

The feel-good place to buy books
  • Free delivery in the UK
  • Supporting authors with AuthorSHARE
  • 100% recyclable packaging
  • B Corp - kinder to people and planet
  • Buy-back with World of Books - Sell Your Books

Data Structures and Algorithms Made Easy by Narasimha Karumanchi

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

Data Structures and Algorithms Made Easy
Data Structures and Algorithms Made Easy in Java
Elements of Computer Networking
Data Structures and Algorithms Made Easy for GATE
Peeling Design Patterns
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. Prof. M. Sreenivasa Rao, is the current Director School of IT and also Professor of SIT Computer Science. He performs both his roles with ease. He is indeed a widely read and active person in the academic front. His articles and publications were published all over the world. Dr. A. Damodaram joined as faculty of Computer Science & Engineering at JNTU, Hyderabad in the year 1989. In two decades of dedicated service, he performed distinguished services to the University as a Professor, Head of the Department, Vice Principal, Director of UGC - Academic Staff College, Director, School of Continuing & Distance Education and presently Director, University Academic Audit Cell.

SKU Non disponible
ISBN 13 9780615459813
ISBN 10 0615459811
Titre Data Structures and Algorithms Made Easy
Auteur Narasimha Karumanchi
État Non disponible
Type de reliure Paperback
Éditeur CareerMonk
Année de publication 2011-05-01
Nombre de pages 450
Note de couverture La photo du livre est présentée à titre d'illustration uniquement. La reliure, la couverture ou l'édition réelle peuvent varier.
Note Non disponible