parallel programming: Prove that there cannot be a deadlock if resources are linearly ordered and processes always acquire them in order.

Draw a wait for graph to detect deadlock in given situation.

The issue has the required property if it can be solved by solving its subproblems optimally. overlapping subproblems, optimum substructure, memory, and greedy

The Dining Philosopher solution using monitors shown in the code snippet below does not suffer from deadlock. However, starvation is still possible. Explain in details why. Each philosopher i invokes the operations pickup() and putdown() in the following sequence: DiningPhilosophers.pickup(i);                    EAT DiningPhilosophers.putdown(i);

This characteristic is met by a problem if it is feasible to develop an optimum solution for it by first creating optimal solutions for its subproblems. a) Subproblems that overlap; b) substructure that's optimum; c) memorization; d) greedy