Question
State true or false This scheduling algorithm is
not ideal for time sharing systems. Read the below passage and answer the questions First Come First Serve (FCFS) Ā is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival. It is the easiest and simplest CPU scheduling algorithm. In this type of algorithm, processes which requests the CPU first get the CPU allocation first. This is managed with a FIFO queue. The full form of FCFS is First Come First Serve. As the process enters the ready queue, its PCB (Process Control Block) is linked with the tail of the queue and, when the CPU becomes free, it should be assigned to the process at the beginning of the queue.Solution
Disadvantages of FCFS
- The non-preemptive nature of the algorithm makes other small processesĀ wait Ā until the current program completes.
- Short processes have to wait for a long time until the bigger process which arrives before it.
- The waiting time is usuallyĀ high .
- This scheduling algorithm is not ideal for time sharing systems.
The ratio of the outer and the inner circumference of a circular path is 5: 4. If the path is 100 meters wide, then what is the radius of the inner circle?
If tanx+secx=3, then the number of real solutions in [0,3Ļ] is:
{ā676.12 + 13.012 ā 146.89 } = ?
If sinā“ x + cosā“ x = 5/8, then the value of sin2x is
In an exam Dinesh scored 362 marks and Shivam got 68 % marks in the same exam which is 12 marks more than Dinesh. If the minimum passing marks in the ex...
Find the simple interest on Rs 1040 at 12% per annum for 2 years?Ā
The following table shows the number of students enrolled in different courses at a university:
The ages of P, Q, and R are in the ratio 2:3:5. After 5 years, the sum of their ages will be 75 years. What are their present ages?
f(x)=x+ ā£ x ā£ , then the function is:
