[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f1JSmr8eh5yHAV73WB0t3U2QmYoSfuogiew7_RUMIEog":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-05-18 20:55:50",188841732,[8,9,10,11],"128","256","64","512",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},42,"27cb0a27b33ce74c90dce48a177e485c","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e2d5ad53be3d12aacc56ee37db405b7.jpg","操作系统","work_43210382","第5章存储器管理作业","某计算机采用二级分页存储管理方式,按字节编址,页大小为210B,页表项大小为2B,逻辑地址结构为: 页目录号 页号 页内偏移量 逻辑地址空间大小为216页,则表示整个逻辑地址空间的页目录表中所包含的表项个数至少是( )",[21,32,41,50,59,68,77,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],188841726,[25,26,27,28],"20K、180KB","500K、180KB","20K、380KB","500K、80KB","某计算机按字节编址,其动态分区存储管理采用最佳适应算法,每次分配和回收内存后都对空闲分区链重新排序.当前的空闲分区信息如 表2-5-1所示. 表2-5-1空闲分区信息 分区起始地址 分区大小 分区起始地址 分区大小 20K 40KB 1000K 100KB 500K 80KB 200K 200KB 回收起始地址为60K、大小为140KB的分区后,系统中空闲分区链第1个分区的起始地址和大小分别是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],188841727,[36,37,38,39],"便于回收空白分区","解决碎片问题","便于用户干预","便于多作业共享内存","可重定位内存的分区分配目的是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],188841728,[45,46,47,48],"防止多道作业占用同一处理机","防止各道作业相互干扰","防止一道作业占用多个分区","防止作业非法访问磁盘文件","在适合多道程序运行的分区存储管理系统中,存储保护是为了( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],188841729,[54,55,56,57],"栈保护","数据保护","程序代码保护","界地址保护","分区分配内存管理方式的主要保护措施是( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],188841730,[63,64,65,66],"段缺失异常","越权异常","越界异常","得到内存地址4400","某进程的段表内容如表2-5-3所示. 表2-5-3段表 段号 段长 内存起始地址 权限 状态 0 100 6000 只读 在内存 1 200 读\u002F写 不在内存 2 300 4000 读\u002F写 在内存 当访问段号为2、段内地址为400的逻辑地址时,地址转换的结果是( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],188841731,[72,73,74,75],"减少页表项所占字节数","加快地址转换速度","减少缺页中断次数","减小页表所占的连续内存空间","下列选项中,属于多级页表的优点的是( )",{"answer":78,"createTime":5,"id":6,"options":79,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],188841733,[84,85,86,87],"虽有上邻空闲分区,但无下邻空闲分区","既无上邻空闲分区,又无下邻空闲分区","既有上邻空闲分区,又有下邻空闲分区","虽无上邻空闲分区,但有下邻空闲分区","在可变分区分配方案中,当某一作业完成、系统回收其内存空间时,回收分区可能存在与相邻空闲分区合并的情况,为此须修改空闲分区表. 其中,造成空闲分区数减1情况是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],188841734,[93,94,95,96],"201H、101H","081H、101H","201H、401H","081H、401H","某计算机内存按字节编址,采用二级分页存储管理方式,地址结构为: 页目录号(10位) 页号(10位) 页内偏移(12位) 虚拟地址2050 1225H对应的页目录号和页号分别是( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],188841735,[102,103,104,105],"装入时动态链接","运行时动态链接","静态链接","可重定位链接","在程序运行前,先将一个程序的所有模块以及所需的库函数链接成一个完成的装配模块,这种链接方式称为( )"]