[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fZjNOyFJqB_pBKPkbs6uL4d1qN8cB9jRwZdwVAMgTdxA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-06-05 23:26:13",48316936,[8,9,10,11],"先来先服务","优先数","最高响应比优先","短作业优先",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},12,"6b45e7d5213bb3ee577cdbd32f679776","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0d27132e8e4c25614916fe2373258c2e.jpg","操作系统","8f55b7386c7d46e6868c35e270170717","第3章测试","在各种作业调度算法中,若所有作业同时到达,则平均等待时间最短的算法是( )",[21,32,41,46,49,57,66,75,84,93],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],48316933,[25,26,27,28],"外存","内存","A 和B","寄存器","处于后备状态的作业存放在( )中","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],48316934,[36,37,38,39],"先来先服务法","短作业优先法","时间片轮转法","优先级法","按照作业到达的先后次序调度作业,排队等待时间最长的作业被优先调度,这是指( )调度算法",{"answer":42,"createTime":5,"id":43,"options":44,"question":45,"source":30,"type":31},[],48316935,[36,39,37,38],"为了优先调度紧急进程或重要进程,调度算法应采用( )",{"answer":47,"createTime":5,"id":6,"options":48,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":50,"createTime":5,"id":51,"options":52,"question":56,"source":30,"type":31},[],48316937,[8,53,54,55],"静态","动态","短作业","( )优先权是在创建进程时确定的,确定之后在整个进程运行期间不再改变",{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":30,"type":31},[],48316938,[61,62,63,64],"周转时间","响应时间","等待时间","运行时","( )是指从作业提交给系统到作业完成的时间间隔",{"answer":67,"createTime":5,"id":68,"options":69,"question":74,"source":30,"type":31},[],48316939,[70,71,72,73],"计算机系统发生重大故障","有多个封锁的进程同时存在","若干进程因竞争资源而无休止地等待着,不释放已占有的资源","资源数大大少于进程数,或进程同时申请的资源数大大超过资源总数","操作系统出现死锁的原因是( )",{"answer":76,"createTime":5,"id":77,"options":78,"question":83,"source":30,"type":31},[],48316940,[79,80,81,82],"n*m","n*m+n","n*(m-1)","n*(m-1)+1","系统中有 n 个并发进程共同竞争资源,且每个进程都需要 m个资源,为使该系统不会发生死锁,资源数至少要有( )",{"answer":85,"createTime":5,"id":86,"options":87,"question":92,"source":30,"type":31},[],48316941,[88,89,90,91],"一定","不一定","--","---","当进程数大于资源数时,进程竞争资源( )会产生死锁",{"answer":94,"createTime":5,"id":95,"options":96,"question":101,"source":30,"type":31},[],48316942,[97,98,99,100],"进程优先权","资源的线性分配","进程推进顺序","分配队列优先权","在为多道程序所提供的可共享的系统资源不足时,可能出现死锁.但是,不适当的 ( )也可能产生死锁"]