Placement and replacement algorithms
In the framework of memory management, describe the placement and replacement algorithms?
Expert
Placement algorithms find out where in available real-memory to load a program. Common techniques are first-fit, next-fit, and best-fit. Replacement algorithms are used if memory is full, and one process (or part of process) requires to be swapped out to accommodate a new program. The replacement algorithm finds out which are the partitions to be swapped out.
Explain the Types of Jobs?
What method does the Kernel in Unix System V follow while selecting a swap device between the multiple swap devices?
Write down the main functions of operating system?
What is meant by the thrashing?
What do you mean by DNS? Explain why it is used? Also describe ‘forward lookup’ and ‘reverse lookup in the DNS?
Explain about microkernel and macro kernel?
Specify what is understood by the distributed systems?
Explain the benefit of the Dynamic Loading.
State the difference between Complier and the Interpreter?
Write down the four layers which Windows NT have in order to attain independence?
18,76,764
1950459 Asked
3,689
Active Tutors
1418980
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!