Semester: 4-CBCS – ‘C ’ OPERATING SYSTEMS (21CS44) Sankhya N.

Nayak

JAWAHARLAL NEHRU NATIONAL COLLEGE OF ENGINEERING, SHIVAMOGGA

Chapter 5
3. Is CPU scheduling necessary? Discuss the five different scheduling criteria's used in the
computing scheduling mechanism. (DEC.2019/JAN.2020) (JAN 21)
4. Explain multiprocessor scheduling with examples. (JUNE/JULY 2018) (JAN 21)
5.
Consider the following set of processes, Process Id Arrival Burst Time
with length of the CPU burst time given in Time
milliseconds. Draw Gantt charts and find P1 0 9
Average waiting time for FCFS, SRTF and P2 1 4
RR (Quantum=2). (VTU MODEL QP) P3 2 9
P4 3 5
6.
For below processes, find Average waiting
Process Id Arrival Burst Time
time for FCFS, SJF and RR(Quantum=2).
Time
(JULY 2019) )(MODEL QP)
P1 0 9
P2 0 5
P3 2 6
P4 3 7
7.
Consider the following set of processes, Process Id Arrival Burst Time
with length of the CPU burst time given in Time
milliseconds: Draw Gantt charts and find P1 0 6
Average waiting time and Average P2 1 3
Turnaround time for FCFS, SRTF and RR P3 2 1
(Quantum=2). (DEC.2018/JAN.2019) (JAN P4 3 4
2020) (JAN 21)
8.
Consider the following set of processes, with length of the Process Id Burst Time
CPU burst time given in milliseconds: Draw Gantt charts and P1 10
find Average waiting time and Average Turnaround time for P2 29
FCFS, SJF and RR (Quantum=10). (AUG 2020) P3 3
P4 7
P5 12
Semester: 4-CBCS – ‘C ’ OPERATING SYSTEMS (21CS44) Sankhya N. Nayak

9.
Consider the following set of processes,
with length of the CPU burst time given
in milliseconds: Draw Gantt charts for Process Arrival Burst Priority
preemptive and non preemtive Id Time Time
priority scheduling. Larger number P1 0 6 4
represents higher priority. Find P2 3 5 2
Average waiting time and Average P3 3 3 6
Turnaround time. (JAN 2019) P4 5 5 3
10.
Consider the following set of processes
given in table. Consider larger number Process Arrival Burst Priority
as highest priority. Calculate average Id Time Time
waiting time and turnaround time and P1 0 6 4
draw Gantt chart for pre-emptive P2 3 5 2
priority scheduling and pre-emptive P3 3 3 6
SJF scheduling. (JUNE/JULY 2018) P4 5 5 3
(DEC.2019/JAN.2020)
11.
Calculate the average waiting time by Process Id Arrival Burst Time
drawing Gantt chart using FCFS(First Time
Come First Serve), SRTF (Shortest P1 0 9
Remaining Time First), RR (Round P2 1 4
Robin) [q = 2 ms] algorithms. P3 2 9
(JUNE/JULY.2019)
P4 3 5
12.
Compute the waiting time and average
turnaround time using Non preemptive Process Id Burst Time Priority
SJF, Non preemptive priority and RR P1 10 3
(time quantum = 1ms) scheduling P2 1 1
algorithm. (FEB 2022) P3 2 3
P4 1 4
P5 5 2
13.
Consider lower number as highest
Process Arrival Burst Priority
priority. Calculate average waiting time
Id Time Time
and turnaround time and draw Gantt chart
P1 0 9 3
for FCFS, SRTF, RR(q=2mS) and
P2 1 4 2
priority algorithms.(AUG 2022)
P3 2 9 1
P4 3 5 4
Semester: 4-CBCS – ‘C ’ OPERATING SYSTEMS (21CS44) Sankhya N. Nayak

Chapter 6

14. Discuss briefly about critical section problem with example. (JAN 21)
15. Illustrate with example the Peterson's solution for critical section problem and prove that the
mutual exclusion property is preserved. (DEC.2018/JAN.2019)
16. What are the requirements to critical section problem? Explain Peterson's solution to
critical section problem. (JUNE/JULY 2018) )(MODEL QP) (AUG/SEPT 2020)
17. 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. (DEC.2016/JAN.2017)( JUNE/JULY 2017) (FEB 2022)
18. What is Busy waiting in critical section concept? How is semaphore used to solve critical
section problem? What are the advantages of semaphores? (DEC.2017/JAN.2018)
19. Define Semaphores. Explain its usage and implementation. (DEC.2019/JAN.2020)
20. Explain Reader-Write problem with semaphore in detail. (DEC.2018/JAN.2019)
(JUNE/JULY.2019) (DEC.2019/JAN.2020) (MODEL QP) (FEB 2022)
21. Explain Dining-philosophers problem with semaphores. (JUNE/JULY 2018)
22. Explain the operation of semaphores. Bring out how their operation may lead to priority
inversion. (DEC.2016/JAN.2017)
23. What are semaphores, explain how mutual exclusion is implemented with semaphores. (AUG
2020)
24. What are monitors? Explain dining Philospher's solution using monitor. (DEC.2017/JAN.2018)
(JUNE 2017) (JUNE/JULY.2019) ) (DEC.2019/JAN.2020) (MODEL QP) (AUG/SEPT 2020) (JAN 21)
25. Explain the syntax and schematic view of monitors. (JUNE/JULY 2018)
26. What do you mean by a binary semaphore and a counting semaphore? (JUNE/JULY 2017)

-------------------------------------------------------------------------------------------------------------------