Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can be requested and released only one at a time. The largest value of K that will always avoid deadlock is ____.

This question was previously asked in
GATE CS 2018 Official Paper
Download PDF Attempt Online
View all GATE CS Papers >

Answer (Detailed Solution Below) 2
Free Tests
View all Free tests >
Free
GATE CS Full Mock Test
5.3 K Users
65 Questions 100 Marks 180 Mins
Start Now

Detailed Solution

Download Solution PDF
To give each process one less than maximum demand, (K−1) resources we need 3(K−1) resources.

Provide an additional resource to any of three processes for deadlock avoidance.

Total resources = 3(K−1)+1=3K−2

Now, this 3K-2 should be less than or equal to the number of resources

3K−2 ≤ 4

3K ≤ 6

Hence K ≤ 2.

Download Solution PDF
Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

More Deadlock Handling Questions

Q1.Which of the following is not a recovery technique ?
Q2.Consider a system with five processes P0, through P4, and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T0 we Have the following allocation. Process Allocation Request Available   A B C A B C A B C P0 0 1 0 0 0 0 0 0 0 P1 2 0 0 2 0 2   P2 3 0 3 0 0 0 P3 2 1 1 1 0 0 P4 0 2 2 0
Q3.An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.   Allocation Max   X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3   There are 3 units of type X, 2 units of type Y and 2 units of type Z st
Q4.Consider a system with n processes and m resource types. Safety Algorithm may require an order of ____ operations to decide whether a state is state is safe or not. 
Q5.Suppose a system has 12 magnetic tape drives and at time t0, three processes are allotted tape drives out of their as given below:   Maximum Needs Current Needs p0 10 5 p1 4 2 p2 9 2   At time t0, the system is in safe state. Which of the following is safe sequence so that deadlock is avoided? NOTE: Current Need is currently allocated resource to a process
Q6.An aid to determine the deadlock occurrence is
Q7.A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: Process Current Allocation Maximum Requirement P1 3 7 P2 1 6 P3 3 5   Which of the following best describes current state of the system?
Q8.Consider a system having m resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of m that ensures that deadlock will never occur is
Q9.Suppose a system has 12 instances of some resources with n processes competing for that resource. Each process may require 4 instances of the resource. The maximum value of n for which the system never enters into deadlock is

More Deadlock Questions

Q1.Match List I with List II LIST I LIST II A. Critical region I. Hoare's monitor B. Wait signal II. Mutual exclusion C. Working set III. Principle of locality D. Deadlock IV. Circular wait Choose the correct answer from the options given below:
Q2.Consider the following: List I List II (A) Stack algorithm (I) Deadlock (B) Elevator algorithm (II) Disk scheduling (C) Priority scheduling algorithm (III) Page replacement (D) Havender's algorithm (IV) CPU scheduling Which of the following is correct matching?
Q3.With a single resource, deadlock occurs
Q4.Which of the following is not a recovery technique ?
Q5.Which of the following statements is/are TRUE with respect to deadlocks?
Q6.What is a deadlock?
Q7.Consider the following implementation as a solution to the critical section problem for two processes P0 and P1 with id 0 and 1, respectively. int flag [2] = {0, 0}; int turn = 0 ; void lock (int id)  /*id = 0 or 1 */ { turn = id ^ 1; /*S1*/ flag [id] = 1; /*S2*/ /* '^' is the bitwise XOR* / while (flag [id ^ 1] ) && turn == (id ^ 1)) ; } void unlock (int id) { flag[id] = 0 ; } Which of the following statements are correct?
Q8.Which one of following statements is FALSE?
Q9.A state is known as ______, if the system allocates resources to each process and still avoids a deadlock.
Q10.Which of the following conditions need to be held simultaneously for deadlock occurrences
Crack GATE CSE with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Test Series
View All >
GATE CSE 2023-24 Test Series
129 Total Tests with 1 Free Tests
Start Free Test
ISRO Scientist Computer Science Mock Test
22 Total Tests with   1 Free Tests
Start Free Test
Suggested Exams
Exam-Logo
GATE CS

GATE CS Important Links

More Operating Systems Questions

Q1.Which of the following is a benefit of scheduling emails?
Q2.Which of the following Page Replacement Algorithm suffers from the Belady’s anomaly ?
Q3.Consider a system with three frames in memory and following memory references in the working set 2 1 2 3 5 4 1 3 4 2 1 How many page fault will be there if we use second chance page replacement algorithm ?
Q4.Which one of the following cannot be scheduled by the kernel ?
Q5.Consider a system with page size p and average process size m and size of each page table entry is e. What is the amount of space required by page table ? 
Q6.Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority). Process Arrival Time Burst Time P1 5 3 P2 3 1 P3 2 5 P4 3 4 P5 1 2
Q7.When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
Q8.What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling Algorithm?
Q9.What is the average turnaround time for these Processes with First Come First Serve (FCFS) scheduling Algorithm?
Q10.Find the average weighted turnaround time for these process using Highest Response Ratio Next (HRN) Algorithm?
Important Links for GATE Exam
Super Coaching
Branch wise Page
Test Series
Previous Year Papers
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti gold new version all teen patti game teen patti stars teen patti rules