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.
List all extended services which are offered by the OS?
Give a brief introduction of the term named pipe?
Explain what do you meant by the term overlay.
State some of the options for breaking the Deadlock.
Describe the term parallel clusters. Explain the term.
Briefly describe the condition when the system is in safe state?
what are the two procedures used in a recovery algorithm?
Describe in short the term Active Directory?
Describe in brief the two types of ROM.
What is the key object oriented concepts employed through Windows NT?
18,76,764
1934384 Asked
3,689
Active Tutors
1452953
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!