Shortest Job First Scheduling
Explain the following algorithm: a) First Come, First Served Scheduling. b) Shortest Job First Scheduling. c) Priority Scheduling.
Explain the following algorithm:
a) First Come, First Served Scheduling.
b) Shortest Job First Scheduling.
c) Priority Scheduling.
Expert
First Come, First Served Scheduling:
Within this Scheduling, the process which requests the CPU first is assigned the CPU first. This Scheduling algorithm is said to be Non Pre-emptive.
Shortest Job First Scheduling:
When the CPU is available, it is allocated to the process which has the smallest next CPU burst. This Scheduling algorithm can be either as Pre-emptive or Non Pre-emptive.
Priority Scheduling:
A Priority is linked with every process and the CPU is assigned to the process that is having the highest priority. This is also either Pre-emptive or Non Pre-emptive.
Memory-Management Unit:
Run-time mapping form the virtual to the physical addresses is done by the hardware device is a known as the Memory Management Unit.
Explain the various structures which are used in the file-system implementation?
Explain the term semaphores?
Define the entry section and the exit section.
What do you mean by the TLB and Hit-Ratio?
Explain the different job scheduling in the operating systems?
Write down some of the advantages of Child Domain?
Describe which one is better: Windows 7 or Windows XP? Validate your answers with illustrations.
Specify what all the things the solution for Critical-Section Problem should satisfy?
Explain how index blocks can be executed within the indexed allocation scheme?
What is meant by the term Safe State and state its use in the deadlock avoidance?
18,76,764
1938919 Asked
3,689
Active Tutors
1445126
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!