[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f-QEMdL0xjXWfUoVaP2Sn6OY1swMWjtBH6X_wHs7nwt4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-05-07 00:24:40",141783777,[8,9,10,11],"界地址保护","程序代码保护","数据保护","栈 保 护",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},97,"64fd4ccaeb508f3c7b6a9d96d432c9a9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","操作系统原理","work_34783777","23-24-2大学物理实验II期末复习题","分区分配内存管理方式的主要保护措施是()",[21,32,35,44,53,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],141783776,[25,26,27,28],"编辑","编译","链接","装载","在虚拟内存管理中,地址变换机构将逻辑地址变换为物理地址,形成该 逻 辑 地 址 的 阶 段 是 ( )","v1",0,{"answer":33,"createTime":5,"id":6,"options":34,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":30,"type":31},[],141783778,[39,40,41,42],"7MB","9MB","10MB","15MB","某基于动态分区存储管理的计算机,其主存容量为55MB (初始为空), 采用最佳适配 (Best Fit) 算法,分配和释放的顺序为:分配15MB, 分 配 3 0MB, 释放15MB, 分 配 8MB, 分 配 6MB, 此时主存中最大空闲分区的大小是()",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":30,"type":31},[],141783779,[48,49,50,51],"每个进程一 张段表,两张页表","每个进程的每个段一 张段表, 一 张页表","每个进程一 张段表,每个段一 张页表","每个进程一 张页表,每个段一 张段表","段页式存储管理中,地址映射表是()",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],141783780,[57,58,59,60],"8192","4096","2048","1024","在一 页式存储管理系统中,页表内容见右表.若页的大小 为 4KB, 则地址转换机构将逻辑地址O转换成的物理地址 为 ( 块 号 从 0 开 始 计 算 ) ( ). 页号 块号 0 2 1 1 3 3 4 7",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],141783781,[66,67,68,69],"分页式存储管理","分段式存储管理","固定分区式存储管理","段页式存储管理","不会产生内部碎片的存储管理是()",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],141783782,[75,76,77,78],"1","2","3","4","在段页式分配中, CPU 每次从内存中取 一 次数据需要( )次访问内存",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],141783783,[84,85,86,87],"以段为单位,每段是一个连续存储区","段与段之间必定不连续","段与段之间必定连续","每段是等长的","在分段存储管理方式中,( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],141783784,[93,94,95,96],"用分段方法来分配和管理物理存储空间,用分页方法来管理用户地址空间","用分段方法来分配和管理用户地址空间,用分页方法来管理物理存储空间","用分段方法来分配和管理主存空间,用分页方法来管理辅存空间","用分段方法来分配和管理辅存空间,用分页方法来管理主存空间","段页式存储管理汲取了页式管理和段式管理的长处,其实现原理结合了页式和段式管理的基本思想,即( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":104,"source":30,"type":31},[],141783785,[77,78,102,103],"5","6","某系统采用LRU 页置换算法和局部置换策略,若系统为进程P 预分配 了4个页框,进程P 访问页号的序列为0,1,2,7,0,5,3,5,0,2,7,6,则进程访问上述页 的过程中,产生页置换的总次数是()"]