{"id":"https://openalex.org/W131368067","doi":null,"title":"Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, Second Edition","display_name":"Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, Second Edition","publication_year":2011,"publication_date":"2011-09-14","ids":{"openalex":"https://openalex.org/W131368067","mag":"131368067"},"language":"en","primary_location":{"id":"mag:131368067","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=2208179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"book","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009534104","display_name":"Narasimha Karumanchi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Narasimha Karumanchi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5009534104"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.6606000065803528,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.6606000065803528,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.31520000100135803,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.011800000444054604,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/data-structures","display_name":"data structures","score":0.9980000257492065},{"id":"https://openalex.org/keywords/algorithms","display_name":"algorithms","score":0.9980000257492065},{"id":"https://openalex.org/keywords/programming-puzzles","display_name":"programming puzzles","score":0.8809999823570251},{"id":"https://openalex.org/keywords/interview-preparation","display_name":"interview preparation","score":0.7770000100135803},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.628000020980835},{"id":"https://openalex.org/keywords/recursion","display_name":"recursion","score":0.6380000114440918},{"id":"https://openalex.org/keywords/backtracking","display_name":"backtracking","score":0.9729999899864197},{"id":"https://openalex.org/keywords/linked-lists","display_name":"linked lists","score":0.996999979019165},{"id":"https://openalex.org/keywords/stacks","display_name":"stacks","score":0.7129999995231628},{"id":"https://openalex.org/keywords/queues","display_name":"queues","score":1.0},{"id":"https://openalex.org/keywords/trees","display_name":"trees","score":0.9860000014305115},{"id":"https://openalex.org/keywords/priority-queues","display_name":"priority queues","score":0.7609999775886536},{"id":"https://openalex.org/keywords/heaps","display_name":"heaps","score":0.8550000190734863},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"disjoint sets","score":0.9179999828338623},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.9380000233650208},{"id":"https://openalex.org/keywords/sorting","display_name":"sorting","score":0.9580000042915344},{"id":"https://openalex.org/keywords/search","display_name":"search","score":0.9959999918937683},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"selection algorithm","score":0.9430000185966492},{"id":"https://openalex.org/keywords/median","display_name":"median","score":0.6970000267028809},{"id":"https://openalex.org/keywords/symbol-table","display_name":"symbol table","score":0.9850000143051147},{"id":"https://openalex.org/keywords/hashing","display_name":"hashing","score":0.9860000014305115},{"id":"https://openalex.org/keywords/string-algorithms","display_name":"string algorithms","score":0.9940000176429749},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.9950000047683716},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.9980000257492065},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":1.0},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6200000047683716},{"id":"https://openalex.org/keywords/algorithm-design-techniques","display_name":"algorithm design techniques","score":0.5149999856948853}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7699694633483887},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.570699155330658},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5478475093841553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5045984983444214},{"id":"https://openalex.org/C70388272","wikidata":"https://www.wikidata.org/wiki/Q5968558","display_name":"IBM","level":2,"score":0.49758246541023254},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42852717638015747},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.427179217338562},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.42579782009124756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36439579725265503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09768620133399963},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:131368067","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=2208179","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2498003553","https://openalex.org/W2509580428","https://openalex.org/W2512849670","https://openalex.org/W2765896689","https://openalex.org/W7205311233","https://openalex.org/W1560262631","https://openalex.org/W1495010687","https://openalex.org/W57077395","https://openalex.org/W3111072203","https://openalex.org/W3158741671"],"abstract_inverted_index":{"Video":[0],"Link:":[1],"youtube.com/watch?v=l_GRquIrVygPeeling":[2],"Data":[160],"Structures":[4,161],"and":[5,37,54,58,100,104,124,142,162,173],"Algorithms":[6,111,117,118,122,126,163],"for":[7,12,41,139,159],"(Java,":[8],"Second":[9],"Edition):Programming":[10],"puzzles":[11],"interviewsCampus":[13],"PreparationDegree/Masters":[14],"Course":[15],"PreparationInstructor'sBig":[16],"job":[17],"hunters:":[18],"Microsoft,":[19],"Google,":[20],"Apple,":[21],"Amazon,":[22],"Yahoo,":[23],"Flip":[24],"Kart,":[25],"Adobe,":[26],"IBM":[27],"Labs,":[28],"Citrix,":[29],"Mentor":[30],"Graphics,":[31],"NetApp,":[32],"Oracle,":[33],"Face":[34],"book,":[35],"McAfee":[36],"many":[38],"moreReference":[39],"Manual":[40],"working":[42],"people":[43],"What":[44],"is":[45],"unique?":[46],"Our":[47],"main":[48],"objective":[49],"isn't":[50],"to":[51,72],"propose":[52],"theorems":[53],"proofs":[55],"about":[56],"DS":[57],"Algorithms.":[59],"Wetook":[60],"the":[61],"direct":[62],"route":[63],"andsolved":[64],"problemsofvarying":[65],"complexities.":[66,76],"That":[67],"is,":[68],"each":[69],"problem":[70],"corresponds":[71],"multiple":[73],"solutions":[74],"withdifferent":[75],"In":[77],"other":[78],"words,":[79],"we":[80],"ennumerated":[81],"possible":[82],"solutions.":[83],"With":[84],"this":[85],"approach,":[86],"evenwhen":[87],"anew":[88],"question":[89],"arises,weoffer":[90],"a":[91],"choice":[92],"ofdifferent":[93],"solution":[94],"strategies":[95],"based":[96],"onyour":[97],"priorities.Topics":[98],"Covered:IntroductionRecursion":[99],"BacktrackingLinked":[101],"ListsStacksQueuesTreesPriority":[102],"Queue":[103],"HeapsDisjoint":[105],"Sets":[106],"ADTGraph":[107],"AlgorithmsSorting":[108],"Searching":[109],"Selection":[110],"[Medians]":[112],"Symbol":[113],"Tables":[114],"Hashing":[115],"String":[116],"Design":[119],"Techniques":[120],"Greedy":[121],"Divide":[123],"Conquer":[125],"Dynamic":[127],"Programming":[128],"Complexity":[129],"Classes":[130],"Miscellaneous":[131],"Concepts":[132],"Target":[133],"Audience?":[134],"These":[135],"books":[136],"prepare":[137],"readers":[138],"interviews,":[140],"exams,":[141],"campus":[143],"work.":[144],"Language?":[145],"All":[146],"code":[147],"was":[148],"written":[149],"in":[150],"Java.":[151],"If":[152],"you":[153],"are":[154],"using":[155],"C/C++,":[156],"please":[157],"search":[158],"Made":[164],"Easy":[165],"(ISBN:":[166],"978-1468108866).":[167],"Also,":[168],"check":[169],"out":[170],"sample":[171],"chapters":[172],"theblog":[174],"at:":[175],"CareerMonk.com":[176]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}