Q2/ Fill in the blanks: (7 marks) 1. When printer is allocated to one process no other process can get it unless this process finished its work. This means that printer is ---------- resource. 2. A lack of physical space limits input methods is one of the challenges of ----- 3. lightweight process consists of --------- -------- and 4. The data structure that contains many pieces of information associated with a specific process is called 5. In real time systems, Processing must be done within the defined constraints, or - Q3/ (7 marks) Q3/ Consider the following system snapshot using data structures in the Banker's algorithm, with resources A, B, C, and D, and process PO to P4: Need Allocation Available A B C D B D A B C D PO 2 0 1 1 2 3 1 1 P1 0 6 5 0 0 P2 1 1 0 2 2 6 4 P3 1 0 2 0 6 P4 1 4 4 0 3 1 1 0 A 5 1 1 0 0 0 1 0 3 (7 marks) Using Banker's algorithm, answer the following questions. (a) How many resources of type A, B, C, and D are there? (b) What are the contents of the Max matrix? (c) Is the system in a safe state? Why Q41(7 marks) Q4/ Answer the following (7 marks) A- How Deadlock is recoverd regarding both recorces and process? Justify. B- What is OS considerd from the system point of view? C- What are the sequence of operations that dispatcher dose before exexuting the code of the new procee? Q5/ (7 marks) 25/Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst time Priority PO P1 p2 P3 P4 8 12 10 8 5 Arrival Time 0 1 2. 3 4 2 4 3 1 0 Draw Gantt charts that illustrate the execution of these processes using (1) the Shortest Remaining Time First (SRTF) scheduling algorithm (2) non-primitive Priority scheduling algorithm (consider smaller number is higher priority), what is the average waiting time of the system snapshot, avage turnaround time system snapshot, an le response time for each of the processes (7 marks)