[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f48_Z7wiyevJq9b0vtwj-V6NP5dT6VcaQO4Q_Z8qlvpU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2024-11-18 20:15:23",166413322,[8,9,10,11],"方便用户","提高内存利用率","方便用户和提高内存利用率","增加内存实际容量",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},21,"4911cb63b51c663dfe309d5e3e3f0bfa","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ffb4e0e6a5574c0a2bea5a3691ff957f7.jpg","操作系统（2024-2025-1）","work_38944365","第四章 存储器管理 单元测试","存储管理的目的是( )",[21,26,36,46,55,65,75,81,91,97],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":28,"id":29,"options":30,"question":35,"source":24,"type":25},[],"2024-11-18 20:15:24",166413323,[31,32,33,34],"程序编译时","程序链接时","程序装入时","程序运行时","静态重定位的时机是( )",{"answer":37,"createTime":38,"id":39,"options":40,"question":45,"source":24,"type":25},[],"2024-11-18 20:15:25",166413325,[41,42,43,44],"单一连续分配","固定分区分配","可变分区分配","分页存储管理","以下存储管理方式中,不适合多道程序设计系统的是( )",{"answer":47,"createTime":38,"id":48,"options":49,"question":54,"source":24,"type":25},[],166413327,[50,51,52,53],"合并空闲分区","合并分配区","增加内存容量","便于地址转换","在可变分区存储管理中,采用拼接技术的目的是( )",{"answer":56,"createTime":57,"id":58,"options":59,"question":64,"source":24,"type":25},[],"2024-11-18 20:15:26",166413329,[60,61,62,63],"无上邻空闲分区也无下邻空闲分区","有上邻空闲分区但无下邻空闲分区","有下邻空闲分区但无上邻空闲分区","有上邻空闲分区也有下邻空闲分区","在可变分区管理中,某程序运行结束后系统收回其内存空间并与相邻空闲分区合并,为此修改空闲区分配表,造成空闲分区数减1的情况是( )",{"answer":66,"createTime":67,"id":68,"options":69,"question":74,"source":24,"type":25},[],"2024-11-18 20:15:30",166413331,[70,71,72,73],"按大小递减顺序链接在一起","按大小递增顺序链接在一起","按地址由小到大排列","按地址由大到小排列","首次适应算法的空闲分区( )",{"answer":76,"createTime":77,"id":78,"options":79,"question":80,"source":24,"type":25},[],"2024-11-18 20:15:31",166413334,[70,71,72,73],"最佳适应算法的空闲分区是( )",{"answer":82,"createTime":83,"id":84,"options":85,"question":90,"source":24,"type":25},[],"2024-11-18 20:15:36",166413338,[86,87,88,89],"1","2","3","4","分段管理提供( )维的地址结构",{"answer":92,"createTime":93,"id":94,"options":95,"question":96,"source":24,"type":25},[],"2024-11-18 20:15:37",166413342,[86,88,87,89],"在分段存储管理中,CPU每次在内存中存取一次数据需要( )次访问内存",{"answer":98,"createTime":99,"id":100,"options":101,"question":106,"source":24,"type":25},[],"2024-11-18 20:15:39",166413346,[102,103,104,105],"请求分页管理","可变分区管理","分段管理","段页式管理","实现了分段、分页两种存储方式的优势互补"]