[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fBt1vCSfP17MqvtDgTz_MsBSGinsVGOyeSqRfgYidlc8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":16,"related":17,"source":27,"type":41},[],"2023-06-18 01:09:08",89022488,[8,9],"对","错",{"courseId":11,"courseImg":12,"courseName":13,"workId":14,"workName":15},"1000069809","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F259239d95c17bb4370faded487d4231d.jpg","操作系统","35732567","第三章单元测试","在进程资源分配图中,环路是发生死锁的必要条件.( )",[18,29,38,42,47,56,65,75,84,93],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],89022479,[22,23,24,25],"存在安全序列P1,P2,P3","存在安全序列P2,P1,P3","存在安全序列P2,P3,P1","不存在安全序列","某系统中有A、B两类资源各6个,t时刻资源分配及需求情况如下表所示:\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F190c1abf3935e6d5098900671385f339.png\">t 时刻安全检测结果是:( )","v2",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],89022484,[33,34,35,36],"环路等待资源","互斥使用资源","占有且等待资源","非抢夺式分配","死锁的4个必要条件中,无法破坏的是( )",{"answer":39,"createTime":5,"id":6,"options":40,"question":16,"source":27,"type":41},[],[8,9],3,{"answer":43,"createTime":5,"id":44,"options":45,"question":46,"source":27,"type":41},[],89022503,[8,9],"时间片的大小对轮转法(RR)性能有很大的影响,时间片太短,会导致系统开销大大增加.( )",{"answer":48,"createTime":5,"id":49,"options":50,"question":55,"source":27,"type":28},[],89022506,[51,52,53,54],"SPF","FCFS","HRRN","多级反馈队列","在调度算法中,对短进程不利的是( )调度算法",{"answer":57,"createTime":5,"id":58,"options":59,"question":64,"source":27,"type":28},[],89022512,[60,61,62,63],"J3、J2、J1","J1、J2、J3","J1、J3、J2","J3、J1、J2","设有三个作业J1、J2、J3,它们的到达时间和执行时间如下表: \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F69a82a77cac61e1667ef417a68587816.png\">它们在一台处理器上按单道运行,若采用短作业优先调度算法,则此三作业的执行次序是( )",{"answer":66,"createTime":5,"id":67,"options":68,"question":73,"source":27,"type":74},[],89022529,[69,70,71,72],"就绪队列的数量","就绪队列的优先级","各就绪队列的调度算法","进程在就绪队列间的迁移条件","下列与进程调度有关的因素中在设计多级反馈队列调度算法时需要考虑的是( )",1,{"answer":76,"createTime":5,"id":77,"options":78,"question":83,"source":27,"type":28},[],89022533,[79,80,81,82],"时间片轮转调度算法","短进程优先调度算法","先来先服务调度算法","高响应比优先调度算法","下列进程调度算法中,综合考虑进程等待时间和执行时间的是( )",{"answer":85,"createTime":5,"id":86,"options":87,"question":92,"source":27,"type":28},[],89022539,[88,89,90,91],"作业运行时间","作业等待时间和运行时间之和","作业的相对等待时间","作业被调度进入内存到运行完毕的时间","在批处理系统中,周转时间是指( )",{"answer":94,"createTime":5,"id":95,"options":96,"question":101,"source":27,"type":28},[],89022545,[97,98,99,100],"时间片轮转","静态优先数调度","非抢占式短任务优先","抢占式短任务优先","下列调度算法中,不会导致饥饿现象的是( )"]