Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles, Second Edition - Softcover

Karumanchi, Narasimha

 
9781468108866: Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles, Second Edition

Inhaltsangabe

"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:

  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   

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.