Tutorial Week 5
Q1: What is deadlock?
Q2: What is starvation, give an example?
Q3: Describe the four conditions required for deadlock to occur.
Q4*: Describe four ways to prevent deadlock by attacking the conditions required for deadlock.
Q5: Answer the following questions about the tables.
- Compute what each process still might request and display in the columns labeled "still needs".
- Is the system in a safe or unsafe state? Why?
- Is the system deadlocked? Why or why not?
- Which processes, if any, are or may become deadlocked?
- Assume a request from p3 arrives for (0,1,0,0)
- Can the request be safely granted immediately?
- In what state (deadlocked, safe, unsafe) would immediately granting the request leave the system?
- Which processes, if any, are or may become deadlocked if the request is granted immediately?
|current allocation||maximum demand||still needs|
Q6: Compare cooperative versus preemptive multithreading?
Q7: Describe user-level threads and kernel-level
threads. What are the advantages or disadvantages of each approach?
Q8: Describe a plausible sequence of activities that occur when a timer interrupt results in a context switch.