Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles

Karumanchi, Narasimha

ISBN 10: 8192107558 / ISBN 13: 9788192107554

Published by CareerMonk Publications, 2013

About this Item

Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. Seller Inventory # 3IIT7G005BZF_ns

Bibliographic Details

Title: Data Structures and Algorithms Made Easy in ...

Publisher: CareerMonk Publications

Publication Date: 2013

Binding: Soft cover

Condition: Acceptable

Edition: 2nd Edition

About this title

Synopsis:

Offering valuable insights for computer science professionals, "Data Structures And Algorithms Made Easy in Java: Data Structure And Algorithmic Puzzles" serves as a comprehensive solution hub for intricate problems within data structures and algorithms. This resourceful guide can serve as a quick reference for individuals working in the computer science sector.

Encompassing approximately 21 chapters, the book delves into an array of topics including Recursion and Backtracking, Linked Lists, Stacks, Queues, Trees, Priority Queue and Heaps, Disjoint Sets ADT, Graph Algorithms, Sorting, Searching, Selection Algorithms [Medians], Symbol Tables, Hashing, String Algorithms, Algorithms Design Techniques, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Complexity Classes, and other Miscellaneous Concepts.

Originally published in 2011 by Narasimha Karumanchi and written in Java, "Data Structures And Algorithms Made Easy in Java: Data Structure And Algorithmic Puzzles" is designed to aid in interview preparation, exam study, and academic coursework. It is also available in C/C++. In essence, the book offers solutions for intricate data structures and algorithmic predicaments.

What sets this guide apart is its practical approach. Rather than focusing solely on theorems and proofs about DS and Algorithms, the book prioritizes solving problems with varying complexities. Each problem is accompanied by multiple solutions of differing complexities, thus presenting a range of possible approaches. This unique approach equips readers with a toolkit of solution strategies to tackle a variety of questions based on individual priorities.

Topics Covered:

• Introduction
• Recursion and Backtracking
• Linked Lists
• Stacks
• Queues
• Trees
• Priority Queue and Heaps
• Disjoint Sets ADT
• Graph Algorithms
• Sorting
• Searching
• Selection Algorithms [Medians]
• Symbol Tables
• Hashing
• String Algorithms
• Algorithms Design Techniques
• Greedy Algorithms
• Divide and Conquer Algorithms
• Dynamic Programming
• Complexity Classes
• Miscellaneous Concepts

Also, check out sample chapters and the blog at: CareerMonk.com

About the Author:

Narasimha Karumanchi works at Amazon Corporation, India and is a senior software developer by profession. He has earlier worked for IBM labs, Mentor Graphics, and Microsoft.

He has founded CareerMonk, and is regular contributor to StockMonks, where he designs algorithms. He also submitted patents (still under progress). 

He authored the following books (few of these got translated to international languages: Chinese, Japanese, Korea and Taiwan).

   Data Structures and Algorithms Made Easy

   Data Structures and Algorithms Made Easy in Java

   Data Structures and Algorithms Made Easy for GATE

   Peeling Design Patterns

   Coding Interview Questions

   IT Interview Questions

   Data Structure and Algorithmic Thinking with Python

   Elements of Computer Networking

Narasimha did his M.Tech. in computer science from IIT, Bombay, after finishing his B.Tech. from JNT university. He has also taught data structures and algorithms at various training institutes and colleges.