1. For the process listed below, draw Gantt charts using pre-emptive and non-pre-emptive priority scheduling algorithm. A. larger priority number has a higher priority. Calculate Average Weighing Time and Average turnaround time.

Jobs	Arrival Time	Burst Time	Priority
J1	0	6	4
J2	3	5	2
J3	3	3	6
J4	5	3	3

(6 Marks) (Dec.2019/Jan.2020)

---

---

2. Is CPU scheduling necessary? Discuss the five different scheduling criteria's used in the computing scheduling mechanism. (05 Marks) (Dec.2019/Jan.2020)

3. Explain multithreading models. (05 Marks) (Dec.2019/Jan.2020)

4. Define Semaphores. Explain its usage and implementation. (06 Marks) (Dec.2019/Jan.2020)

5. Explain Reader-Write problem with semaphore in detail. (05 Marks) (Dec.2019/Jan.2020)

6. What are monitors? Explain dining Philospher's solution using monitor. (05 Marks) (Dec.2019/Jan.2020)

7. Discuss the threading issues that come with multithreaded program. (08 Marks) (June/July.2019)

---

---

8. Illustrate how Reader's-Writer's problem can be solved by using semaphores. (08 Marks) (June/July.2019)

9. Calculate the average waiting time by drawing Gantt chart using FCFS (First Come First Serve), SRTF (Shortest Remaining Time First), RR (Round Robin) [q = 2 ms] algorithms. (08 Marks) (June/July.2019)

Process	Arrival Time	Burst Time
P1	0	9
P2	1	4
P3	2	9
P3	3	5

10. Explain the Dining-Philosopher's problem using monitors. (08 Marks) (June/July.2019)

---

---

11. Discuss the benefits of multithreaded programming. (04 Marks) (Dec.2018/Jan.2019)

12. Consider the following set of processes with CPU burst time (in ms).

Process	Arrival Time	Burst Time
P1	0	6
P2	1	3
P3	2	1
P3	3	4

Compute the waiting time and average turnaround time for the above process using FCFS.

SRT and RR (time quantum = 2ms) scheduling algorithm. (12 Marks) (Dec.2018/Jan.2019)

13. Illustrate with example the Peterson's solution for critical section problem and prove that the mutual exclusion property is preserved. (08 Marks) (Dec.2018/Jan.2019)

---

---

14. Show how semaphore provides solution to reader writers problem. (08 Marks) (Dec.2018/Jan.2019)

15. Explain multithreading models, also list the benefits of multithreaded programming. (06 Marks) (June/July 2018)

16. Consider the following set of processes given in table

Process	Arrival Time	Burst Time	Priority
P1	0	10	4
P2	3	5	2
P3	3	6	6
P4	5	4	3

Consider larger number as highest priority. Calculate average waiting time and turnaround time and draw Gantt chart for pre-emptive priority scheduling and pre-emptive SJF scheduling. (06 Marks) (June/July 2018)

17. Explain multiprocessor scheduling. (04 Marks) (June/July 2018)

---

---

18. What are the requirements to critical section problem? Explain Peterson's solution to critical section problem. (06 Marks) (June/July 2018)

19. Explain Dining-philosophers problem with semaphores. (05 Marks) (June/July 2018)

20. Explain the syntax and schematic view of monitors. (05 Marks) (June/July 2018)

21. What is Busy waiting in critical section concept? How semaphore is used to solve critical section problem? What are ihe advantages of semaphores? (10 Marks) (Dec.2017/Jan.2018)

22. What is a monitor? Explain the solution to the classical dining philosopher's problem, using monitor. (10 Marks) (Dec.2017/Jan.2018)

23. Explain the critical section problem. List and explain the requirements to be met by a solution to critical section problem. (08 Marks) (June/July 2017)

---

---

24. Describe the monitor solution to the classical dining-philosopher's problem. (O08 Marks) (June/July 2017)

25. What do you mean by a binary semaphore and a counting semaphore? (04 Marks) (June/July 2017)

26. What is a critical section problem? What requirements should a solution to critical section problem satisfy? State Peterson's solution and indicate how it satisfies the above requirements. (10 Marks) (Dec.2016/Jan.2017)

27. Explain the operation of semaphores. Bring out how their operation may lead to priority inversion: (10 Marks) (Dec.2016/Jan.2017)