Data structures and algorithms made easy in Java / Narasimha Karumanchi
Material type:
TextPublication details: Madinaguda, Hyerabad : CareerMonk Publications, c2014Description: 391 pages : illustrations ; 28 cmISBN: - 9781468101270
- QA 76.73.J38 .K37 2014
Books
| Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
National University - Manila | LRC - Graduate Studies General Circulation | Gen. Ed. - CCIT | GC QA 76.73.J38 .K37 2014 (Browse shelf(Opens below)) | c.1 | Available | NULIB000009229 |
Browsing LRC - Graduate Studies shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| GC QA 76.73 .P45 2015 Python 3 object-oriented programming : unleash the power of Python 3 objects / | GC QA 76.73.J28 .J64 2014 A Concise introduction to data structures using Java / | GC QA 76.73.J38 .K35 2014 c.2 Advanced topics in Java : core concepts in data structures / | GC QA 76.73.J38 .K37 2014 Data structures and algorithms made easy in Java / | GC QA 76.73.J38 .L49 2014 Java foundations : introduction to program design and data structures / | GC QA 76.73.J38 .W45 2012 Data structures and algorithm analysis in Java / | GC QA 76.73.S67 2016 Sams teach yourself SQL in 24 hours / |
Includes bibliographical references.
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.
The 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).
There are no comments on this title.