[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f88_ewW8-4ZlIzY1--jWxXjPgCcMog9FojdxZ7hlkHDE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-10-11 18:04:09",220342466,[8,9,10,11],"RR调度算法适合实时系统","时间片越大,系统开销越小","RR调度算法是一种抢占式调度算法","RR调度算法不支持进程的公平调度",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},32,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_46448557","导课作业","下列关于RR调度算法的说法中,哪项是正确的",[21,32,41,50,59,68,74,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],220342455,[25,26,27,28],"FCFS调度算法总是优先调度运行时间最短的作业","FCFS调度算法在单处理机系统中作为主要调度算法广泛使用","FCFS调度算法在进程调度中按照进程进入就绪队列的顺序进行调度","FCFS调度算法通过动态调整优先级来提高调度效率","下列关于FCFS(先来先服务)调度算法的说法中,哪一个是正确的","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],220342456,[36,37,38,39],"优先级调度算法","轮转调度算法","短作业优先调度算法","多级反馈队列调度算法","在进程调度中,哪种调度算法可能导致长作业的周转时间显著增加",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],220342457,[45,46,47,48],"First Come First Serve","Fastest Come Fast Serve","First Cost First Serve","Flexible Compute First Schedule","在操作系统中,FCFS调度算法的全称是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],220342458,[54,55,56,57],"FCFS","SJF","RR","Priority Queue","以下哪种调度算法优先考虑处理时间最短的进程",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],220342459,[63,64,65,66],"SJF调度算法可以避免长作业饥饿问题","SJF调度算法对短作业非常有利,但可能导致长作业等待时间过长","SJF调度算法总是能保证所有作业的等待时间均衡","SJF调度算法不需要预测作业的执行时间","下列关于SJF调度算法的描述,哪一项是正确的",{"answer":69,"createTime":5,"id":70,"options":71,"question":73,"source":30,"type":31},[],220342460,[54,55,56,72],"HRRN","以下哪种调度算法可以动态调整进程的优先级",{"answer":75,"createTime":5,"id":76,"options":77,"question":79,"source":30,"type":31},[],220342461,[54,55,56,78],"Priority","下列哪个调度算法采用了时间片的方式进行进程调度",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],220342462,[84,85,86,87],"优先级调度算法可以分为非抢占式和抢占式两种","抢占式优先级调度算法允许在运行过程中被更高优先级的进程打断","优先级调度算法不会导致进程出现饥饿","静态优先级在进程运行期间不会发生变化","关于优先级调度算法,以下说法错误的是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],220342463,[93,94,95,96],"优先调度等待时间最短的作业","优先调度运行时间最短的作业","优先调度响应比最高的作业","优先调度优先级最高的作业","HRRN调度算法的调度原则是( )",{"answer":99,"createTime":5,"id":6,"options":100,"question":19,"source":30,"type":31},[],[8,9,10,11]]