000			01470nam a2200229Ia 4500
003			NULRC
005			20250520100704.0
008			250520s9999 xx 000 0 und d
020			_a9781468101270
040			_cNULRC
050			_aQA 76.73.J38 .K37 2014
100			_aKarumanchi, Narasimha _eauthor
245		0	_aData structures and algorithms made easy in Java / _cNarasimha Karumanchi
260			_aMadinaguda, Hyerabad : _bCareerMonk Publications, _cc2014
300			_a391 pages : _billustrations ; _c28 cm.
365			_bUSD67.63
504			_aIncludes bibliographical references.
505			_a1. 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.
520			_aThe main objective of the book is not to give you the theorems and proofs about data structures and algorithms. I have followed a pattern of improving the problem solutions with different complexities ( for each problem, you will find multiple solutions with different, and reduced complexities).
650			_aCOMPUTER ALGORITHMS
942			_2lcc _cBK
999			_c11470 _d11470