Exam Module Subscription Required
You need an active Exam Module Subscription to access this content. Subscribe now to unlock the exam materials and continue your preparation.
Previous Job Question: Process Scheduling Algorithm
Previous Job Question: Process Scheduling Algorithm
- ☆1Operating SystemProcess Scheduling Algorithm
A system has three processes with the following arrival times and CPU burst times:
Process Arrival Time (ms) Burst Time (ms) P1 0 5 P2 1 3 P3 2 2 Using the First-Come, First-Served (FCFS) CPU scheduling algorithm, calculate the average waiting time and the average turnaround time.
CB, O(IT-24), 26 | Officer (IT)
- ☆2Operating SystemProcess Scheduling AlgorithmOperating System Round Robin: (Quantum number =3), 4 job (job1, job2, job3, job4), Arrival time: 0,2,8,5; Burst time: 9, 7, 2, 3. What is the average waiting time?CB, AE(IT)/AHME/SO, 21 | AME/ANE/AE
Gantt Chart:


Average Time: 25/4 = 6.25
- ☆3Operating SystemProcess Scheduling AlgorithmOperating System (OS) scheduling is the key concept of multiprogramming. List and briefly define the major types of OS scheduling.CB, O(IT), 20 | Officer (IT)
Major Types of Operating System (OS) Scheduling
Answer:
OS Scheduling is the process of selecting which process will execute on the CPU. It is a key concept of Multiprogramming because it improves CPU utilization and system performance.
Major Types of OS Scheduling
Scheduling Type Definition Long-Term Scheduler (Job Scheduler) Selects jobs from secondary storage and loads them into main memory for execution. Short-Term Scheduler (CPU Scheduler) Selects a process from the ready queue and allocates the CPU to it. Medium-Term Scheduler Temporarily removes (swaps out) processes from memory and later brings them back to improve system performance. The Long-Term Scheduler controls the degree of multiprogramming, the Short-Term Scheduler allocates the CPU, and the Medium-Term Scheduler manages memory efficiently through swapping.
- ☆4Operating SystemProcess Scheduling AlgorithmCalculate The Average Waiting Time of SJF scheduling algorithm.
Process Burst Time Arrival Time P1 10 3 P2 1 1 P3 2 3 P4 1 4 P5 5 2
(i) Average waiting time for FCFS
(ii) Preemptive SJF
(iii) Round Robin (Quantum time: 3) scheduling algorithmJanata, ASA, 21 | AME/ANE/AE


- ☆5Operating SystemProcess Scheduling Algorithm
১ (গ) নিচের সারণীটি দেখুন-
Process
Burst Time (milli second)
Priority
P1
15
3
P2
2
1
P3
4
3
P4
2
4
P5
8
2
সমস্থ process একই সাথে 0 সময়ে এসে পৌঁছে।
- i) FCFS এবং SJF Scheduling algorithm ব্যবহার করে Gantt Chart এর মাধ্যমে process গুলোর execution দেখান।
- ii) উপরের উভয় algorithm এর জন্য প্রত্যেকটি process এর turnaround সময় নির্ণয় করুন।
BPSC_MoHA_AP, 26 | Assistant Programmer (BPSC) - ☆6Operating SystemProcess Scheduling Algorithm
Job arrival time and execution time of Operating system tasks table is given, find out
Average waiting timeJob Arrival Time Execution Time A 0 10 B 3 7 C 5 3
(i) FCFS
(ii) Preemptive SJF
(iii) Round Robin (Quantum time: 3)Rupali, ANE, 21 |(i) FCFS:
(ii)SJF

(iii) Round Robin:








