𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Data structures and algorithms made easy in Java: data structure and algorithmic puzzles

✍ Scribed by Karumanchi, Narasimha

Publisher
CareerMonk Publications
Year
2018
Tongue
English
Leaves
94
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

  1. Introduction -- 2. Recursion and backtracking -- 3. Linked lists -- 4. Stacks -- 5. Queues -- 6. Trees -- 7. Priority queues and Heaps -- 8. Disjoint set 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 -- 22. References.

✦ Table of Contents

  1. Introduction --
    2. Recursion and backtracking --
    3. Linked lists --
    4. Stacks --
    5. Queues --
    6. Trees --
    7. Priority queues and Heaps --
    8. Disjoint set 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 --
    22. References.

✦ Subjects

Computer algorithms;Computer programming;Data structures (Computer science);Problems and exercises;Computer programming -- Problems, exercises, etc

πŸ“œ SIMILAR VOLUMES

Data Structures and Algorithms Made Easy
πŸ“ Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles
✍ Karumanchi, Narasimha πŸ“‚ Library πŸ“… 2018;2017 πŸ› CareerMonk Publications 🌐 English

1. Introduction -- 2. Recursion and backtracking -- 3. Linked lists -- 4. Stacks -- 5. Queues -- 6. Trees -- 7. Priority queues and Heaps -- 8. Disjoint set ADT -- 9. Graph algorithms -- 10. Sorting -- 11. Searching -- 12. Selection algorithms [medians] -- 13. Symbol tables -- 14. Hashing -- 15. Str

Data Structures and Algorithms Made Easy
πŸ“ Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles
✍ Narasimha Karumanchi πŸ“‚ Library πŸ“… 2011 πŸ› CareerMonk Publications 🌐 English

<div><div><b>PeelingΒ </b>Data Structures and Algorithms<b>Β </b><b>for interviewsΒ </b><b>[re-printed on 19-November-2015]:Β </b></div><div><div><div><b>Table of Contents</b>:Β goo.gl/UeLODK</div><div><b></b></div><div><b>Sample Chapter</b>:Β goo.gl/remIdp</div><div><b>Found Issue?Β </b>goo.gl/forms/4Gt72

Data Structures and Algorithms Made Easy
πŸ“ Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles
✍ Narasimha Karumanchi πŸ“‚ Library πŸ“… 2017 πŸ› CareerMonk Plublications 🌐 English

Peeling Data Structures and Algorithms: <br /><br />Table of Contents: goo.gl/JFMgiU<br />Sample Chapter: goo.gl/n2Hk4i<br />Found Issue? goo.gl/forms/4Gt72YO81I<br />Videos: goo.gl/BcHq74<br /><br />"Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that o

Data Structures and Algorithms Made Easy
πŸ“ Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles
✍ Narasimha Karumanchi πŸ“‚ Library πŸ“… 2017 🌐 English

Peeling Data Structures and Algorithms: <br /><br />Table of Contents: goo.gl/JFMgiU<br />Sample Chapter: goo.gl/n2Hk4i<br />Found Issue? goo.gl/forms/4Gt72YO81I<br />Videos: goo.gl/BcHq74<br /><br />"Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that o