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 term symmetric multiprocessing in brief.
What do you mean by the term Group Policy? Describe briefly.
Describe the types of LAN cables which are used? Also describe the term Cross cable.
State some of the binding steps?
What do you mean by Operation Master Role? Describe in brief.
Explain the term Demand paging?
What is a Region? Define briefly?
Write down the four layers which Windows NT have in order to attain independence?
What do you meant by the CPU-bound process?
Specify advantages of the Indexed allocation?
18,76,764
1956875 Asked
3,689
Active Tutors
1449279
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!