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