[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fXu5Xrbef_BSDlXqmgf_epeMme4XfijAq7hhh4VNcNjE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":26,"type":27},[],"2023-05-11 15:28:55",5326052,[8,9,10,11],"9","10","11","12",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},183,"fe553ab624d7d65270e7dfef2c11bb78","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcff366374ba292b84c42b15739ecc932.png","操作系统原理","6595125434ef40bbafdbc29b5242ce79","第四章测验","某系统中有3个并发进程,都需要4个同类资源.试问该系统不会产生死锁的最少资源总数应该是( )",[21,28,37,46,55,60,69,78,87,96],{"answer":22,"createTime":5,"id":23,"options":24,"question":25,"source":26,"type":27},[],5326043,[8,9,10,11],"某系统有n台互斥使用的同类设备,三个并发进程分别需要3、4、5台设备,可确保系统不发生死锁的设备数n最小为","v1",0,{"answer":29,"createTime":5,"id":30,"options":31,"question":36,"source":26,"type":27},[],5326044,[32,33,34,35],"互斥","请求和保持","不剥夺","环路等待","资源的有序分配可以破坏( )条件",{"answer":38,"createTime":5,"id":39,"options":40,"question":45,"source":26,"type":27},[],5326045,[41,42,43,44],"I.III","II","IV","四个说法都对","下列关于死锁的说法正确的有( ). I.死锁状态一定是不安全状态 II.产生死锁的根本原因是系统资源分配不足和进程推进顺序不合理 III.资源的有序分配策略可以破坏死锁的循环等待条件 IV.采用资源剥夺法可以解除死锁,还可以采用撤销进程方法解除死锁",{"answer":47,"createTime":5,"id":48,"options":49,"question":54,"source":26,"type":27},[],5326046,[50,51,52,53],"死锁避免","死锁防止","死锁检测","死锁解除","银行家算法是一种( )算法",{"answer":56,"createTime":5,"id":57,"options":58,"question":59,"source":26,"type":27},[],5326047,[32,33,34,35],"资源的全部分配可以破坏( )条件",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":26,"type":27},[],5326048,[64,65,66,67],"P1, P2, P3, P4","P1, P3, P2, P4","P1, P4, P3, P2","不存在","某时刻进程的资源使用情况如下表所示,此时的安全序列是( ). 已分配资源R1 R2 R3 尚需资源R1 R2 R3 可用资源R1 R2 R3 P1 2 0 0 0 0 1 0 2 1 P2 1 2 0 1 3 2 P3 0 1 1 1 3 1 P4 0 0 1 2 0 0",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":26,"type":27},[],5326049,[73,74,75,76],"银行家算法可以预防死锁","当系统处于安全状态时,系统中一定无死锁进程","当系统处于不安全状态时,系统中一定会出现死锁进程","银行家算法破坏了死锁必要条件中的"请求和保持"条件","下列关于银行家算法的叙述中,正确的是",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":26,"type":27},[],5326050,[82,83,84,85],"仅Ⅰ Ⅱ","仅Ⅱ Ⅲ","仅Ⅰ Ⅲ","Ⅰ Ⅱ Ⅲ","若系统 S1 采用死锁避免方法,S2 采用死锁检测方法,下列叙述中正确的是( ) Ⅰ.S1 会限制用户申请资源的顺序 Ⅱ.S1 需要进行所需资源总量信息,而 S2 不需要 Ⅲ.S1 不会给可能导致死锁的进程分配资源,S2 会",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":26,"type":27},[],5326051,[91,92,93,94],"2","3","4","5","某计算机系统中有8台打印机,由K个进程竞争使用,每个进程最多需要3台打印机.该系统可能会发生死锁的K的最小值是( )",{"answer":97,"createTime":5,"id":6,"options":98,"question":19,"source":26,"type":27},[],[8,9,10,11]]