[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$foRzcm58gp5OGGohqrietw3vrrhDrRPOWz9oE-nkpqs0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-06-02 23:39:46",148150634,[8,9,10,11],"9","10","11","15",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},18,"a22cb4a7aaae8391e450f68ddc7116f0","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fba533edd35e833919e6ee626fcc55d7c.png","操作系统原理-22级","b4e4886c59f24c00b0717ed0ed67d5cb","处理机调度与死锁单元测试","某系统中仅有5个并发进程竞争某类资源,且都需要3个该类资源,那么至少有()个该类资源时,才能保证系统不会发生死锁.",[21,33,42,47,56,61,70,75,80,83],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2023-05-21 10:39:15",21446438,[26,27,28,29],"高级调度","中级调度","进程调度","作业调度","进程从就绪状态转换到执行状态的工作由( )完成","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],21446439,[37,38,39,40],"运行时间","等待时间","周转时间","响应时间","进程从提交到运行结束的全部时间称为( )",{"answer":43,"createTime":23,"id":44,"options":45,"question":46,"source":31,"type":32},[],21446440,[8,9,10,11],"某系统中仅有5个并发进程竞争某类资源,且都需要3个该类资源,那么至少有()个该类资源时,才能保证系统不会发生死锁",{"answer":48,"createTime":23,"id":49,"options":50,"question":55,"source":31,"type":32},[],21446441,[51,52,53,54],"互斥条件","循环等待条件","不可抢占条件","请求和保持条件","在哲学家进餐问题中可能会死锁,所以可以采用预防死锁的方法,比如:只允许哲学家先拿小号筷子,然后拿大号筷子,请问破坏了()",{"answer":57,"createTime":23,"id":58,"options":59,"question":60,"source":31,"type":32},[],21446442,[51,52,53,54],"在哲学家进餐问题中可能会死锁,所以可以采用预防死锁的方法,比如:只允许哲学家同时拿到两个了筷子后才允许吃饭,请问破坏了()",{"answer":62,"createTime":23,"id":63,"options":64,"question":69,"source":31,"type":32},[],21446443,[65,66,67,68],"等待操作系统的调度","终止一个或多个进程以打破循环等待","从一个或多个死锁进程中抢占一个或多个资源","终止所有死锁进程","当死锁检测算法确定死锁已存在,可以采用多种措施.以下措施不可以解除死锁的有( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":74,"source":31,"type":32},[],148150632,[26,27,28,29],"进程从就绪状态转换到执行状态的工作由( )完成.",{"answer":76,"createTime":5,"id":77,"options":78,"question":79,"source":31,"type":32},[],148150633,[37,38,39,40],"进程从提交到运行结束的全部时间称为( ) .",{"answer":81,"createTime":5,"id":6,"options":82,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":84,"createTime":5,"id":85,"options":86,"question":87,"source":31,"type":32},[],148150635,[51,52,53,54],"在哲学家进餐问题中可能会死锁,所以可以采用预防死锁的方法,比如:只允许哲学家先拿小号筷子,然后拿大号筷子,请问破坏了()."]