Scribd
Upload
2 views3 pages

OS_Scheduling_Practice_Questions

The document contains practice questions on CPU scheduling, divided into four parts: short answer questions, medium-length theoretical questions, numerical problems, and application/discussion questions. It covers various scheduling algorithms such as FCFS, SJF, SRTF, and Round Robin, along with their advantages, drawbacks, and performance metrics. Additionally, it addresses concepts like context switching, turnaround time, and the impact of scheduling on system performance.

Uploaded by

aksh4982
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views3 pages

OS_Scheduling_Practice_Questions

The document contains practice questions on CPU scheduling, divided into four parts: short answer questions, medium-length theoretical questions, numerical problems, and application/discussion questions. It covers various scheduling algorithms such as FCFS, SJF, SRTF, and Round Robin, along with their advantages, drawbacks, and performance metrics. Additionally, it addresses concepts like context switching, turnaround time, and the impact of scheduling on system performance.

Uploaded by

aksh4982
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Operating System - CPU Scheduling Practice Questions

Part A: Short Answer / Viva Type (Conceptual)

1. What is CPU Scheduling? Why is it needed?

2. Explain the difference between preemptive and non-preemptive scheduling.

3. What are the criteria for selecting the best CPU scheduling algorithm?

4. List at least 4 CPU scheduling algorithms with one advantage of each.

5. What is the difference between FCFS and SJF scheduling?

6. Why can SJF be considered the best algorithm theoretically?

7. What is starvation? In which algorithms does it occur?

8. Define turnaround time, waiting time, and response time.

9. What is context switching? When does it happen?

10. Compare preemptive SJF (SRTF) and Round Robin.

Part B: Medium-Length Theoretical Questions

1. Explain FCFS scheduling with an example. What are its drawbacks?

2. Describe SJF and SRTF with suitable diagrams and example processes.

3. Explain the working of Priority Scheduling. How does aging help avoid starvation?

4. Describe the Round Robin algorithm. What is the effect of time quantum size?

5. Differentiate between SJF, SRTF, and Round Robin in terms of response and waiting times.

6. What happens when the time quantum is very large in Round Robin?

7. Describe preemptive and non-preemptive priority scheduling with examples.

Part C: Numerical Problems (With Answers Below)

(Find: Gantt chart, Waiting Time (WT), Turnaround Time (TAT), Average WT and TAT)
1. FCFS

Processes: P1 P2 P3 P4

Arrival: 0 2 4 5

Burst Time: 7 4 1 4

2. Non-Preemptive SJF

Processes: P1 P2 P3 P4

Arrival: 0 2 4 5

Burst Time: 7 1 2 4

3. Preemptive SJF (SRTF)

Processes: P1 P2 P3 P4

Arrival: 0 1 2 3

Burst Time: 8 4 2 1

4. Priority Scheduling (Non-Preemptive)

Processes: P1 P2 P3 P4

Arrival: 0 1 2 3

Burst Time: 5 3 8 6

Priority: 2 1 4 3

5. Round Robin (Time Quantum = 2)

Processes: P1 P2 P3 P4

Arrival: 0 1 2 3

Burst Time: 5 3 1 2

Part D: Application/Discussion Questions


1. Which scheduling algorithm is best for real-time systems? Why?

2. How does scheduling affect system throughput and CPU utilization?

3. In what situations would FCFS be preferred over Round Robin?

4. Explain the impact of context switching in Round Robin scheduling.

5. Suggest improvements to the basic priority scheduling to avoid starvation.

Numerical solutions will be added on the next pages.

You might also like