Scheduling Algorithms — Study Resources & PYQs
Scheduling algorithms
- Estimated study time: 60 minutes
Study resources
- Operating System Scheduling algorithms — Tutorialspoint (Round Robin, MLQ) (Article) — Operating System Scheduling algorithms — Tutorialspoint (Round Robin, MLQ) — resource aligned with Scheduling Algorithms.
- Operating System - FCFS Scheduling Algorithm — Tutorialspoint (Article) — Operating System - FCFS Scheduling Algorithm — Tutorialspoint — resource aligned with Scheduling Algorithms.
Scheduling Algorithms previous year questions
- Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed : 10+10 | Process | Arriv…
- Consider a system with a set of processes P1, P2, P3 and their CPU burst times, priorities and arrival times being mentioned as below: Process | CPU burst time…
- Given the following information: Process | Arrival Time | Burst time | Priority --- | --- | --- | --- A | 0 | 3 | 3 B | 1 | 6 | 5 C | 2 | 1 | 2 D | 3 | 4 | 1 E…
- What is starvation and convoy effect and in which of the scheduling algorithms these can occur?
- Explain the difference between Preemptive Shortest job first and Non preemptive shortest job first scheduling algorithms with an example.
Taught in these subjects
- Operating Systems — CST-3603 · Government College of Engineering and Technology, Jammu