{"id":"https://openalex.org/W4240215747","doi":"https://doi.org/10.1017/cbo9780511624179.010","title":"DYNAMIC STORAGE","display_name":"DYNAMIC STORAGE","publication_year":1994,"publication_date":"1994-04-28","ids":{"openalex":"https://openalex.org/W4240215747","doi":"https://doi.org/10.1017/cbo9780511624179.010"},"language":"en","primary_location":{"id":"doi:10.1017/cbo9780511624179.010","doi":"https://doi.org/10.1017/cbo9780511624179.010","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9780511624179.010","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Illustrating C","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4212865203","display_name":"Illustrating C"},"type":"book-chapter","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/A5012872249","display_name":"Donald G. Alcock","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Donald G. Alcock","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5012872249"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60623557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"143","last_page":"162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.8070999979972839,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.8070999979972839,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10533","display_name":"Teaching and Learning Programming","score":0.17180000245571136,"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.010599999688565731,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-storage","display_name":"dynamic storage","score":0.9269999861717224},{"id":"https://openalex.org/keywords/memory-allocation","display_name":"memory allocation","score":0.7789999842643738},{"id":"https://openalex.org/keywords/linked-lists","display_name":"linked lists","score":0.7839999794960022},{"id":"https://openalex.org/keywords/stacks","display_name":"stacks","score":0.9160000085830688},{"id":"https://openalex.org/keywords/rings","display_name":"rings","score":0.7770000100135803},{"id":"https://openalex.org/keywords/binary-trees","display_name":"binary trees","score":0.9980000257492065},{"id":"https://openalex.org/keywords/heaps","display_name":"heaps","score":0.3869999945163727},{"id":"https://openalex.org/keywords/memory-management","display_name":"memory management","score":0.4950000047683716},{"id":"https://openalex.org/keywords/shortest-path-algorithms","display_name":"shortest path algorithms","score":0.5979999899864197},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.7570000290870667},{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.7630000114440918}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.457610547542572}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/cbo9780511624179.010","doi":"https://doi.org/10.1017/cbo9780511624179.010","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9780511624179.010","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Illustrating C","raw_type":"book-chapter"}],"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/W4283073796","https://openalex.org/W3095821386","https://openalex.org/W3200882429","https://openalex.org/W4252045692","https://openalex.org/W2223058679","https://openalex.org/W1030618552","https://openalex.org/W2491596571","https://openalex.org/W6885126270","https://openalex.org/W967854932","https://openalex.org/W4230915325"],"abstract_inverted_index":{"This":[0],"chapter":[1,57],"explains":[2],"the":[3,11,70,85,97,125,139,190,215,227],"shortcomings":[4],"of":[5,19,32,109,168,202],"arrays":[6,94,171],"having":[7],"pre-determined":[8],"length":[9],"and":[10,24,51,65,145],"consequent":[12],"need":[13,133],"for":[14,22,61,68,118],"dynamic":[15],"storage.":[16],"The":[17,30,43,91,175],"use":[18,152],"library":[20],"functions":[21],"allocating":[23],"freeing":[25],"memory":[26,127,142,162,216],"is":[27,36,45,79,95,121,134,177,185],"then":[28,46],"explained.":[29],"concept":[31,44],"a":[33,59,66,74,80,135,154,193,200,206,211],"linked":[34],"list":[35],"introduced":[37],"with":[38,93,210],"particular":[39],"reference":[40],"to":[41,48,100,105,107,123,151],"stacks.":[42],"extended":[47],"cover":[49],"rings":[50],"binary":[52],"trees.":[53],"Examples":[54],"in":[55,129,137],"this":[56],"include":[58],"program":[60,67,82,149,191,207],"demonstrating":[62],"ring":[63],"structures":[64],"finding":[69],"shortest":[71],"route":[72],"through":[73],"road":[75],"network.":[76],"Finally":[77],"there":[78],"sorting":[81],"based":[83,186],"on":[84,146,160,187,226],"monkey":[86],"puzzle":[87],"technique.":[88],"MEMORY":[89],"ALLOCATION":[90],"trouble":[92],"that":[96,219],"processor":[98,140],"has":[99,208],"be":[101],"told":[102],"what":[103],"space":[104],"allocate":[106],"each":[108],"them":[110],"before":[111],"execution":[112,144],"starts.":[113],"There":[114],"are":[115],"many":[116,169],"applications":[117],"which":[119,138,218],"it":[120,184,196,213,224],"impossible":[122],"know":[124],"detailed":[126],"requirements":[128],"advance.":[130],"What":[131],"we":[132],"scheme":[136,155,176],"allocates":[141],"during":[143],"demand.":[147],"A":[148],"written":[150],"such":[153],"fails":[156],"only":[157],"if":[158,166],"demands":[159],"total":[161],"exceed":[163],"supply,":[164],"not":[165],"one":[167,198],"individual":[170],"exceeds":[172],"its":[173],"bounds.":[174],"called":[178],"\u2018dynamic":[179],"storage.\u2019":[180],"For":[181],"practical":[182],"purposes":[183],"structures.":[188],"When":[189,205],"needs":[192],"new":[194],"structure":[195,212,220],"creates":[197],"from":[199,217],"\u2018heap\u2019":[201],"unstructured":[203],"memory.":[204],"finished":[209],"frees":[214],"was":[221],"built,":[222],"tossing":[223],"back":[225],"heap.":[228]},"counts_by_year":[],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2022-05-12T00:00:00"}