[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fxhi7Q1fcW8WCOEn2Ok-u4LP_gjDe_HUtse39upJxVJA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":29,"type":30},[],"2023-05-09 20:37:41",35448319,[8,9,10,11],"2","1","3","5",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000007568","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F96a18b04c8eed57bba9ae654019e5235.png","操作系统（鲁东大学）","16385583","第三章单元测试","一个作业8:00到达系统,估计运行时间为1h,请计算10:00时其响应比为()",[20,31,40,43,52,60,69,78,87,95],{"answer":21,"createTime":5,"id":22,"options":23,"question":28,"source":29,"type":30},[],35448295,[24,25,26,27],"计算机系统发生重大故障","资源个数远远小于进程数","若干进程因竞争资源而无限等待其他进程释放以占有的资源","进程同时申请的资源数超过资源总数","操作系统中死锁出现是指()","v2",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":29,"type":30},[],35448304,[35,36,37,38],"互斥","占有并请求","非剥夺","循环等待","一次分配所有资源的方法可以预防死锁的发生,它破坏了死锁四个必要条件中的()",{"answer":41,"createTime":5,"id":6,"options":42,"question":18,"source":29,"type":30},[],[8,9,10,11],{"answer":44,"createTime":5,"id":45,"options":46,"question":51,"source":29,"type":30},[],35448321,[47,48,49,50],"时间片轮转调度算法","短进程优先调度算法","先来先服务调度算法","高响应比优先调度算法","下列进程调度算法中,综合考虑进程等待时间和执行时间的是()",{"answer":53,"createTime":5,"id":54,"options":55,"question":59,"source":29,"type":30},[],35448322,[56,57,58],"高响应比优先","先来先服务","短进程优先","进程调度算法采用固定时间片轮转调度算法,当时间片过大时,就会使时间片轮转法转化为()调度算法",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":29,"type":30},[],35448323,[64,65,66,67],"尽快响应交互式用户的请求","尽量提高处理器利用率","尽可能提高系统吞吐量","适当增长进程就绪队列的等待时间","下面有关选择进程调度算法的准则中,不正确的是()",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":29,"type":30},[],35448326,[73,74,75,76],"T1+T2+T3","(3T1+2T2+T3\u002F3","(T1+T2+T3)\u002F3","(T1+2T2+3T3)\u002F3","有三个同时到达的作业J1、J2、J3,它们的执行时间分别是T1、T2、T3,且T1",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":29,"type":30},[],35448327,[82,83,84,85],"进程相应的代码长度","进程总共需要运行的时间","进程特点和进程调度策略","进程完成什么功能","单处理机系统中,进程什么时候占处理机及决定占用时间的长短是由()决定的",{"answer":88,"createTime":5,"id":89,"options":90,"question":94,"source":29,"type":30},[],35448337,[47,91,92,93],"静态优先数","非抢占式短任务优先","抢占式短任务优先","下列调度算法中,不可能导致饥饿现象的是()",{"answer":96,"createTime":5,"id":97,"options":98,"question":101,"source":29,"type":30},[],35448366,[57,99,100,58],"时间片轮转","优先级","下列调度算法中,()调度算法是绝对可抢占的"]