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

What do you mean by Run time Errors?

1113

---

How do you reset the bios?

942

---

What Command To Take Backup Other Vg's?

983

---

How do I run wget?

901

---

Will disk cleanup delete my files?

850

---

Which one is the first operating system?

905

---

What do you know about the latest android version Lollipop?

889

---

discuss the procedures to evaluate disk excess time

2527

---

What is startup repair on my computer?

917

---

What does the g in gnu stand for?

989

---

What's the best operating system?

997

---

Assuming one link of the Trojan horse copy-and-observe-later chain is broken. There are two other possible angles of attack by Alice: Alice logging on and attempting to read the string directly, and alice assigning a security level of sensitive to the back-pocket file. Does the reference monitor prevent these attacks?

2735

---

How can I increase storage on my laptop?

894

---

Assuming feedback to the adversary flugging an error as each incorrect character is entered, what is the expected time to discover the correct password?

3264

---

What are the Types Of Vg & Explain About Them?

930

---