menu
{ "item_title" : "Data Structures And Algorithms Made Easy", "item_author" : [" Narasimha Karumanchi "], "item_description" : "Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles is a book that offers solutions to complex 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: IntroductionRecursion and BacktrackingLinked ListsStacksQueuesTreesPriority Queue and HeapsDisjoint Sets ADTGraph AlgorithmsSortingSearchingSelection Algorithms [Medians]Symbol TablesHashingString AlgorithmsAlgorithms Design TechniquesGreedy AlgorithmsDivide and Conquer AlgorithmsDynamic ProgrammingComplexity ClassesMiscellaneous Concepts", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/8/19/324/528/8193245288_b.jpg", "price_data" : { "retail_price" : "29.99", "online_price" : "29.99", "our_price" : "29.99", "club_price" : "29.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Data Structures And Algorithms Made Easy|Narasimha Karumanchi

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

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

"Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex 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


This item is Non-Returnable

Details

  • ISBN-13: 9788193245286
  • ISBN-10: 8193245288
  • Publisher: Careermonk Publications
  • Publish Date: July 2023
  • Dimensions: 11 x 8.5 x 0.95 inches
  • Shipping Weight: 2.38 pounds
  • Page Count: 470

Related Categories

You May Also Like...

    1

BAM Customer Reviews