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.
Describe the Buddy system of the memory allocation.
What do you mean by the system calls?
Describe in short the term Active Directory?
What do you mean by the term BSOD? Describe, what do you do if you get blue screen in a computer? Explain how do you troubleshoot it?
Illustrate the term DOMAIN? Write down the difference between the domain and a workgroup?
Illustrated out the essential differentiation between non-pre-emptive and pre-emptive scheduling?
Illustrate the term Multiprocessor System.
Give brief introduction of the term command interpreter?
What do you understand by the term Executive in Windows NT?
Write a short note on time-stamping?
18,76,764
1947439 Asked
3,689
Active Tutors
1446913
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!