City Guilds Model Questions Vol1 2019 Information Technology Question 2
Practice practical question 2 from the 2019 City Guilds Model Questions Vol1 Information Technology examination. This question covers CPU scheduling, Process management, Deadlock detection, Banker's algorithm .
A single‑CPU system is running three processes (P1, P2, P3). The processes arrive and have the following CPU‑burst times: | Process | Arrival Time (ms) | Burst Time (ms) | |---------|-------------------|-----------------| | P1 | 0 | 6 | | P2 | 2 | 8 | | P3 | 4 | 4 | The CPU uses a non‑preemptive Shortest Job First (SJF) scheduling algorithm. In addition, the system has two resource types (A and B). At a particular snapshot the allocation and maximum‑demand matrices are: Allocation: | | A | B | |-------|---|---| | P1 | 1 | 0 | | P2 | 0 | 1 | | P3 | 1 | 1 | Maximum demand: | | A | B | |-------|---|---| | P1 | 2 | 1 | | P2 | 1 | 2 | | P3 | 2 | 2 | Available resources: A = 1, B = 0. Answer the following questions.
Question Parts
Detailed Solution & Marking Scheme
Get the step-by-step solution, key points required by examiners and detailed marking guidance through the Edcrib AI Tutor.
Reveal AnswerAbout This Question
This is City Guilds Model Questions Vol1 2019 Information Technology Question 2. It is one of the practical questions from the 2019 City Guilds Model Questions Vol1 Information Technology examination.
The question covers CPU scheduling, Process management, Deadlock detection, Banker's algorithm .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.