Match the following.List IList III. Stack AlgorithmP. DeadlockII. Elevator AlgorithmQ. Disk SchedulingIII. Priority Scheduling AlgorithmR. Page ReplacementIV. Havender’s AlgorithmS. CPU Scheduling

I – Q, II – R, III –S, IV – P

I – R, II – Q, III – S, IV – P

I – R, II – Q, III – P, IV – S

I – Q, II – R, III – P, IV – S

Match the following.List IList III. Stack AlgorithmP. DeadlockII. Elev

1.	Match the following.List IList III. Stack AlgorithmP. DeadlockII. Elevator AlgorithmQ. Disk SchedulingIII. Priority Scheduling AlgorithmR. Page ReplacementIV. Havender’s AlgorithmS. CPU Scheduling
A.	I – R, II – Q, III – S, IV – P
B.	I – Q, II – R, III –S, IV – P
C.	I – R, II – Q, III – P, IV – S
D.	I – Q, II – R, III – P, IV – S
Answer» B. I – Q, II – R, III –S, IV – P

Discussion

No Comment Found

Related MCQs

A disk has tracks from 0 to 179. Currently the head is at track 40. The R/W requests for tracks are in the following order- 80, 102, 26, 160, 35, 10, 135. What is the total head movement when SSTF algorithm is used?
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67. Suppose SSTF disk scheduling algorithm implemented to meet the requests then the total number of head movements are ______ if the disk head is initially at 53.
Consider the following table of arrival time and burst time for three processes P0, P1 and P2. Process Arrival time Burst time P0 0 ms 9 ms P1 1 ms 4 ms P2 2ms 9 msThe pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?
At time 0, an OS with round-robin scheduling (time quantum = 5 units) has 5 processes P1, P2, P3, P4, P5 with burst times 15, 10, 20, 5, 15 respectively. What is the average turn-around time?
Let processes are scheduled on a system using round robin scheduling; assume that there is only one process of r time units. Round robin time quantum is q time units and process switch time is s time units. If s < q < r, then process switch over head units are
Let disk request come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38, at the time when the disk driver is reading from cylinder 20. If the seek time is 6 ms per cylinder, then the total seek time for the disk arm scheduling time algorithm (FCFS - First Come First Serve) is:
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities everyT time units and decides the next process to schedule. Which one of the following is TRUE if theprocesses have no I/O operations and all arrive at time zero?
In _______ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip.
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?ProcessArrival TimeProcessing TimeA03B16C44D62
Consider a disk sequence with 100 cylinders. The request to access the cylinder occur in the following sequence :4, 34, 10, 7, 19, 73, 2, 15, 6, 20Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 2 ms to move from one cylinder to adjacent one and shortest seek time first policy is

Match the following.List IList III. Stack AlgorithmP. DeadlockII. Elevator AlgorithmQ. Disk SchedulingIII. Priority Scheduling AlgorithmR. Page ReplacementIV. Havender’s AlgorithmS. CPU Scheduling

Discussion

No Comment Found

Related MCQs

Reply to Comment