Answer Posted / sagarika mishra

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 (including itself).

Waiting for an event could be:

waiting for access to a critical section
waiting for a resource Note that it is usually a non-
preemptable (resource). pre-emptable resources can be
yanked away and given to another.
deadlock avoided by:-
Resource allocation state:
# of available / allocated instances of each type
maximum demand of each process
Safe sequence: For an allocation state, a sequence
hP1; : : : ; Pni is safe if for each Pi, the maximum
resources that
Pi can request can be satised by currently available
resources
+ resources held by all Pj (j < i)
Safe state: System istb in safe state if there exists a safe
sequence consisting of all processes

How many goroutines are in a core?

988

---

How much memory do I need on my laptop?

1003

---

What causes a computer not to boot up?

909

---

What is the best memory for a laptop?

1028

---

Can I install chrome os on my laptop?

961

---

How do you fix a crashed computer?

997

---

Why is android better than ios?

990

---

Can yum install rpm?

1057

---

How do I run wget?

969

---

How many bytes we can send to apple push notification server in iOS operating system?

1041

---

What is microsoft spreadsheet compare?

981

---

Dear All, When the patches are installed in the server OS, how will we know that which patch is the latest patch?

2224

---

Is heap shared between processes?

980

---

How do you start up a computer?

977

---

Is system restore bad for your computer?

982

---