1. Home
  2. GATE
  3. Computer Science and Information Technology
  4. 2018 Paper 1
  5. Q39
GATE CSE · 2018 · CS

Question 39: Operating System

Give it a try, then reveal the answer to check your work.

Question 39

CSMCQ2 marksNeeds review
In a system, there are three types of resources: E, F and G. Four processes P₀, P₁, P₂ and P₃ execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[P₂,F] is the maximum number of instances of F that P₂ would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation.
Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of E and 3 instances of F are the only resources available.
Allocation: P₀ (E=1, F=0, G=1); P₁ (E=1, F=1, G=2); P₂ (E=1, F=0, G=3); P₃ (E=2, F=0, G=0).
Max: P₀ (E=4, F=3, G=1); P₁ (E=2, F=1, G=4); P₂ (E=1, F=3, G=3); P₃ (E=5, F=4, G=1).
From the perspective of deadlock avoidance, which one of the following is true?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

EXPLORE & PRACTISE

Paper and topic context

See where this question comes from and choose what to practise next.

2018CS

GATE CSE 2018 · Paper 1

Computer Science and Information Technology · Original paper archive

Section
Computer Science and Information Technology
Question type
Multiple choice (MCQ)
Marks
2 marks
View complete paperPractise this paper

Practise related topics

Explore more previous year questions using this question’s imported topic tags.

computer science

GATE CSE previous year questions

Practise topic

information technology

GATE CSE previous year questions

Practise topic

computing

GATE CSE previous year questions

Practise topic

operating system

GATE CSE previous year questions

Practise topic

deadlock

GATE CSE previous year questions

Practise topic

Comments

Ask a question, share your approach, or help someone understand.

Log in to view the discussion

You’re not logged in. Log in or create an account to see discussions and add comments.