City Guilds Model Questions Vol1 2018 Information Technology Question 39
Practice objective / multiple choice question 39 from the 2018 City Guilds Model Questions Vol1 Information Technology examination.
In a system there are three resource types A, B, and C with total instances \(A = 6\), \(B = 5\), and \(C = 7\). Four processes \(P_{1}, P_{2}, P_{3}, P_{4}\) have the following current allocation and maximum demand matrices (values are numbers of instances): Allocation: \(P_{1}: (1,0,2)\), \(P_{2}: (2,1,1)\), \(P_{3}: (3,1,0)\), \(P_{4}: (0,2,2)\) Maximum demand: \(P_{1}: (3,2,3)\), \(P_{2}: (3,3,3)\), \(P_{3}: (4,2,2)\), \(P_{4}: (2,3,4)\) Using the Banker's algorithm, determine whether the system is in a safe state. If it is not safe, state that no safe sequence exists.
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2018 Information Technology Question 39. It is one of the objective questions from the 2018 City Guilds Model Questions Vol1 Information Technology examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.