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 bytes we can send to apple push notification server in iOS operating system?

1033

---

Is heap shared between processes?

967

---

Why is android better than ios?

981

---

Which is your favorite editor, shell, programming shell and why?

2522

---

Explain about memory management in operating system.

1016

---

What's the best operating system?

1052

---

discuss the procedures to evaluate disk excess time

2589

---

What is the latest android operating system?

988

---

What is the difference between kernel and operating system?

946

---

How do you reset your computer?

1093

---

How do you kill a computer with command prompt?

962

---

Is google an operating system?

949

---

What is the best os for laptop?

1037

---

Is kernel a os?

922

---

How many os are there?

963

---