Recent questions tagged deadlock-prevention-avoidance-detection / GATE Overflow for GATE CSE

0 votes

0 answers

31

Consider a system having 22 resources of the same type. These resources are shared by 4 processes P, Q, Rand Shaving peak demands of 3, 6, a and b respectively. How many ordered pairs (a, b) are possible, such that the system is deadlock free?

damz1499

1.2k views

damz1499 asked Nov 7, 2022

0 votes

0 answers

32

operating sysytem
a system has four processes and five allocable resources the current allocation and maximum needs are as follows Allocated Maximum Available process A 10211 11213 00x11 process B 20110 22210 process C 11010 21310 process D 11110 11221

a system has four processes and five allocable resources the current allocation and maximum needs are as follows Allocated Maximum ...

Skarma Angmo

445 views

Skarma Angmo asked Sep 16, 2022

0 votes

0 answers

33

Best Open Video Playlist for Deadlock Topic | Operating Systems
Please list out the best free available video playlist for Deadlock from Operating Systems as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video lists. You can ... standard ones are more likely to be selected as best. For the full list of selected videos please see here

Please list out the best free available video playlist for Deadlock from Operating Systems as an answer here (only one playlist per answer). We'll then select the best pl...

makhdoom ghaya

262 views

makhdoom ghaya asked Aug 20, 2022

1 votes

0 answers

34

Deadlocks
Definition of a set of deadlocked Processes: “A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set can cause.” P1, P2, and P3 have caused deadlock but every process including P4 is in the deadlocked set of processes, isn’t it?

Definition of a set of deadlocked Processes:“A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set ca...

lolalo

609 views

lolalo asked Aug 19, 2022

0 votes

2 answers

35

Made easy || Operating system
While of the following is incorrect? (a) if a system uses preemptive CPU scheduler then deadlock is not possible in system (b) Deadlock state is an unsafe state. (c) If a system has total ordering of all resource types ... disabled) therefore deadlock should not possible in preemptive scheduling then how can this statement could be incorrect. please clarify the doubt

While of the following is incorrect?(a) if a system uses preemptive CPU scheduler then deadlock is not possible in system(b) Deadlock state is an unsafe state.(c) If a sy...

Shreya2002

1.3k views

Shreya2002 asked Aug 5, 2022

0 votes

0 answers

36

In the "Intersted variable method" for synchronization is there a possiblity of deadlock or spinlock?

JAINchiNMay

231 views

JAINchiNMay asked Jun 23, 2022

0 votes

1 answer

37

OS Applied Test Series
Suppose there is a (non-virtual memory) system that has only 200 Mb of main memory and there are two processes that make the following sequence of requests: P1 P2 ... ... Request 80Mb; Request 70Mb; ... ... Request 60Mb; Request 80Mb; Consider ... requests 70 Mb. This is a deadlock. Statement 2: There is no possibility of a deadlock. Which of the above statements are correct?

Suppose there is a (non-virtual memory) system that has only 200 Mb of main memory and there are two processes that make the following sequence of requests: P1 ...

Sagar475

431 views

Sagar475 asked Jan 26, 2022

0 votes

1 answer

38

Gate Applied Test Series
Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ Answer Given is: 1

Question→ Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will ...

lalitver10

688 views

lalitver10 asked Jan 22, 2022

1 votes

2 answers

39

made easy test series - deadlock - operating systems
Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B and C which have peak time demands of 5, 7 and 4 respectively. The minimum value of ‘m’ that will ensure that deadlock will never occur is _____.

Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B and C which have peak time demands of 5, 7 and 4 respectively. T...

atulcse

1.0k views

atulcse asked Jan 12, 2022

1 votes

1 answer

40

Test Series- Applied:
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ I answered it as 3. Because it asked for maximum which is not correct. Can someone help me in this.

Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a ...

ramakrushna

396 views

ramakrushna asked Dec 20, 2021

0 votes

1 answer

41

test series doubt
hi, C an anyone answer this question? @arjun sir, According to me there is no mutual exclusion and hence deadlock is not created.

hi,Can anyone answer this question? @arjun sir, According to me there is no mutual exclusion and hence deadlock is not created.

rish1602

419 views

rish1602 asked Nov 10, 2021

1 votes

1 answer

42

Applied Test Series
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___

Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a ...

LRU

438 views

LRU asked Nov 5, 2021

0 votes

1 answer

43

self doubt - deadlock detection - OS
Isn’t it guaranteed that deadlock can be detected when there are multiple instances of resources? Sure, it cannot be detected only by looking for cycles in a resource allocation graph, but aren’t there algorithms that will always detect a deadlock, if it is there?

Isn’t it guaranteed that deadlock can be detected when there are multiple instances of resources? Sure, it cannot be detected only by looking for cycles in a resource a...

atulcse

305 views

atulcse asked Nov 4, 2021

2 votes

1 answer

44

Applied Test Series
In a system which has only 3 processes, there are 2 copies of R1 resource, 3 copies of R2 resource. Say, in the current snapshot of the system, Process P1 holds 2 copies of resource R1 and needs 1 copy of R2 to complete its execution. P2 holds 2 copies ... at a much later point in time. The probability that the system will be in a deadlock again is ____ (up to 2 decimal places).

In a system which has only 3 processes, there are 2 copies of R1 resource, 3 copies of R2 resource. Say, in the current snapshot of the system, Process P1 holds 2 copies ...

LRU

760 views

LRU asked Oct 21, 2021

5 votes

2 answers

45

Applied Test Series
A given system has 13 processes and x number of copies of a resource r. Out of 13 processes, 6 processes require 2 resources each, 3 processes require 3 resources each and the remaining processes require 5 resources each. The minimum value of x will guarantee that the system is deadlock free is ____.

A given system has 13 processes and x number of copies of a resource r. Out of 13 processes, 6 processes require 2 resources each, 3 processes require 3 resources each a...

LRU

566 views

LRU asked Oct 10, 2021

2 votes

2 answers

46

Applied Test Series
Given 5 processes and R copies of total resources in a system, each process requires 7 copies of resources to complete its execution. The maximum value of R to have deadlock is ___

Given 5 processes and R copies of total resources in a system, each process requires 7 copies of resources to complete its execution. The maximum value of R to have deadl...

LRU

745 views

LRU asked Oct 10, 2021

2 votes

1 answer

47

Applied Test Series
There are 5 processes in a system where each of them has a requirement of x resources. In the worst case, y number of resources would ensure that the system is deadlock free. The system later on has 7 processes that require x resources each. In the worst case, (y + 4) resources would ensure that the system is deadlock free. The value of x is ______

There are 5 processes in a system where each of them has a requirement of x resources. In the worst case, y number of resources would ensure that the system is deadlock f...

LRU

491 views

LRU asked Oct 10, 2021

1 votes

1 answer

48

Applied Roots Topic Test
Which of the following are true ? Deadlock detection in single instance resource type is guaranteed. Deadlock detection in multi instance resource type is guaranteed. My answer : Both A and B because deadlock detection in single instance resource type can be done using ... or will enter deadlock from the current state. Given answer : Only A. Can't get why option B is false.

Which of the following are true ?Deadlock detection in single instance resource type is guaranteed.Deadlock detection in multi instance resource type is guaranteed.My ans...

Naman9495

1.3k views

Naman9495 asked Sep 19, 2021

35 votes

2 answers

49

GATE CSE 2021 Set 2 | Question: 43
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock $(L)$. ... not occur The scheme may lead to live-lock The scheme may lead to starvation The scheme violates the mutual exclusion property

Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and ...

Arjun

9.8k views

Arjun asked Feb 18, 2021

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true