Question 1
Which one of the following CPU scheduling algorithms cannot be preemptive? [GATE 2026 || SET-2 MCQ || 1-mark]
Shortest Remaining Time First (SRTF) Scheduling
First Come First Serve (FCFS) Scheduling
Round Robin Scheduling
Priority Scheduling
Question 2
Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C), requires a CPU burst of 8 seconds. A new process of type A arrives at time t = 10, 20, 30, 40, and 50 seconds. Similarly, a new process of type C arrives at time t = 11, 22, 33, 44, and 55 seconds. The CPU scheduling policy is First Come First Serve (FCFS). The first process of type A starts running at t = 10 seconds. The average waiting time (in seconds) for the 10 processes is ______. (rounded off to one decimal place) [GATE 2026 || SET-1 NAT || 2-mark]
There are 2 questions to complete.