[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fgw1wWcCVugzTTaTsUB_rpmyXbqfMQ4xJuvNVns6pcME":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":29,"type":30},[],"2023-05-10 02:30:17",7682947,[8,9,10,11],"方便用户","提高内存利用率","方便用户和提高内存利用率","增加内存实际容量",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000010082","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1589c5da10d0a3c1c53955e176ff2d89.png","操作系统（吉林警察学院）","4622676","第五章单元测试","存储管理的目的是()",[20,31,40,49,58,67,70,76,85,94],{"answer":21,"createTime":5,"id":22,"options":23,"question":28,"source":29,"type":30},[],7682942,[24,25,26,27],"逻辑地址","物理地址","绝对地址","内存地址","通常,用户编写的程序中所使用的地址是()","v2",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":29,"type":30},[],7682943,[35,36,37,38],"编译","连接","运行","重定位","把逻辑地址转变为内存的物理地址的过程称作()",{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":29,"type":30},[],7682944,[44,45,46,47],"段表","页表","PCB","JCB","在分页存储管理系统中,从页号到物理块号的地址映射是通过( )实现的",{"answer":50,"createTime":5,"id":51,"options":52,"question":57,"source":29,"type":30},[],7682945,[53,54,55,56],"用户有条件地","用户无条件地","操作系统有条件地","操作系统无条件地","采用动态重定位方式装入的作业,在执行中允许()将其移动",{"answer":59,"createTime":5,"id":60,"options":61,"question":66,"source":29,"type":30},[],7682946,[62,63,64,65],"硬件","地址转换程序","用户程序","装入程序","分页式存储管理中,地址转换工作是由()完成的",{"answer":68,"createTime":5,"id":6,"options":69,"question":18,"source":29,"type":30},[],[8,9,10,11],{"answer":71,"createTime":5,"id":72,"options":73,"question":75,"source":29,"type":30},[],7682948,[62,74,64,65],"操作系统","在分页存储系统中,页表是由()建立的",{"answer":77,"createTime":5,"id":78,"options":79,"question":84,"source":29,"type":30},[],7682949,[80,81,82,83],"28","216","224","232","一个分段存储管理系统中,地址长度为32位,其中段号占8位,则最大段长是()",{"answer":86,"createTime":5,"id":87,"options":88,"question":93,"source":29,"type":30},[],7682950,[89,90,91,92],"始地址从小到大排序","始地址从大到小排序","块的大小从小到大排序","块的大小从大到小排序","在内存分配的"最佳适应法"中,空闲块是按()",{"answer":95,"createTime":5,"id":96,"options":97,"question":102,"source":29,"type":30},[],7682951,[98,99,100,101],"首次适应法","最佳适应法","最坏适应法","循环首次适应法","下面最有可能使得高地址空间成为大的空闲区的分配算法是()"]