| 000 | 01041 a2200205 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20240312094626.0 | ||
| 008 | 200103b ||||| |||| 00| 0 eng d | ||
| 020 | _a9788193245279 | ||
| 040 | _cJUIT, Solan | ||
| 082 | _a005.73 KAR | ||
| 100 | _aKarumanchi, Narasimha | ||
| 245 |
_aData Structures and Algorithms Made Easy: data structures and algorithmic puzzles _cby Narasimha Karumanchi |
||
| 260 |
_bCareerMonk Plublications, _c2020 & 2022. _aMumbai: |
||
| 300 | _a415p | ||
| 505 | _a1. Introduction 2. Recursion and Backtracking 3. Linked Lists 4. Stacks 5. Queues 6. Trees 7. Priority Queues 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. | ||
| 650 | _vData Structures | ||
| 650 | _vData Structures and Algorithms | ||
| 942 |
_2ddc _cTB |
||
| 999 |
_c72516 _d72516 |
||