[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fuNCBqN2onukjaJlVN7nSWvkA2yUOdPQcXT8EroqG1w8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-12-28 14:15:39",174699484,[8,9,10,11],"随作业长度变化","可以不同但预先固定","相同","可以不同但根据作业长度固定",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},129,"028e6430ab077554cde648cbfb5595da","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9c1e48361b00f3ee2086f4e259ed792b.jpg","计算机操作系统原理","work_40004940","复习知识点检测题-内存管理","在固定分区分配中,每个分区的大小是()",[21,33,42,51,60,69,72,81,90,99],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-12-28 14:15:38",174699474,[26,27,28,29],"存储保护的目的是限制内存的分配","在内存为M、有N个用户的分时系统中,每个用户占用M\u002FN的内存空间","在虚拟内存系统中,只要磁盘空间无限大,作业就能拥有任意大的编址空间","实现虚拟内存管理必须有相应硬件的支持","下面关于存储管理的叙述中,正确的是()","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],174699476,[37,38,39,40],"为进程分配内存空间","回收被进程释放的内存空间","提高内存的利用率","提高内存的物理存取速度","下列关于存储管理目标的说法中,错误的是()",{"answer":43,"createTime":23,"id":44,"options":45,"question":50,"source":31,"type":32},[],174699478,[46,47,48,49],"一个进程不能未被授权就访问另外一个进程的内存空间","内存保护可以通过操作系统(软件)来满足,不需要处理器(硬件)的支持","内存保护的方法有界地址保护和上下限地址保护","一个进程不能直接跳转到另一个进程的指令地址中","下列关于内存保护的描述中,不正确的是()",{"answer":52,"createTime":23,"id":53,"options":54,"question":59,"source":31,"type":32},[],174699480,[55,56,57,58],"操作系统","硬件机构","操作系统和硬件机构合作","操作系统或者硬件机构独立完成","内存保护需要由()完成,以保证进程空间不被非法访问",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":31,"type":32},[],174699482,[64,65,66,67],"III、V","II、III、IV","III、IV、V","II、III、IV、V","下列各种存储管理方式中,需要硬件地址变换机构的是().I. 单一连续分配II. 固定分区分配III. 页式存储管理IV. 动态分区分配V. 页式虚拟存储管理",{"answer":70,"createTime":5,"id":6,"options":71,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":73,"createTime":5,"id":74,"options":75,"question":80,"source":31,"type":32},[],174699486,[76,77,78,79],"无上邻空闲区也无下邻空闲区","有上邻空闲区但无下邻空闲区","有下邻空闲区但无上邻空闲区","有上邻空闲区也有下邻空闲区","在动态分区分配方案中,某一进程完成后,系统回收其主存空间并与相邻空闲区合并,为此需修改空闲区表,造成空闲区数减1的情况是()",{"answer":82,"createTime":5,"id":83,"options":84,"question":89,"source":31,"type":32},[],174699488,[85,86,87,88],"100K","190K","330K","410K","设内存的分配情况如下图所示.若要申请一块40KB的内存空间,采用最佳适应算法,则所得到的分区首址为().\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4b038ca410b8b9e740a31a9d4b687ec3.png\">",{"answer":91,"createTime":5,"id":92,"options":93,"question":98,"source":31,"type":32},[],174699490,[94,95,96,97],"120K+2","480K+154","30K+154","480K+2","某段表的内容见下表,一个逻辑地址为(2,154),它对应的物理地址为().段号|段首址|段长度\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2a211d87bae9fcf22f84d8cae14608bd.png\">",{"answer":100,"createTime":5,"id":101,"options":102,"question":107,"source":31,"type":32},[],174699492,[103,104,105,106],"编译过程","装入过程","链接过程","执行过程","动态重定位是在作业的()中进行的"]