[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f320GCovIODGzsNcfmIdyTuzrh5ZFcANJr50otamsEUA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2023-06-18 16:41:29",69722338,[8,9,10,11],"拒绝分配新资源","撤消进程","执行并行操作","修改信号量",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},76,"86c68a56e3b7a5e67cfcb86248c5233d","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9241cc440e942daf2e35c11a7aa3328f.jpg","操作系统","work_26582797","第3章作业","采用资源剥夺法可解除死锁,还可以采用( )方法解除死锁",[21,32,41,44,52,60,69,78,87,96],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],69722336,[25,26,27,28],"先来先服务","响应比高者优先","短作业优先","优先级调度","既考虑作业等待时间,又考虑作业执行时间的调度算法是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],69722337,[36,37,38,39],"时间片轮转调度算法","长作业优先调度算法","短作业优先调度算法","先来先服务调度算法","在采用动态优先权的优先权调度算法中,如果所有进程都具有相同优先权初值,则此时的优先权调度算法实际上和( )相同",{"answer":42,"createTime":5,"id":6,"options":43,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":45,"createTime":5,"id":46,"options":47,"question":51,"source":30,"type":31},[],69722339,[48,49,25,50],"短作业","动态","静态","( )优先权是在创建进程时确定的,确定之后在整个进程运行期间不再改变",{"answer":53,"createTime":5,"id":54,"options":55,"question":59,"source":30,"type":31},[],69722340,[56,57,58,36],"非抢占式动态优先权法","抢占式动态优先权法","抢占式静态优先权法","下列进程调度算法中,( )可能会出现进程长期得不到调度的情况",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":30,"type":31},[],69722341,[64,65,66,67],"请求与保持","请求与阻塞","请求与释放","释放与阻塞","产生死锁的四个必要条件是:互斥、( )、循环等待和不可剥夺",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":30,"type":31},[],69722342,[73,74,75,76],"该进程是一个短进程","该进程最早进入就绪队列","就绪队列为空","该进程的优先级最高","分时系统中的当前运行进程连续获得了两个时间片,原因可能是( )",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":30,"type":31},[],69722343,[82,83,84,85],"Max[i,j]=Allocation[i,j]+Need[i,j]","Need[i,j]= Available[i,j]+ Max[i,j]","Need[i,j]= Max[i,j] + Allocation[i,j]","Max[i,j]= Available[i,j]-Need[i,j]","银行家算法中的数据结构包括有可利用资源向量Available、最大需求矩阵Max、分配矩阵Allocation、需求矩阵Need,下列选项正确的是( )",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":30,"type":31},[],69722344,[91,92,93,94],"资源分配图简化法","银行家算法","消进程法","资源静态分配法","在下列选项中,属于检测死锁的方法是( )",{"answer":97,"createTime":5,"id":98,"options":99,"question":104,"source":30,"type":31},[],69722345,[100,101,102,103],"30ms","50ms","40ms","20ms","某系统中预计有50个用户同时上机,为使每个用户能在2秒内得到响应,时间片最大限度为( )"]