[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$ffR4hwXo0z7FE47tmic83WrLz3a9AFhtyGhEDh8XWqZU":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":22,"origin":106,"createTime":24},103969191,"v1","响应时间介于轮转调度算法和先来先服务调度算法之间的是( )",[8,9,10,11],"最短进程优先调度算法","线性优先级调度算法","最短剩余时间优先调度算法","最高响应比优先调度算法",[],[14,25,29,39,49,59,69,79,88,98],{"id":15,"source":5,"question":16,"options":17,"answer":20,"related":21,"type":22,"origin":23,"createTime":24},103969188,"下列进程调度算法中,综合考虑进程等待时间和执行时间的是( )",[18,8,19,11],"时间片轮转调度算法","先来先服务调度算法",[],[],0,null,"2023-11-08T05:01:07+08:00",{"id":4,"source":5,"question":6,"options":26,"answer":27,"related":28,"type":22,"origin":23,"createTime":24},[8,9,10,11],[],[],{"id":30,"source":5,"question":31,"options":32,"answer":37,"related":38,"type":22,"origin":23,"createTime":24},103969193,"下列选项中,满足短任务优先且不会发生饥饿现象的调度算法是( )",[33,34,35,36],"先来先服务","高响应比优先","时间片轮转","非抢占式短任务优先",[],[],{"id":40,"source":5,"question":41,"options":42,"answer":47,"related":48,"type":22,"origin":23,"createTime":24},103969196,"对长短进程比较公平的算法是( )",[43,44,45,46],"先来先服务(FCFS)","轮转(RR)","最短进程优先调度算法(SPN)","最短剩余时间优先调度算法(SRT)",[],[],{"id":50,"source":5,"question":51,"options":52,"answer":57,"related":58,"type":22,"origin":23,"createTime":24},103969197,"假设四个进程到达系统的时间、运行时间和优先级(数值越大,优先级越高)如下表所示: 进程号 到达时间 运行时间 优先级 1 0 4 1 2 1 3 4 3 2 6 3 4 3 5 2 进程1到达即开始运行,则以下说法正确的是( )",[53,54,55,56],"使用最短进程优先调度算法,进程调度顺序是2、1、4、3","使用最高优先级优先调度算法与使用先来先服务调度算法,进程调度顺序相同","使用最短进程优先调度算法与使用最高优先级优先调度算法,进程调度顺序相同","以上都不对",[],[],{"id":60,"source":5,"question":61,"options":62,"answer":67,"related":68,"type":22,"origin":23,"createTime":24},103969199,"以下说法中正确的是( )",[63,64,65,66],"短进程优先调度算法是一种剥夺式调度算法","若现行进程等待某一事件时引起调度,则该系统采用的是剥夺式调度","实时操作系统中通常采用剥夺式调度","在剥夺式系统中,进程的周转时间较之非剥夺式系统是可预见的",[],[],{"id":70,"source":5,"question":71,"options":72,"answer":77,"related":78,"type":22,"origin":23,"createTime":24},103969201,"作业J1、J2、J3同时到达,执行时间分别为J1:100s,J2:50s,J3:300s.若这三个作业在单处理机系统上以单道批处理方式运行,则按照以下几种顺序执行三个作业,平均周转时间最小的( )",[73,74,75,76],"J1,J2,J3","J2,J3,J1","J2,J1,J3","J3,J1,J2",[],[],{"id":80,"source":5,"question":81,"options":82,"answer":86,"related":87,"type":22,"origin":23,"createTime":24},103969203,"为了对紧急或重要的进程进行调度,应采用( )算法",[43,83,84,85],"优先级(HPF)","最短进程优先(SPN)","时间片轮转(RR)",[],[],{"id":89,"source":5,"question":90,"options":91,"answer":96,"related":97,"type":22,"origin":23,"createTime":24},103969205,"在单处理器多进程系统中,下列关于处理机调度的叙述中错误的是( )",[92,93,94,95],"在进程结束时能进行处理机调度","创建新进程后能进行处理机调度","在进程处于临界区时不能进行处理机调度","在系统调用完成并返回用户态时能进行处理机调度",[],[],{"id":99,"source":5,"question":100,"options":101,"answer":103,"related":104,"type":22,"origin":23,"createTime":105},103969208,"为提高多道批处理系统的吞吐量,应优先考虑( )调度算法",[43,102,83,85],"短进程优先(SPN)",[],[],"2023-11-08T05:01:08+08:00",{"courseName":107,"courseImg":108,"workName":109,"workId":109,"count":22,"courseId":110},"操作系统","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F94ace0f27523af2fb6ebafbb051b74ae.png","","50e2ff76783c3e41fa96af47e85fee5e"]