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

Can you have concurrency but not parallelism?

946

---

How do you fix a computer that won't start up?

923

---

Difference Between Jfs & Jfs2?

1043

---

Why is android better than ios?

983

---

Explain the term shell.

1018

---

Can you turn on a computer with the keyboard?

886

---

What is a Kernel?

1084

---

Can a laptop have both ssd and hdd?

1087

---

Can I close my computer while updating?

1077

---

How do I upgrade my operating system?

994

---

How do I compare files in notepad ++?

970

---

Can kernel panic be fixed?

972

---

What is the first operating system in the world?

1011

---

Do cores matter for gaming?

977

---

Which processor is better amd or intel?

1033

---