{"id":"https://openalex.org/W4367549405","doi":"https://doi.org/10.47715/jpc.b.978-93-91303-50-1","title":"DATA STRUCTURES USING C","display_name":"DATA STRUCTURES USING C","publication_year":2023,"publication_date":"2023-04-30","ids":{"openalex":"https://openalex.org/W4367549405","doi":"https://doi.org/10.47715/jpc.b.978-93-91303-50-1"},"language":"en","primary_location":{"id":"doi:10.47715/jpc.b.978-93-91303-50-1","doi":"https://doi.org/10.47715/jpc.b.978-93-91303-50-1","is_oa":false,"landing_page_url":"http://dx.doi.org/10.47715/jpc.b.978-93-91303-50-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306488460","display_name":"Jupiter Publications Consortium eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"monograph"},"volume":null,"type":"book","is_traditional":true,"indexed_in":["crossref"],"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/A5052262354","display_name":"Chitra Ravi","orcid":"https://orcid.org/0000-0001-6185-4163","observed_orcids":["https://orcid.org/0000-0001-6185-4163"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chitra Ravi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5008728567","display_name":"S. Mohan Kumar","orcid":"https://orcid.org/0000-0001-6255-9203","observed_orcids":["https://orcid.org/0000-0001-6255-9203"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohan Kumar S","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5839,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.84677419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"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.7060999870300293,"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.7060999870300293,"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.290800005197525,"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/T13674","display_name":"Computer Science and Engineering","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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":1.0},{"id":"https://openalex.org/keywords/algorithms","display_name":"algorithms","score":0.9700000286102295},{"id":"https://openalex.org/keywords/c-programming-language","display_name":"C programming language","score":0.9860000014305115},{"id":"https://openalex.org/keywords/arrays","display_name":"arrays","score":0.9300000071525574},{"id":"https://openalex.org/keywords/linked-lists","display_name":"linked lists","score":1.0},{"id":"https://openalex.org/keywords/stacks","display_name":"stacks","score":0.9909999966621399},{"id":"https://openalex.org/keywords/queues","display_name":"queues","score":1.0},{"id":"https://openalex.org/keywords/trees","display_name":"trees","score":0.9950000047683716},{"id":"https://openalex.org/keywords/graphs","display_name":"graphs","score":0.9990000128746033},{"id":"https://openalex.org/keywords/hashing","display_name":"hashing","score":0.9890000224113464},{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.9990000128746033},{"id":"https://openalex.org/keywords/search-algorithms","display_name":"search algorithms","score":0.9269999861717224},{"id":"https://openalex.org/keywords/dynamic-memory-allocation","display_name":"dynamic memory allocation","score":0.9860000014305115},{"id":"https://openalex.org/keywords/recursion","display_name":"recursion","score":1.0},{"id":"https://openalex.org/keywords/file-handling","display_name":"file handling","score":0.9990000128746033},{"id":"https://openalex.org/keywords/avl-trees","display_name":"AVL trees","score":0.9959999918937683},{"id":"https://openalex.org/keywords/red-black-trees","display_name":"red-black trees","score":0.9390000104904175},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-trees","score":0.9990000128746033}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8139995336532593},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6968017816543579},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6941148042678833},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5402078628540039},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.5285844802856445},{"id":"https://openalex.org/C146101286","wikidata":"https://www.wikidata.org/wiki/Q7003418","display_name":"Linked list","level":2,"score":0.5260367393493652},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.5127261877059937},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4985344409942627},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.47581177949905396},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.47566765546798706},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.4697939157485962},{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.44266825914382935},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.43952837586402893},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.4255087375640869},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.42327505350112915},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39625731110572815},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.38875308632850647},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.35986819863319397},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.2223544716835022},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15969929099082947}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.47715/jpc.b.978-93-91303-50-1","doi":"https://doi.org/10.47715/jpc.b.978-93-91303-50-1","is_oa":false,"landing_page_url":"http://dx.doi.org/10.47715/jpc.b.978-93-91303-50-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306488460","display_name":"Jupiter Publications Consortium eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"monograph"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W6893213052","https://openalex.org/W4234544185","https://openalex.org/W2509642196","https://openalex.org/W7223148820","https://openalex.org/W7065962449","https://openalex.org/W7205413729","https://openalex.org/W6968140560","https://openalex.org/W2955288464","https://openalex.org/W1533833126","https://openalex.org/W2551458926"],"abstract_inverted_index":{"The":[0,24,50,94,110,146,161],"book":[1,25,51,95,111,130,147,162],"\"Data":[2],"Structures":[3],"Using":[4],"C\"":[5],"provides":[6,96],"a":[7,31,166,172,183],"comprehensive":[8],"guide":[9,33],"to":[10,28,41,101,179,194],"the":[11,20,71,107,129],"fundamental":[12],"concepts":[13,108],"of":[14,116],"data":[15,43,54,117,151,187],"structures":[16,44,55,118,152,188],"and":[17,37,45,65,67,79,91,99,105,119,125,140,159,168,189,191],"algorithms":[18,46,81,120,190],"using":[19,47,70,143],"C":[21,48,72,144,201],"programming":[22],"language.":[23,49,73,145],"is":[26,163],"designed":[27],"serve":[29],"as":[30,57,83,135,154],"practical":[32,175],"for":[34],"students,":[35],"professionals,":[36],"researchers":[38],"who":[39],"want":[40],"learn":[42],"covers":[52,76,131,149],"various":[53,77],"such":[56,82,134,153],"arrays,":[58],"linked":[59],"lists,":[60],"stacks,":[61],"queues,":[62],"trees,":[63,156,158],"graphs,":[64],"hashing,":[66],"their":[68],"implementation":[69],"It":[74,177],"also":[75,112,148],"sorting":[78],"searching":[80],"bubble":[84],"sort,":[85,88],"quicksort,":[86],"merge":[87],"binary":[89],"search,":[90],"linear":[92],"search.":[93],"numerous":[97],"examples":[98,115],"exercises":[100],"help":[102,180],"readers":[103,181],"practice":[104],"implement":[106],"learned.":[109],"includes":[113],"real-world":[114,196],"used":[121],"in":[122,165,186],"computer":[123],"science":[124],"engineering.":[126],"In":[127],"addition,":[128],"advanced":[132,150],"topics":[133],"dynamic":[136],"memory":[137],"allocation,":[138],"recursion,":[139],"file":[141],"handling":[142],"AVL":[155,223],"Red-Black":[157,225],"B-trees.":[160],"written":[164],"simple":[167],"easy-to-understand":[169],"language":[170],"with":[171],"focus":[173],"on":[174],"implementation.":[176],"aims":[178],"develop":[182],"solid":[184],"foundation":[185],"apply":[192],"them":[193],"solve":[195],"problems.":[197],"Keywords:":[198],"Data":[199],"Structures,":[200],"Programming":[202],"Language,":[203],"Algorithms,":[204,214,216],"Arrays,":[205],"Linked":[206],"Lists,":[207],"Stacks,":[208],"Queues,":[209],"Trees,":[210,224,226],"Graphs,":[211],"Hashing,":[212],"Sorting":[213],"Searching":[215],"Dynamic":[217],"Memory":[218],"Allocation,":[219],"Recursion,":[220],"File":[221],"Handling,":[222],"B-Trees.":[227]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2023-05-01T00:00:00"}