What are deadlocks? How can they be avoided?
Ans: Deadlock considers to a particular condition when two or more processes are every waiting for another to release a resource, or much more than two processes are waiting for resources in a circular chain. Deadlock is a general problem in multiprocessing in which many processes share a particular type of mutually exclusive resource termed as a software, or soft, lock. Computers that are intended for the time-sharing and/or real-time markets are often equipped along with a hardware lock (or hard lock) that assures exclusive access to processes, forcing serialization. Deadlocks are specifically troubling as there is no general solution to avoid (soft) deadlocks.
One of the techniques of deadlock avoidance related to timestamps there are two types: wait-die and wound-wait.