{"product_id":"data-structures-and-algorithms-made-easy-in-java-data-structure-and-algorithmic-puzzles-second-edition-paperback","title":"Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, Second Edition - Paperback","description":"\u003cp\u003eby \u003cb\u003eNarasimha Karumanchi\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003eVideo Link: youtube.com\/watch?v=l_GRquIrVyg \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003eA handy guide of sorts for any computer science professional, \u003ci\u003eData Structures And Algorithms Made Easy in Java: Data Structure And Algorithmic Puzzles\u003c\/i\u003e is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. \u003cp\u003e\u003c\/p\u003e The book has around 21 chapters and covers 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. \u003cp\u003e\u003c\/p\u003eData Structures And Algorithms Made Easy in Java: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in 2011, and it is coded in Java language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in C\/C++. In short, this book offers solutions to various complex data structures and algorithmic problems. \u003cp\u003e\u003c\/p\u003e\u003cb\u003ePeeling Data Structures and Algorithms for (\u003c\/b\u003e\u003cb\u003eJava, Second Edition): \u003c\/b\u003e\u003cul\u003e\n\u003cli\u003eProgramming puzzles for interviews\u003c\/li\u003e\n\u003cli\u003eCampus Preparation\u003c\/li\u003e\n\u003cli\u003eDegree\/Masters Course Preparation\u003c\/li\u003e\n\u003cli\u003eInstructor's\u003c\/li\u003e\n\u003cli\u003eBig job hunters: Microsoft, Google, Apple, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Face book, McAfee and many more\u003c\/li\u003e\n\u003cli\u003eReference Manual for working people\u003c\/li\u003e\n\u003c\/ul\u003e \u003cb\u003eWhat is unique?\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003e Our main objective isn't to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities. In other words, we ennumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities. \u003cp\u003e\u003c\/p\u003e\u003cb\u003eTopics Covered: \u003c\/b\u003e\u003cbr\u003e\u003cul\u003e\n\u003cli\u003eIntroduction\u003c\/li\u003e\n\u003cli\u003eRecursion and Backtracking\u003c\/li\u003e\n\u003cli\u003eLinked Lists\u003c\/li\u003e\n\u003cli\u003eStacks\u003c\/li\u003e\n\u003cli\u003eQueues\u003c\/li\u003e\n\u003cli\u003eTrees\u003c\/li\u003e\n\u003cli\u003ePriority Queue and Heaps\u003c\/li\u003e\n\u003cli\u003eDisjoint Sets ADT\u003c\/li\u003e\n\u003cli\u003eGraph Algorithms\u003c\/li\u003e\n\u003cli\u003eSorting \u003c\/li\u003e\n\u003cli\u003eSearching \u003c\/li\u003e\n\u003cli\u003eSelection Algorithms  Medians] \u003c\/li\u003e\n\u003cli\u003eSymbol Tables \u003c\/li\u003e\n\u003cli\u003eHashing \u003c\/li\u003e\n\u003cli\u003eString Algorithms \u003c\/li\u003e\n\u003cli\u003eAlgorithms Design Techniques \u003c\/li\u003e\n\u003cli\u003eGreedy Algorithms \u003c\/li\u003e\n\u003cli\u003eDivide and Conquer Algorithms \u003c\/li\u003e\n\u003cli\u003eDynamic Programming \u003c\/li\u003e\n\u003cli\u003eComplexity Classes \u003c\/li\u003e\n\u003cli\u003eMiscellaneous Concepts \u003c\/li\u003e\n\u003c\/ul\u003e\u003cb\u003eTarget Audience?\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003e These books prepare readers for interviews, exams, and campus work. \u003cp\u003e\u003c\/p\u003e\u003cb\u003eLanguage?\u003c\/b\u003e \u003cp\u003e\u003c\/p\u003e All code was written in Java. If you are using C\/C++, please search for \"Data Structures and Algorithms Made Easy\".\u003cbr\u003e\u003cb\u003e \u003c\/b\u003e\u003cbr\u003eAlso, check out sample chapters and the blog at: CareerMonk.com\u003ch3\u003eAuthor Biography\u003c\/h3\u003e\u003cp\u003eNarasimha Karumanchi is the founder of CareerMonk and author of few books on data structures, algorithms, and design patterns. He was a software developer who has been both interviewer and interviewee over his long career. Most recently he worked for Amazon Corporation, IBM labs, Mentor Graphics, and Microsoft. He filed patents which are under processing. \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003eHe authored the following books which got translated to international languages: Chinese, Japanese, Korea and Taiwan. Also, around 58 international universities were using these books as reference for academic courses. \u003cp\u003e\u003c\/p\u003e Data Structures and Algorithms Made Easy\u003cbr\u003e Data Structures and Algorithms Made Easy in Java\u003cbr\u003e Elements of Computer Networking\u003cbr\u003e Data Structures and Algorithms Made Easy for GATE\u003cbr\u003e Peeling Design Patterns\u003cbr\u003e Coding Interview Questions \u003cp\u003e\u003c\/p\u003eNarasimha held 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. \u003cb\u003eProf. M. Sreenivasa Rao\u003c\/b\u003e, is the current Director School of IT and also Professor of SIT Computer Science. He performs both his roles with ease. He is indeed a widely read and active person in the academic front. His articles and publications were published all over the world. \u003cb\u003eDr. A. Damodaram\u003c\/b\u003e joined as faculty of Computer Science \u0026amp; Engineering at JNTU, Hyderabad in the year 1989. In two decades of dedicated service, he performed distinguished services to the University as a Professor, Head of the Department, Vice Principal, Director of UGC - Academic Staff College, Director, School of Continuing \u0026amp; Distance Education and presently Director, University Academic Audit Cell.\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 414\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.85 x 11.02 x 8.5 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e December 16, 2011\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":42711266918463,"sku":"9788192107554","price":40.3,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/41a1edd86a9664ebd9e7322283c7c7cc.webp?v=1765057900","url":"https:\/\/dhl-adrianne.myshopify.com\/products\/data-structures-and-algorithms-made-easy-in-java-data-structure-and-algorithmic-puzzles-second-edition-paperback","provider":"BBB","version":"1.0","type":"link"}