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

Karumanchi, Narasimha

Couverture souple

ISBN 10 : 8192107558 ISBN 13 : 9788192107554

Editeur : CareerMonk Publications, 2013

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

A propos du livre

À propos de l?auteur

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. Karumanchi 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.

Détails de l'édition

• Éditeur: CareerMonk Publications
• Date d'édition: 2013
• Langue: anglais
• ISBN 10: 8192107558
• ISBN 13: 9788192107554
• Reliure: Broché
• Numéro d'édition: 2
• Nombre de pages: 412
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible