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