file System Interface November 27, 2020wefru 0 Created on November 27, 2020 By wefru file System Interface TEST YOUR SKILLS 1 / 10 Q. 81) The wait-for graph is a deadlock detection algorithm that is applicable when ____________ All resources have multiple instances All resources have no instance All resources have single instance None 2 / 10 Q. 82) avoiding the Deadlock, is the simplest and most useful model that requires each process declare the each type that may be needed Maximum number Minimum number Maximum and minimum number None 3 / 10 Q. 83) the Deadlock avoidance algorithm is dynamically examines ____ to ensure that circular wait condition can never exist Allocation sate Resolution Allocation state Resource Allocation State Source operating system 4 / 10 Q. 84) to access the service of operating systems, the interface is provided by the Assembly instructions Apls Storage Allocation 5 / 10 Q. 85) Which requested resources are granted with deadlock detection Ptocesses Processes Resources Allocated 6 / 10 Q. 86) Which thread management work done by a pure Kernel Level Thread facility? Thread Application Program Kernal 7 / 10 Q. 87) Which one process cannot overwrite another’s a memory, either inadvertently or maliciously. Module Section Partition Reason 8 / 10 Q. 87) Prevention strategies of deadlock are very…? Simply Complex Conservative Simple 9 / 10 Q. 88) …….. That can be loaded into adjacent “holes” in the main memory. Segment Frame Participation Memory 10 / 10 Q. 89) fench register is used for File protection CPU None Memory protection Your score is The average score is 0% LinkedIn Facebook Twitter VKontakte 0% Restart quiz